Question: Solve the following linear programming model graphically: Maximize 2x1 + 4x2 Subject to: c1: 2x1+x2 0 c2: 2x1+2x2 50 c3: 4x1+x2 145 c4: x1 30
Solve the following linear programming model graphically:
Maximize 2x1 + 4x2
Subject to: c1: 2x1+x2 0
c2: 2x1+2x2 50
c3: 4x1+x2 145
c4: x1 30
x1,x2 0
-
(e) Suppose both x1 and x2 are constrained to be integer numbers. What are the new optimal decision variables and the new optimum function value?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
