Question: 3. (10 pts) Given a linear program as below (non-negative constraints are omitted): Min 35X, +68X, - 4X, S.T. X-X,20 X, 400 X, X, X,

3. (10 pts) Given a linear program as below

3. (10 pts) Given a linear program as below (non-negative constraints are omitted): Min 35X, +68X, - 4X, S.T. X-X,20 X, 400 X, X, X, > 0 To solve the linear program by using QM, you need to enter the linear program into computer. Fill up the following table as you're entering the linear program into QM. (No QM solution is needed. Just fill up the table below with the entries you type in QM to solve the linear program.) X X or = ? RHS Max or Min ? (highlight one) Constraint 1 Constraint 2 Constraint 3 4. (6 pts) The following shows a printout of the QM solution of a linear program. The two variables represent production quantities of two products. The two constraints are concerned about two resources, carpentry hours and painting hours. Module/ submodule: Linear Programming Objective: Maximize total profit Results X1 RHS Dual Maximize Carpentry hours Painting hours 15 5 10 20 2.5 20 290 850 1.3333 0 Solution 50 16 1,070 Answer the following questions according to the above QM printout: (4.1) What is the optimal solution? Your answer: (4.2) What is the optimal objective function value? Your answer: (4.3) How many painting hours are to be used with the optimal solution? Your

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!