Explanation Given Information: The provided linear programming problem is, Minimize 13 x + 4 y subject to the constraints { y ≥ − 2 x + 11 y ≤ − x + 10 y ≤ − 1 3 + 6 y ≥ − 1 4 x + 4 x ≥ 0 , y ≥ 0 . Formula used: The Simplex Method for Problems in Nonstandard Form 1 . If necessary, convert all inequalities (except x ≥ 0 , y ≥ 0 , … ) into the form. [Linear expression] ≤ [Constant]. 2 . If a negative number appears in the upper part of the last column of the simplex tableau, remove it by pivoting. (a) Select one of the negative entries in its row. The column containing the entry will be the pivot column. (b) Select the pivot element by determining the least of the positive ratios associated with entries in the pivot column (except the bottom entry). (c) Pivot. 3 . Repeat step 2 until there are no negative entries in the upper part of the right-hand column of the simplex tableau. (If this process will not remove all negative entries from the upper part of the right-hand column, then the linear programming problem does not have an optimal solution.). 4 . Proceed to apply the simplex method for tableaux in standard maximization form. Calculation: Consider the provided linear programming problem, Minimize 13 x + 4 y subject to the constraints { y ≥ − 2 x + 11 y ≤ − x + 10 y ≤ − 1 3 + 6 y ≥ − 1 4 x + 4 x ≥ 0 , y ≥ 0 First, transform the problem so that the first two constraints are in ≤ form: { − 2 x − y ≤ − 11 x + y ≤ 10 1 3 x + y ≤ 6 − 1 4 x − y ≤ − 4 x ≥ 0 , y ≥ 0 Instead of minimizing 13 x + 4 y , let us maximize ( − 1 ) ( 13 x + 4 y ) = − 13 x − 14 y Let M = − 13 x − 4 y , Then, our initial simplex tableau reads x y u v w t M u v w t M [ − 2 − 1 1 0 0 0 0 − 11 1 1 0 1 0 0 0 10 1 3 1 0 0 1 0 0 6 − 1 4 − 1 0 0 0 1 0 − 4 13 4 0 0 0 0 1 0 ] The right-side column has a negative number − 11 and − 4 which violates the condition that all variables be ≥ 0 . First put the tableau into standard maximization form by pivoting to remove the negative entry in the right column. To choose the pivot element - Look along the left side of the − 11 and − 4 row of the tableau, and locate any negative entry. Use the column containing the − 1 as the pivot column (that is, use column 2). Now compute ratios corresponding to both positive and negative entries (except the last) in the pivot column, considering further only positive ratios. x y u v w t M u v w y M [ − 2 − 1 1 0 0 0 0 − 11 1 1 0 1 0 0 0 10 1 3 1 0 0 1 0 0 6 − 1 4 − 1 0 0 0 1 0 − 4 13 4 0 0 0 0 1 0 ] The smallest positive ratio is 4

Finite Mathematics & Its Applications (12th Edition)

12th Edition

ISBN: 9780134507125

Author: Goldstein

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 4.3, Problem 13E

To determine

To calculate: The solution of the provided linear programming problem using simplex method.

Minimize 13x+4y Subject to the constraints {y≥−2x+11y≤−x+10y≤−13+6y≥−14x+4x≥0,y≥0.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 4.3, Problem 12E

Chapter 4.3, Problem 14E

Students have asked these similar questions

1. Show that f(x) = x3 is not uniformly continuous on R. 2. Show that f(x) = 1/(x-2) is not uniformly continuous on (2,00). 3. Show that f(x)=sin(1/x) is not uniformly continuous on (0,л/2]. 4. Show that f(x) = mx + b is uniformly continuous on R. 5. Show that f(x) = 1/x2 is uniformly continuous on [1, 00), but not on (0, 1]. 6. Show that if f is uniformly continuous on [a, b] and uniformly continuous on D (where D is either [b, c] or [b, 00)), then f is uniformly continuous on [a, b]U D. 7. Show that f(x)=√x is uniformly continuous on [1, 00). Use Exercise 6 to conclude that f is uniformly continuous on [0, ∞). 8. Show that if D is bounded and f is uniformly continuous on D, then fis bounded on D. 9. Let f and g be uniformly continuous on D. Show that f+g is uniformly continuous on D. Show, by example, that fg need not be uniformly con- tinuous on D. 10. Complete the proof of Theorem 4.7. 11. Give an example of a continuous function on Q that cannot be continuously extended to R. 12.…

3. Explain why the following statements are not correct. a. "With my methodological approach, I can reduce the Type I error with the given sample information without changing the Type II error." b. "I have already decided how much of the Type I error I am going to allow. A bigger sample will not change either the Type I or Type II error." C. "I can reduce the Type II error by making it difficult to reject the null hypothesis." d. "By making it easy to reject the null hypothesis, I am reducing the Type I error."

The 2004 presidential election exit polls from the critical state of Ohio provided the following results. The exit polls had 2020 respondents, 768 of whom were college graduates. Ofthe college graduates, 412 voted for George Bush.a. Calculate a 95% confidence interval for the proportion ofcollege graduates in Ohio who voted for George Bush.b. Calculate a 95% lower confidence bound for the proportion of college graduates in Ohio who voted for George Bush.

Chapter 4 Solutions

Finite Mathematics & Its Applications (12th Edition)

Ch. 4.1 - 1. Determine by inspection a particular solution...Ch. 4.1 - Prob. 2CYU Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - 712For each of the linear programming problems in...Ch. 4.1 - 7–12 For each of the linear programming problems...

Knowledge Booster

Learn more about

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

The solution of the provided linear programming problem using simplex method. Minimize 13 x + 4 y Subject to the constraints { y ≥ − 2 x + 11 y ≤ − x + 10 y ≤ − 1 3 + 6 y ≥ − 1 4 x + 4 x ≥ 0 , y ≥ 0 .

Solution Summary: The author calculates the solution of the provided linear programming problem using the simplex method.

Videos

To calculate: The solution of the provided linear programming problem using simplex method.

Minimize 13x+4y Subject to the constraints {y≥−2x+11y≤−x+10y≤−13+6y≥−14x+4x≥0,y≥0.

Want to see the full answer?

Chapter 4 Solutions

The solution of the provided linear programming problem using simplex method. Minimize 13 x + 4 y Subject to the constraints { y ≥ − 2 x + 11 y ≤ − x + 10 y ≤ − 1 3 + 6 y ≥ − 1 4 x + 4 x ≥ 0 , y ≥ 0 .

Solution Summary: The author calculates the solution of the provided linear programming problem using the simplex method.

Videos

To calculate: The solution of the provided linear programming problem using simplex method. Minimize 13x+4y Subject to the constraints {y≥−2x+11y≤−x+10y≤−13+6y≥−14x+4x≥0,y≥0.

Want to see the full answer?

Chapter 4 Solutions

To calculate: The solution of the provided linear programming problem using simplex method.

Minimize 13x+4y Subject to the constraints {y≥−2x+11y≤−x+10y≤−13+6y≥−14x+4x≥0,y≥0.