Write the following linear program in standard form:
Max 5A + 4B
s.t.
2A + 3B ≤ 6
3A + 2B ≥15
4A – 3B ≤ 5
How many extreme points exist in the feasible solution?
What is the optimal solution using the graphical solution
procedure?
Which constraint(s), if any, are non-binding?
What is the value of the objective function at the optimal
solution?
Write the second constraint in standard form.
Assume that the objective function coefficient for A
remains 8, but the objective function coefficient for B
changes from 12 to 6.
Does the optimal solution change?
Assume that the objective function coefficient for A changes
from 8 to 6. Does the optimal solution change?
What is the optimal solution?





