X2? X3?

Contribution (Objective Value)= ? (rounded to nearest 2nd decimal place)

Machine 1 has enter your response here hours of unused time available at the optimal solution

(response should be rounded to nearest 2nd decimal place)

Machine 2 has enter your response here hours of unused time available at the optimal solution

(response should be rounded to nearest 2nd decimal place)

Machine 3 has enter your response here hours of unused time available at the optimal solution

(response should be rounded to nearest 2nd decimal place)

An additional hour of time available for third machine, is worth enter your response here dollars to the firm.

(response should be rounded to nearest 2nd decimal place)

Kalyan Singhal Corp. makes three products, and it has three machines available as resources as given in the following LP problem: Maximize contribution = 4X1+4X2+7X31X1+7X2+4X31002X1+1X2+7X31108X1+4X2+1X3100X1,X2,X30(C1:hoursonmachine1)(C2:hoursonmachine2)(C3:hoursonmachine3) a) Using a computer software for solving LP, the optimal solution achieved is: X1= (round your response to two decimal places)