Explanation Given: The minimization linear programming problem is, Minimize : w = 24 y 1 + 30 y 2 + 36 y 3 subject t o : 5 y 1 + 10 y 2 + 15 y 3 ≥ 1200 y 1 + y 2 + y 3 ≤ 50 with y 1 ≥ 0 , y 2 ≥ 0 , y 3 ≥ 0. . Method used: “Solving a Nonstandard Problem: 1. If necessary, convert the problem to a maximization problem. (If the minimization problem has objective function w , rewrite as a maximization problem with the same constraints and objective function z = − w ). 2. Add slack variables and subtract surplus variables as needed. 3. Write the initial simplex tableau. 4. If any basic variable has a negative value, locate the nonzero number in that variable`s column, and note what row it is in. 5. In the row located in Step 4, find the positive entry that is farthest to the left, and note what column it is in. 6. In the column found in Step 5, choose a pivot by investigating quotients. 7. Use the row operations to change the other numbers in the pivot column to 0. 8. Continue Step 4through 7 until all basic variables are nonnegative. If it never becomes impossible to continue, then the problem has no feasible solution. 9. Once, a feasible solution has been found, continue to use the simplex method until the optimal solution is not found.” Calculation: The minimization linear programming problem is, Minimize : w = 24 y 1 + 30 y 2 + 36 y 3 subject t o : 5 y 1 + 10 y 2 + 15 y 3 ≥ 1200 y 1 + y 2 + y 3 ≤ 50 with y 1 ≥ 0 , y 2 ≥ 0 , y 3 ≥ 0. . Change the minimization objective function into maximization by taking z = − w . So, the objective function become, Maximize : z = − 24 y 1 − 30 y 2 − 36 y 3 . Note that the constraints in the maximization problem are same as minimization problem. Thus, the equivalent maximization problem is as follows. Maximize : z = − 24 y 1 − 30 y 2 − 36 y 3 subject t o : 5 y 1 + 10 y 2 + 15 y 3 ≥ 1200 y 1 + y 2 + y 3 ≤ 50 with y 1 ≥ 0 , y 2 ≥ 0 , y 3 ≥ 0. Note that, the above linear programming problem is maximization type. So, it is in standard form. Subtract a surplus variable s 1 in first constraint, add a slack variable s 2 in second constraint, and rewrite the linear programming problem as follows. Maximize : z = − 24 y 1 − 30 y 2 − 36 y 3 subject t o : 5 y 1 + 10 y 2 + 15 y 3 − s 1 = 1200 y 1 + y 2 + y 3 + s 2 = 50 with y 1 ≥ 0 , y 2 ≥ 0 , y 3 ≥ 0 , s 1 ≥ 0 , s 2 ≥ 0. (1) The system (1) can be written in the system linear of equation as, 5 y 1 + 10 y 2 + 15 y 3 − s 1 = 1200 y 1 + y 2 + y 3 + s 2 = 50 24 y 1 + 30 y 2 + 36 y 3 + z = 0 Construct the initial simplex tableau form the above linear system as follows

Finite Mathematics and Calculus with Applications Books a la Carte Plus MyLab Math Package (10th Edition)

10th Edition

ISBN: 9780133935592

Author: Margaret L. Lial, Raymond N. Greenwell, Nathan P. Ritchey

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 4, Problem 32RE

To determine

To solve: The minimization linear programming problem.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 4, Problem 31RE

Chapter 4, Problem 33RE

Students have asked these similar questions

PLEASE SHOW ME THE RIGHT ANSWER/SOLUTION SHOW ME ALL THE NEDDED STEP 13: If the perimeter of a square is shrinking at a rate of 8 inches per second, find the rate at which its area is changing when its area is 25 square inches.

DO NOT GIVE THE WRONG ANSWER SHOW ME ALL THE NEEDED STEPS 11: A rectangle has a base that is growing at a rate of 3 inches per second and a height that is shrinking at a rate of one inch per second. When the base is 12 inches and the height is 5 inches, at what rate is the area of the rectangle changing?

please answer by showing all the dfalowing necessary step DO NOT GIVE ME THE WRONG ANSWER The sides of a cube of ice are melting at a rate of 1 inch per hour. When its volume is 64 cubic inches, at what rate is its volume changing?

Chapter 4 Solutions

Finite Mathematics and Calculus with Applications Books a la Carte Plus MyLab Math Package (10th Edition)

Ch. 4.1 - Prob. 1YT Ch. 4.1 - Prob. 2YT Ch. 4.1 - Prob. 1E Ch. 4.1 - Prob. 2E Ch. 4.1 - Prob. 3E Ch. 4.1 - Convert each inequality into an equation by adding...Ch. 4.1 - For Exercises 58, (a) determine the number of...Ch. 4.1 - Prob. 6E Ch. 4.1 - Prob. 7E Ch. 4.1 - Prob. 8E

Knowledge Booster

$Calculus$

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, calculus and related others by exploring similar questions and additional content below.

The minimization linear programming problem.

Solution Summary: The author explains how to solve the minimization linear programming problem.

Videos

To solve: The minimization linear programming problem.

Want to see the full answer?

Chapter 4 Solutions