Question: Consider the following linear programming model with 4 regular constraints: Maximize 3X+5Y (a) Draw your graph in the space below: subject to: 4X+4Y48 (constraint #1)

Consider the following linear programming model with 4 regular constraints: Maximize 3X+5Y (a) Draw your graph in the space below: subject to: 4X+4Y48 (constraint \#1) 4X+3Y50 (constraint \#2) 2X+1Y20 (constraint \#3) X2 (constraint \#4) X,Y0 (non-negativity constraints) (a) Which of the constraints is redundant? Constraint \#_ Justify by drawing a graph similar to Figure 7.14 on p.263. (b) Is point (9,3) a feasible solution? . Explain your answer (by analyzing each of the constraints). Constraint \#1: Constraint \#2: Constraint \#3: Constraint \#4
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
