Question: Consider the following mixed - integer linear program. Max 3 x 1 + 4 x 2 s . t . 4 x 1 + 9

Consider the following mixed-integer linear program.
Max 3x1+4x2
s.t.
4x1+9x2<=36
9x1+7x2<=63
x1, x2>= and x1 integer
(a)
Graph the constraints for this problem. Indicate on your graph all feasible mixed-integer solutions.
On the coordinate plane the horizontal axis is labeled x1 and the vertical axis is labeled x2. A region bounded by a series of connected line segments, and several horizontal lines are on the graph.
The series of line segments connect the approximate points (0,4),(5.943,1.358), and (7,0).
The region is above the horizontal axis, to the right of the vertical axis, and below the line segments.
At each integer value between 0 and 4 on the vertical axis, a horizontal line extends out from the vertical axis to the series of connect line segments.
On the coordinate plane the horizontal axis is labeled x1 and the vertical axis is labeled x2. A region bounded by a series of connected line segments, and several horizontal lines are on the graph.
The series of line segments connect the approximate points (0,7),(1.358,5.943), and (4,0).
The region is above the horizontal axis, to the right of the vertical axis, and below the line segments.
At each integer value between 0 and 7 on the vertical axis, a horizontal line extends out from the vertical axis to the series of connect line segments.
On the coordinate plane the horizontal axis is labeled x1 and the vertical axis is labeled x2. A region bounded by a series of connected line segments, and several vertical lines are on the graph.
The series of line segments connect the approximate points (0,4),(5.943,1.358), and (7,0).
The region is above the horizontal axis, to the right of the vertical axis, and below the line segments.
At each integer value between 0 and 7 on the horizontal axis, a vertical line extends up from the horizontal axis to the series of connect line segments.
On the coordinate plane the horizontal axis is labeled x1 and the vertical axis is labeled x2. A region bounded by a series of connected line segments, and several vertical lines are on the graph.
The series of line segments connect the approximate points (0,7),(1.358,5.943), and (4,0).
The region is above the horizontal axis, to the right of the vertical axis, and below the line segments.
At each integer value between 0 and 4 on the horizontal axis, a vertical line extends up from the horizontal axis to the series of connect line segments.
(b)
Find the optimal solution to the LP Relaxation. Round the value of
x1
down to find a feasible mixed-integer solution. (Round the values of
x2
and the optimal solution to three decimal places, if necessary.)
at
(x1, x2)=
Is this solution optimal?
Yes
No
(c)
Find the optimal solution for the mixed-integer linear program. (Round your answers to three decimal places, when necessary.)
at
(x1, x2)=

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 Programming Questions!