Question

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.

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
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 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 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  
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 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...
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)
Solve the following linear program: Max 5x + 10y 1x        <= 100             A          1y<=...
Solve the following linear program: Max 5x + 10y 1x        <= 100             A          1y<= 80             B 2x + 4y <= 400            C What is the profit at the optimal solution? Group of answer choices The model becomes unbounded $500 $800 Alternate optimal solutions exist
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
Consider the following linear programming problem: Max 8X + 7Y s.t. 15X + 5Y ≤ 75...
Consider the following linear programming problem: Max 8X + 7Y s.t. 15X + 5Y ≤ 75 10X + 6Y ≤ 60 X + Y ≤ 8 X, Y ≥ 0 The optimal value of the objective function is ________. A)59 B)61 C)58 D)60
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...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT