Maximisation Problem

Question 1

What are the phases of solving a maximisation linear programming model?

Answer 1

1: Linear programming model formulation
2: Solving the model
3: Interpret the solution found

Question 2

What is ‘solving a model’?

Answer 2

Finding the number of units that actually maximise the objective function satisfying the constraints

Question 3

What is the ‘solution’?

Answer 3

Any value for the decision variables that respects the constraints

Question 4

What is the ‘optimal solution’?

Answer 4

The solution that respects the constrains and with the maximum value for the objective function

Question 5

How do you get the optimal solution for a linear programming model?

Answer 5

1. Draw a graph
2. Plot the constraints
3. Individuating all the possible solution (the feasible region)
4. Identify the corner points
5. Choose best solution

Question 6

What is the point where x1 = 0 and x2 = 0 known as?

Answer 6

The origin

Question 7

What is the point where x1 = 0 and x2 = 0 known as?

Answer 7

The origin

Question 8

Where does the optimal solution lie on the graph?

Answer 8

Lies at a corner point of a feasible region