Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. HINT [See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.) Minimize c = 0.3x + 0.2y subject to 0.1x + 0.2y 2 1 0.3x+ 0.15y > 1.5 10x + 10y > 80 x 2 0, y 2 0. C = (x, y) =|

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter6: Linear Systems
Section6.8: Linear Programming
Problem 40E
icon
Related questions
Question
Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is
unbounded. HINT [See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.)
Minimize c = 0.3x + 0.2y subject to
0.1x+ 0.2y> 1
0.3х + 0.15y2 1.5
10x + 10y > 80
х20, у2 0.
с 3
(х, у) -
Transcribed Image Text:Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. HINT [See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.) Minimize c = 0.3x + 0.2y subject to 0.1x+ 0.2y> 1 0.3х + 0.15y2 1.5 10x + 10y > 80 х20, у2 0. с 3 (х, у) -
Expert Solution
Step 1

Given : LP problem

  Minimize   c=0.3x+0.2y   subject to          0.1x+0.2y10.3x+0.15y1.510x+10y80x0, y0

To find : value of c and the point at which optimal solution is obtained

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning