Question

Objective function P=70x+40y is subject to the following constraints: 4x+3y ≤ 26 x+2y ≤ 10 3≤...

Objective function P=70x+40y is subject to the following constraints:

4x+3y ≤ 26

x+2y ≤ 10

3≤ x ≤6

y≥2

x≥0 and y≥0

Optimal point is (5,2) and the maximum profit is $430

Question:Find the constraints that are binding and the ones that are redundant(i.e., is not needed to delineate the feasibility region)(please show your solution)

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

Homework Answers

Answer #1

We find solution by using graphical method,

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 program: Max profit 8X + 4Y Subject to: 4X + 3Y ≤...
Consider the following linear program: Max profit 8X + 4Y Subject to: 4X + 3Y ≤ 480 2X + 3Y ≤ 360 X,Y ≥ 0 Use the corner point solution method to solve this linear program. The followings must be included in your answer: a) defined decision variables. b)a graph with constraints lines. c)highlighted feasible region. d)specified coordinates and profit for each corner point. e)specified optimal values of X and Y and optimal profit.
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)?...
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...
Consider the following linear programming problem. Maximize P = 4x + 6y + 9z subject to...
Consider the following linear programming problem. Maximize P = 4x + 6y + 9z subject to the constraints    2x + 3y + z ≤ 900 3x + y + z ≤ 350 4x + 2y + z ≤ 400  x ≥ 0, y ≥  0, z ≥  0 Write the initial simplex tableau. x y z s1 s2 s3 P Constant 900 350 400 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...
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?
geographically analyze the following problem. maximize profit = $4X+$6Y subject to X + 2Y <= 8...
geographically analyze the following problem. maximize profit = $4X+$6Y subject to X + 2Y <= 8 hours 6X + 4Y <= 24 hours a. what is the optimal solution? b. if the first constraint is altered to X + 3Y<=8 does the feasable solution change
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.
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...
Maximize x + 2y subject to the following constraints (using the simplex method) -x+ y <=...
Maximize x + 2y subject to the following constraints (using the simplex method) -x+ y <= 100 6x + 6y <= 1200 x>=0, y>=0
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...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT