Question

In: Operations Management

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!

Solutions

Expert Solution

Solution using LINGO is as follows:

Result:

A = 150

B = 75

Optimal objective value =  1.5*150+1.5*75

= 337.5

-----------------------------------------------------------------------

Using Excel

Create Excel model as follows:

Enter Solver Parameters as follows:

Click Solve to generate the result.

After that, values will appear automatically in yellow cells.

Result:

A = 150

B = 75

Objective function value = 1.5*150+1.5*75 = 337.5


Related Solutions

Consider the following linear programming problem: Maximize 16X + 14Y Subject to: 3X + 4Y ≤...
Consider the following linear programming problem: Maximize 16X + 14Y Subject to: 3X + 4Y ≤ 520 3X + 2Y ≤ 320 all variable ≥ 0 The maximum possible value for the objective function is
Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 +...
Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 + 3x2 + x3 ≥ 30 2x1 + x2 + x3 ≤ 50 4x1 + 2x2 + 3x3 ≤ 120 x1, x2, x3 ≥ 0 a) Find the optimal solution by using simplex method b) Find the dual price for the first constraint. c) Find the dual price for the second constraint. d) Find the dual price for the third constraint. e) Suppose the right-hand...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤ 40 hr Constraint A 3X1 + 3X2 ≤ 30 hr Constraint B X1, X2 ≥ 0 Constraint C if A and B are the two binding constraints. (Round to ONLY two digits after decimal points) a) What is the range of optimality of the objective function?   Answer ≤ C1/C2  ≤  Answer b) Suppose that the unit revenues for X1 and X2 are changed to $100 and...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤ 40 hr Constraint A 3X1 + 3X2 ≤ 30 hr Constraint B X1, X2 ≥ 0 Constraint C if A and B are the two binding constraints. (Round to ONLY two digits after decimal points) a) What is the range of optimality of the objective function?   .......... ≤ C1/C2  ≤  ............ b) Suppose that the unit revenues for X1 and X2 are changed to $100 and...
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
Consider the following linear programming problem Maximize $1 X1 + $2 X2 Subject To 2 X1...
Consider the following linear programming problem Maximize $1 X1 + $2 X2 Subject To 2 X1 + X2 ≤ 8 Constraint A X1 + X2 ≤ 5 Constraint B X1, X2 ≥ 0 Constraint C Note: Report two digits after the decimal point. Do NOT use thousands-separators (,) 1 - Which of the following is the correct standard maximization form for the above linear programming problem AnswerCorrectNot Correct AnswerCorrectNot Correct AnswerCorrectNot Correct AnswerCorrectNot Correct Z -X1 - 2 X2 =...
Please explain Question 1 Consider the following linear programming problem: Maximize 3.5x1 + 7x2 Subject to...
Please explain Question 1 Consider the following linear programming problem: Maximize 3.5x1 + 7x2 Subject to 4x1 + 3x2 > =12 -4x1 - 6x2 =< 12 x2 > =3 x1, x2 > 0 The above linear programming problem: exhibits unboundedness Question 2 Consider the following linear programming Minimize 6x1 + 4x2 Subject to 5x1 + 3x2 =< 15 6x1 + 8x2 > =48 x2 > =6 x1, x2 > 0 The above linear programming problem: exhibits infeasibility
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
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​...
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y          &
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y                   Subject to              4X +   5Y = 40,000                                                                X ≥   3,000                                                                Y ≥   4,000                                                     X ≥ 0 and Y ≥ 0 Use a graph to show each constraint and to identify feasible region. Identify the optimal solution point on your graph. What are the values of X and Y at the optimal solution? From your graph, what is the optimal value of...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT