Question
Find the complete optimal solution to this linear programming problem. Min 3X + 3Y s.t. 12X + 4Y 48 10X + 5Y 50
Find the complete optimal solution to this linear programming problem.
| Min | 3X + 3Y |
| s.t. | 12X + 4Y ≥ 48 |
| 10X + 5Y ≥ 50 | |
| 4X + 8Y ≥ 32 | |
| X , Y ≥ 0 |
Group of answer choices
a. x=4, y=4, z=18, s1=8, s2=0, s3=0
b. x=4, y=2, z=18, s1=8, s2=0, s3=0
c. x=4, y=2, z=18, s1=0, s2=0, s3=0
d. x=4, y=3, z=18, s1=8, s2=0, s3=0
Step by Step Solution
3.53 Rating (163 Votes )
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Operations management processes and supply chain
Authors: Lee J Krajewski, Larry P Ritzman, Manoj K Malhotra
9th edition
9788131728840, 136065767, 8131728846, 978-0136065760
