Question

(An Unbounded Feasible Region). Consider the problem: Maximize: 3x + 4y 2x+y ≥ 10 x+2y ≥...

  1. (An Unbounded Feasible Region). Consider the problem: Maximize: 3x + 4y

    2x+y ≥ 10 x+2y ≥ 14 x,y ≥ 0

    a) Draw the feasible set for this linear programming problem. Identify the extreme points and infinite rays.
    b) Express the points (3,7) and (10,10) in terms of the extreme points and infinite rays of the feasible set.

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Maximize objective function P=3x+4y subject to: x + y ≤ 7 x ≥ 0 x+4y ≤...
Maximize objective function P=3x+4y subject to: x + y ≤ 7 x ≥ 0 x+4y ≤ 16 y ≥ 0 Attach image from graphing calculator or draw your own graph, if desired – must show feasible region and identify critical (corner) points to receive full credit!
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y...
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y + 3z subject to 2x + y + z ≤ 14 3x + 2y + 4z ≤ 24 2x + 5y − 2z ≤ 10 x ≥ 0, y ≥ 0, z ≥ 0   The maximum is P =   at (x, y, z) = ( ) .
1. Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is...
1. 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.) Maximize p = 3x + 2y subject to 1.8x + 0.9y ≤ 9 0.15x + 0.3y ≤ 1.5 8x + 8y ≤ 48 x ≥ 0, y ≥ 0. p = (x,y) = 2. Solve the LP problem. If...
Consider the following Linear Programming model: Maximize x+2.5y Subject to x+3y<=12 x+2y<=11 x-2y<=9 x-y>=0 x+5y<=15 x>=0...
Consider the following Linear Programming model: Maximize x+2.5y Subject to x+3y<=12 x+2y<=11 x-2y<=9 x-y>=0 x+5y<=15 x>=0 y>=0 (a) Draw the feasible region for the model, but DO NOT draw the objective function. Without graphing the objective function, find the optimal solution(s) and the optimal value. Justify your method and why the solution(s) you obtain is (are) optimal. (4 points) (b) Add the constraint “x+5y>=15” to the Linear Programming model. Is the optimal solution the same as the one in (a)?...
Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty...
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.) Maximize p = 3x + y subject to 5x − 8y ≤ 0 8x − 5y ≥ 0 x + y ≤ 13 x ≥ 0, y ≥ 0. p = ? (x, y) = ?
Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty...
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.) Maximize and minimize p = x + 2y subject to x + y ≥ 2 x + y ≤ 10 x − y ≤ 2 x − y ≥ −2. Minimum: p= (x,y)= Maximum: p= (x,y)=
1. It is impossible for a linear program with unbounded feasible region to have a unique...
1. It is impossible for a linear program with unbounded feasible region to have a unique optimal solution. True or False? 2. It is impossible for an integer program to have infinitely many optimal solutions. True or False? 3. When we solve an integer program with a minimization objective using Branch and Bound, we can discard a subproblem for which the optimal objective value of the associated LP is larger than the objective value of the incumbent solution. True or...
Use the simplex method to solve the linear programming problem. Maximize P = 4x + 3y...
Use the simplex method to solve the linear programming problem. Maximize P = 4x + 3y subject to 3x + 4y ≤ 30 x + y ≤ 9 2x + y ≤ 17 x ≥ 0, y ≥ 0  
Solve the linear programming problem by the method of corners. Maximize P = 2x + 3y    ...
Solve the linear programming problem by the method of corners. Maximize P = 2x + 3y     subject to   x + y ≤ 10 3x + y ≥ 12 −2x + 3y ≥ 11 x ≥ 0, y ≥ 0
Solve the linear programming problem by the simplex method. Maximize   P = 5x + 4y subject...
Solve the linear programming problem by the simplex method. Maximize   P = 5x + 4y subject to   3x + 5y ≤ 214 4x + y ≤ 172 x ≥ 0, y ≥ 0    The maximum is P = at (x, y) = .
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT