Question: A Linear programming problem has the following three constraints: 16X + 16Y
A Linear programming problem has the following three constraints: 16X + 16Y <= 256; 9X + 15Y= 135; and 16X - Y <= 74 . The objective function is Min 19X + 25Y . What combination of X and Y will yield the optimum solution for this problem?
a. unbounded problem
b. infeasible problem
c. 15 , 0
d. 5 , 6
e. 0 , 9
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
