Explanation Given: The minimization linear programming problem is, Minimize : w = 4 y 1 + 2 y 2 subject t o : y 1 + 3 y 2 ≥ 6 2 y 1 + 8 y 2 ≤ 21 with y 1 ≥ 0 , y 2 ≥ 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 = 4 y 1 + 2 y 2 subject t o : y 1 + 3 y 2 ≥ 6 2 y 1 + 8 y 2 ≤ 21 with y 1 ≥ 0 , y 2 ≥ 0. . Here, the given linear programming is of minimization type, change the minimization objective function into maximization by taking z = − w . So, the objective function become, Maximize : z = − 4 y 1 − 2 y 2 . Note that, the constraints in the maximization problem are same as minimization problem. Thus, the equivalent maximization problem is as follows. Maximize : z = − 4 y 1 − 2 y 2 subject t o : y 1 + 3 y 2 ≥ 6 2 y 1 + 8 y 2 ≤ 21 with y 1 ≥ 0 , y 2 ≥ 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 = − 4 y 1 − 2 y 2 subject t o : y 1 + 3 y 2 − s 1 = 6 2 y 1 + 8 y 2 + s 2 = 21 with y 1 ≥ 0 , y 2 ≥ 0 , s 1 ≥ 0 , s 2 ≥ 0. (1) The system (1) can be written in the system linear of equation as, y 1 + 3 y 2 − s 1 = 6 2 y 1 + 8 y 2 + s 2 = 21 4 y 1 + 2 y 2 + z = 0 . Construct the initial simplex tableau form the above linear system as follows. [ y 1 y 2 s 1 s 2 z 1 3 − 1 0 0 6 2 8 0 1 0 21 4 2 0 0 1 0 ] Look the 2 × 2 identity matrix

Finite Mathematics and Calculus with Applications (10th Edition)

10th Edition

ISBN: 9780321979407

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

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 4, Problem 30RE

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 29RE

Chapter 4, Problem 31RE

Students have asked these similar questions

please provide full calculation

The Hydro water department has a monthly service charge of $15 10 and a volume charge of $2 25 for every 100 cubic foet of water. The total monthly cost is equal to the service charge plus the charge for the volume used duning the month. If we let x represent the number of cubic feet of water (in hundreds) and y represent the total monthly cost, then we have total monthly cost volume charge service charge y-2.25x+ 16.1o If the Johnson family used 200 ess water this month than last month, then they can expect OA an increase in their water bil of $30.20 OB. a decrease in their water bil of S4.50 C. a decrease in their water bll of $30.20 OD an increase in their water bil of $4.50

Only Typing allowed.

Chapter 4 Solutions

Finite Mathematics and Calculus with Applications (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 by adding slack variables and subtracting surplus variables.

Videos

To solve: The minimization linear programming problem.

Want to see the full answer?

Chapter 4 Solutions