Decision - Linear Programming Flashcards
What is a decision variable?
The decision variables are the number of each things that can be varied
What is a objective function?
The objective functions are the equations that you are trying to maximise or minimise
What are the constraints?
The constraints are the things that give rise to the objective functions
Each constraint will give rise to one inequality
What is a feasible solution?
A feasible solution is a solution that satisfies all the decision variables
What is a feasible region?
A feasible region is a region in which all the feasible solutions can be found
Wha tis the optimal solution?
Explain further.
The optimal solution is the feasible solution that meets the objective
There could be more than one optimal solution
What is commonly forgotten when doing linear programming?
Non negativity
How do you formulate a linear programming problem?
1) Define the decision variables (x,y,z etc)
2) State the objective (maximise or minimise, together with the objective function)
3) Write the constraints as inequalities
What is the custom when sketching the feasible region?
To shade everything but the feasible region
What are the 2 methods called for locating the optimal points?
Objective line method aka Ruler Method
Vertex checking method
Explain the Objective line method?
For the objective line method you need to sland your ruler such that its gradient is the same as the objective functions. Then you move it across the page until it intercepts the feasible region
Where will the maximum optimal solution be found?
The far end of the region
Where will the minimum optimal solution be?
The near end of the feasible region
What do you need to remember about giving answers?
The answer needs to be in context of the question with the profit being stated
Explain the vertex checking method
In this method you first find the co ordinates of all of the vertices. Then you evaluate the objective function at all of these points
Hen you select the vertex that gives the optimal solution