Question

Consider the following Linear Programming model: Minimize -2x+y Subject to x-y<=1 2y-x<=3 x+10y<=50 2x+y<=14 x>=0 y>=0...

Consider the following Linear Programming model:

Minimize -2x+y

Subject to

x-y<=1

2y-x<=3

x+10y<=50

2x+y<=14

x>=0 y>=0

(a) Draw the feasible region and objective function for the model. Report what you find about the optimal solution(s) and the optimal value. Justify your finding. (4 points)

(b) Is there any redundant constraint? Which one(s) and why?

Math   Algebra   
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
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)?...
Consider the following linear programming model with 4 regular constraints: Maximize 3X + 5Y subject to:...
Consider the following linear programming model with 4 regular constraints: Maximize 3X + 5Y subject to: 4X + 4Y ≤ 48 (constraint #1) 2X + 3Y ≤ 50 (constraint #2) 1X + 2Y ≤ 20 (constraint #3) Y ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints) (a) Which of the constraints is redundant? Constraint #____. Justify using the data from the above LP model: ________________________________________________________________________ ________________________________________________________________________ ________________________________________________________________________ (b) Is solution point (10,5) a feasible solution? _____. Explain using...
The following constraints of a linear programming model have been graphed on the graph paper provided...
The following constraints of a linear programming model have been graphed on the graph paper provided to form a feasible region: 2X    + 6Y     >=    120 10X + 2Y     > =   200 X      +     Y     <=    120 X                     <=    100                  Y    <=      80 X,Y                  >=        0 Using the graphical method, determine the optional solution and the objective function value for the following objective functions. Graph the objective function as a dashed line on the feasible region described by the...
(An Unbounded Feasible Region). Consider the problem: Maximize: 3x + 4y 2x+y ≥ 10 x+2y ≥...
(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.
The following constraints of a linear programming model have been graphed on the graph paper provided...
The following constraints of a linear programming model have been graphed on the graph paper provided (same constraints found in problem #3) to form a feasible region: 2X    + 6Y     >=    120 10X + 2Y     > =   200 X      +     Y     <=    120 X                     <=    100                  Y    <=      80 X,Y                  >=        0 Using the graphical method, determine the optional solution and the objective function value for the following objective functions. Graph the objective function as a dashed line on...
Solve the following linear programming model by using the graphical method: graph the constraints and identify...
Solve the following linear programming model by using the graphical method: graph the constraints and identify the feasible region. Using the corner points method, determine the optimal solution (s) (show your work). Maximize Z = 6.5x1 + 10x2 Subject to x1 + x2 ≤ 15 2x1 + 4x2 ≤ 40 x1 ≥ 8 x1, x2 ≥ 0 b. If the constraint x1 ≥ 8 is changed to x1 ≤ 8, what effect does this have on the optimal solution? Are...
Given the following linear optimization problem Maximize 10x + 20y Subject to x + y ≤...
Given the following linear optimization problem Maximize 10x + 20y Subject to x + y ≤ 50 2x + 3y ≤ 120 x ≥ 10 x, y ≥ 0 (a) Graph the constraints and determine the feasible region. (b) Find the coordinates of each corner point of the feasible region. (c) Determine the optimal solution and optimal objective function value.
Consider the following linear programming model MAX 100 C + 80 S C <= 20 S...
Consider the following linear programming model MAX 100 C + 80 S C <= 20 S - C >= 10 C , S >= 0 The feasible region is shaded. At the optimal solution, the objective function value is 5,200 What is the maximum allowable increase in the RHS of the constraint C <= 20 ?
Consider the following linear programming problem: Maximize 12X + 10Y Subject to: 4X + 3Y <=...
Consider the following linear programming problem: Maximize 12X + 10Y Subject to: 4X + 3Y <= 480 2X + 3Y <= 360 all variables >= 0 The maximum possible value for the objective function is Selected Answer: c. 1520.
Use the method of this section to solve the linear programming problem. Minimize   C = x...
Use the method of this section to solve the linear programming problem. Minimize   C = x + 2y subject to   4x + 7y ≤ 60 2x + y = 28 x ≥ 0, y ≥ 0    The minimum is C =   at (x, y) =
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT