Question: Consider the following IP problem. Maximize z = 3 x 1 + 2 x 2 , subject to Constraint 1: 2 x 1 + 3
Consider the following IP problem.
Maximize z = 3x1 + 2x2,
| subject to | |
|---|---|
| Constraint 1: | 2x1 + 3x2 35, |
| Constraint 2: | 3x1 + x2 25, |
| Constraint 3: | x1, x2 0, |
| Constraint 4: | x1, x2 = non-negative integer, |
where x1 and x2 represent the decision variables. Solve this IP problem and answer the following questions.
a. What are the values of x1 and x2 at the optimal solution? What is the maximum value of z?
b.If the objective function coefficients change to z = 4x1 + 3x2, what are the values of x1 and x2 at the optimal solution? What is the maximum value of z?
c.Using the original objective function coefficients, if the first constraint changes to 2x1 + 3x2 42, what are the values of x1 and x2 at the optimal solution? What is the maximum value of z?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
