Consider the following all-integer linear program: Max 5x1 + 8x2 s.t. 5x1 + 5x2 < 32 9x1 + 3x2 < 38 x1 + 2x2 < 12 X1, x2 2 0 and integer a. Choose the correct graph which shows the constraints for this problem and uses dots to indicate all feasible integer solutions. (i) (ii) 5- 4- 3- 2- 1- 6 (iii) (iv) 3- 14 b. Find the optimal solution to the LP Relaxation. If required, round your answers to two decimal places. X1= X2= Optimal Solution to the LP Relaxation Round down to find a feasible integer solution. If your answer is zero enter "0". X1= X2= Feasible integer solution c. Find the optimal integer solution. If your answer is zero enter "0". X1= X2= Optimal Integer Solution Is it the same as the solution obtained in part (b) by rounding down?
Consider the following all-integer linear program: Max 5x1 + 8x2 s.t. 5x1 + 5x2 < 32 9x1 + 3x2 < 38 x1 + 2x2 < 12 X1, x2 2 0 and integer a. Choose the correct graph which shows the constraints for this problem and uses dots to indicate all feasible integer solutions. (i) (ii) 5- 4- 3- 2- 1- 6 (iii) (iv) 3- 14 b. Find the optimal solution to the LP Relaxation. If required, round your answers to two decimal places. X1= X2= Optimal Solution to the LP Relaxation Round down to find a feasible integer solution. If your answer is zero enter "0". X1= X2= Feasible integer solution c. Find the optimal integer solution. If your answer is zero enter "0". X1= X2= Optimal Integer Solution Is it the same as the solution obtained in part (b) by rounding down?
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
100%
Consider the following all-integer linear program:
Max 5x1 + 8x2
s.t.
5x1 + 5x2 ≤ 32
9x1 + 3x2 ≤ 38
x1 + 2x2 ≤ 12
x1, x2 ≥ 0 and integer
![Consider the following all-integer linear program:
Max
5x1 +
8x2
s.t.
5x1 + 5x2 < 32
9x1 +
3x2 < 38
X1 +
2x2 < 12
X1, x2 2 0 and integer
a. Choose the correct graph which shows the constraints for this problem and uses dots to indicate all feasible integer solutions.
(i)
(ii)
5-
3-
1-
5
6.
1
(iii)
(iv)
54
4-
3
2-
1-
b. Find the optimal solution to the LP Relaxation. If required, round your answers to two decimal places.
X1=
X2%D
Optimal Solution to the LP Relaxation
Round down to find a feasible integer solution. If your answer is zero enter "0".
X1=
X2=
Feasible integer solution
c. Find the optimal integer solution. If your answer is zero enter "0".
X1=
X2=
Optimal Integer Solution
Is it the same as the solution obtained in part (b) by rounding down?](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F81a49520-1027-4f23-8f4c-cd9184719c2e%2F34d83d26-cfb7-4a2f-8826-adc722b6d114%2F1fhkpne_processed.png&w=3840&q=75)
Transcribed Image Text:Consider the following all-integer linear program:
Max
5x1 +
8x2
s.t.
5x1 + 5x2 < 32
9x1 +
3x2 < 38
X1 +
2x2 < 12
X1, x2 2 0 and integer
a. Choose the correct graph which shows the constraints for this problem and uses dots to indicate all feasible integer solutions.
(i)
(ii)
5-
3-
1-
5
6.
1
(iii)
(iv)
54
4-
3
2-
1-
b. Find the optimal solution to the LP Relaxation. If required, round your answers to two decimal places.
X1=
X2%D
Optimal Solution to the LP Relaxation
Round down to find a feasible integer solution. If your answer is zero enter "0".
X1=
X2=
Feasible integer solution
c. Find the optimal integer solution. If your answer is zero enter "0".
X1=
X2=
Optimal Integer Solution
Is it the same as the solution obtained in part (b) by rounding down?
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)