Solve the linear programming problem. Maximize z=15x+15y , Subject to 9x+7y greater than or equals 153...

Solve the linear programming problem. Maximize z=15x+15y , Subject to 9x+7y greater than or equals 153 , 13x-11y greater than or equals 31 , x+y less than or equals 43 , x,y greater than or equals 0

What is the maximum value of z?

Select the correct choice below and fill in any answer boxes present in your choice.

A. z=( ? )

(Type an integer or a fraction.)

B. There is no maximum value of z.

At what corner point(s) does the maximum value of z occur?

Select the correct choice below and fill in any answer boxes present in your choice.

A. The maximum value of z occurs at the corner point(s) ( ? )

nothing.(Type an ordered pair. Use a comma to separate answers as needed.)

B. There is no maximum value of z.

Expert Solution

milcah answered 2 years ago

L.P.? Model: Minimize Z equals = 15 15X plus + 15 15Y Subject? to: 7 7X...

L.P.? Model: Minimize Z equals = 15 15X plus + 15 15Y Subject? to: 7 7X plus + 11 11Y greater than or equals ? 88 88 ?(C1?) 16 16X plus + 4 4Y greater than or equals ? 64 64 ?(C2?) ?X,Y greater than or equals ?0 On the graph on? right, constraints C1 and C2 have been drawn.?? Using the point drawing tool?, plot all the corner points for the feasible area. The optimum solution? is: X? =...

Consider the following linear programming problem: Z=$15X+$20Y Subject to: 8X+5Y<=40 0.4X+Y>=4 Solve the values of x...

Consider the following linear programming problem: Z=$15X+$20Y Subject to: 8X+5Y<=40 0.4X+Y>=4 Solve the values of x and y that will maximize revenue by using the corner point method graphical approach to linear programming. What revenue will result? Please show work.

Solve the following linear programming problem by the graphical method. Maximize Z = 400 X1 +...

Solve the following linear programming problem by the graphical method. Maximize Z = 400 X1 + 200 x 2 Subject to : X1 + 8X2 <= 24 X1 + 2X2 <= 12 X1 >= 0 , X2 >= 0 You will need to graph each of the constraints to answer the following questions. You can draw a rough graph. a) State the coordinates of the point where the constraints interact. b) Define in words the region of feasible solutions. c)...

Use the simplex method to solve the linear programming problem. Maximize objective function: Z= 6x1 +...

Use the simplex method to solve the linear programming problem. Maximize objective function: Z= 6x1 + 2x2 Subject to constraints: 3x1 + 2x2 <=9 x1 + 3x2 <= 5 when x1, x2 >=0

Solve the following linear programming problem by solver. Maximize Z = 7 x1 + 5 x2...

Solve the following linear programming problem by solver. Maximize Z = 7 x1 + 5 x2 + 5 x3 subject to x1 + x2 + x3 <= 25 2 x1 + x2 + x3 <= 40 x1 + x2 <= 25 x3 <= 6 x1, x2, x3 >= 0 (non-negativity conditions)

For the following linear programming problem: Maximize z = 2x1+ x2 Such that ...

For the following linear programming problem: Maximize z = 2x1+ x2 Such that x1+ 2x2 ≤ 12 x2 ≥ 3 x1,x2 ≥ 0 (a) Write the first two constraints in equation form by adding slack or subtracting excess (surplus) variables. (b)Find all basic solutions for this LP (c) Which of these solutions are feasible? (d)Which of these feasible solutions is optimal? Find the optimal value of z

Maximize p = 2x + 7y + 5z subject to x + y + z ≤...

Maximize p = 2x + 7y + 5z subject to x + y + z ≤ 150 x + y + z ≥ 100 x ≥ 0, y ≥ 0, z ≥ 0. P= ? (x, y, z)= ?

The objective of a linear programming problem is to maximize 1.50A + 1.50B, subject to 3A...

The objective of a linear programming problem is to maximize 1.50A + 1.50B, subject to 3A + 2B ≤ 600, 2A + 4B ≤ 600, 1A + 3B ≤ 420, and A,B ≥ 0. Using Lingo software determine the optimal product mix for this problem? (include Lingo output) Please use excel! Thanks!

Consider the following Integer Linear Programming (ILP) model Maximize Z = X1 + 4X2 Subject to...

Consider the following Integer Linear Programming (ILP) model Maximize Z = X1 + 4X2 Subject to X1 + X2 < 7 // Resource 1 –X1 + 3X2 < 3 // Resource 2 X1, X2 > 0 X1, X2 are integer i. Consider using the Branch and Bound (B & B) technique to solve the ILP model. With the help of Tora software, draw the B & B tree. Always give priority for X1 in branching over X2. Clearly label the...

Solve the linear programming problem by the method of corners. Maximize P = 5x + 6y ...

Solve the linear programming problem by the method of corners. Maximize P = 5x + 6y subject to x + y ≤ 10 3x + y ≥ 12 −2x + 3y ≥ 8 x ≥ 0, y ≥ 0

Question