Problem 3-01 (Algorithmic) KINDLY FOLLOW THE FORMAT. THANK YOU!

Consider the following linear program:

Max	3A + 2B
s.t.
	1A + 1B 14
	3A + 1B 24
	1A + 2B 16
	A, B 0

1. Assume that the objective function coefficient for A changes from 3 to 5. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution.

( The same extreme point remains optimal / A new extreme point becomes optimal ) If required, round your answers to one decimal place.

A	fill in the blank 1
B	fill in the blank 2
Optimal solution	fill in the blank 3

2. Assume that the objective function coefficient for A remains 3, but the objective function coefficient for B changes from 2 to 5. Does the optimal solution change? Use the graphical solution procedure to find the new optimal solution.

( The same extreme point remains optimal / A new extreme point becomes optimal ) If required, round your answers to one decimal place.

A	fill in the blank 1
B	fill in the blank 2
Optimal solution	fill in the blank 3

3.

1. The sensitivity report for the linear program in part (a) provides the following objective coefficient range information:

   		Variable		Objective Coefficient		Allowable Increase		Allowable Decrease
   		A		3.00000		3.00000		2.00000
   		B		2.00000		4.00000		1.00000

   Use this objective coefficient range information to answer parts (b) and (c). The objective coefficient range for A is from ________ to _______ so the optimal solution (will / will not) change in part (b) because the new objective coefficient is (in / not in) this range. The objective coefficient range for B is from ________ to _______ so the optimal solution (will / will not) change in part (b) because the new objective coefficient is (in / not in) this range.