6 - Linear programming

Question 1

How is a linear programming problem formulated?

Answer 1

1. Define decision variables
2. State the objective (min/max plus objective function)
3. Write constraints as inequalities

Question 2

Define a feasible solution in linear programming.

Answer 2

Values for decision variables which satisfy each constraint

Question 3

When using the ruler method to maximise a graphical linear programming problem, where is the optimal vertex?

Answer 3

Furthest point from origin

Question 4

When using the ruler method to minimise a graphical linear programming problem, where is the optimal vertex?

Answer 4

Closest point to origin

Question 5

Describe the optimal vertex testing method.

Answer 5

1. First find coordinates of the feasible region
2. Evaluate objective function at each of these points
3. Select vertex that gives the optimal value of the objective function

Question 6

How are linear programming solutions with integer solutions solved?

Answer 6

Consider points with integer solutions near optimal point

For example, if the optimal solution is 4,6 , 9.1 then consider 4,9 4,10 5,9 5,10