Question: QUESTION 4 04 (3 branches each worth 1 mark) represent the Engagement Assessement (3 Marks) Consider the following linear programming problem: Max 8X1 + 7X2

QUESTION 4 04 (3 branches each worth 1 mark)
QUESTION 4 04 (3 branches each worth 1 mark)
QUESTION 4 04 (3 branches each worth 1 mark) represent the Engagement Assessement (3 Marks) Consider the following linear programming problem: Max 8X1 + 7X2 s.t. 15X1 + 1.5X2 5 75 (Constraint 1) 10X1 + 3X2 s 60 (Constraint 2) X1 + 0.3X2 5 9 (Constraint 3) X1, X220 X2 50 C Objective Function Line 5 30 B 6 D 3 20 A E 4 FZ G X1 6 ** WRITE YOUR ANSWER IN THE BOX BELOW THE QUESTION ** 1) What is the feasible region ( Select one number showen in the graph only (1,2,3,4,5,6) 4 2) What is the optimal solution point ( Select one letter showen in the graph only A,B,C,D,E,F,G,H)) 4 3) Which Constraint is binding Constraint ( Select one number only (1,2,3))

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!