Portions of a Management Scientist output are shown below. Use what you know about the solution of linear programs to fill in the ten blanks.

LINEAR PROGRAMMING PROBLEM

MAX 12X1+9X2+7X3

S.T.

1) 3X1+5X2+4X3<150

2) 2X1+1X2+1X3<64

3) 1X1+2X2+1X3<80

4) 2X1+4X2+3X3>116

OPTIMAL SOLUTION

Objective Function Value = 336.000

Variable Value Reduced Costs

---------- ----------- ------------------

X1 _______ 0.000

X2 24.000 ______

X3 _______ 3.500

Constraint Slack/Surplus Dual Prices

------------ ---------------- -------------

1 0.000 15.000

2 ______ 0.000

3 ______ 0.000

4 0.000 ______

OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit

---------- --------------- ----------------- ---------------

X1 5.400 12.000 No Upper Limit

X2 2.000 9.000 20.000

X3 No Lower Limit 7.000 10.500

RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

------------- --------------- ----------------- ---------------

1 145.000 150.000 156.667

2 ______ 64.000 ______

3 ______ 80.000 ______

4 110.286 116.000 120.000

if possible, please write a full explanation!!