Explanation Given Information: The LP problems can be solved by graphical method. Consider the graphical method. Since, the graphical method involves the linear programming problems with 2 unknowns. Thus, any problem with more than 2 unknowns cannot be solved by using the graphical method. Now, consider the simplex method. Since, there is no restriction as to the number of unknowns that can be solved using the simplex method. Thus, the simplex method can be used to solve any linear programming problem with 2 or more unknowns and is therefore, more efficient than the graphical method. For example. Consider the problem to calculate the maximum value of p = 6 x + y + 3 z subject to 3 x + y ≤ 15 2 x + 2 y + 2 z ≤ 20 x ≥ 0 , y ≥ 0 , z ≥ 0 Since, the equation 2 x + 2 y + 2 z ≤ 20 cannot be easily graphed as it involves 3 unknowns. Thus, the graphical method cannot be used to solve this problem. Consider the simplex method. Since, the simplex method can be used to solve the problems with any number of inequalities. Thus, the problem can be solved by simplex method. Consider the constraints 3 x + y ≤ 15 2 x + 2 y + 2 z ≤ 20 x ≥ 0 , y ≥ 0 , z ≥ 0 Step 1: Use slack variables and write the inequalities in equation form. Add the slack variables s and t . 3 x + y + s = 15 2 x + 2 y + 2 z + t = 20 Step 2: Write the equations in an augmented matrix. The equations are 3 x + y + s = 15 2 x + 2 y + 2 z + t = 20 − 6 x − y − 3 z + p = 0 Write the equations in augmented matrix. x y z s t p s 3 1 0 1 0 0 15 t 2 2 2 0 1 0 20 p − 6 − 1 − 3 0 0 1 0 Step 3: Choose the smallest negative number on the left side of the bottom row and pivot the column. Since, the smallest negative number on the left side of the bottom row is − 6 . Thus, pivot the x column. Step 4: Select the pivot which is the smallest of the test ratios a b , where a is the entry in the right most column and b is the corresponding entry in the pivot column. Since, the test ratios are neither 0 nor negative. Thus, the test ratios are 15 3 = 5 and 20 2 = 10 . Thus, the pivot is 3 in column x . x y z s t p s 3 1 0 1 0 0 15 t 2 2 2 0 1 0 20 p − 6 − 1 − 3 0 0 1 0 Step 5: Clear the pivot column using the pivot and label the pivot row with the label of the pivot column

Finite Mathematics and Applied Calculus (MindTap Course List)

7th Edition

ISBN: 9781337274203

Author: Stefan Waner, Steven Costenoble

Publisher: Cengage Learning

See similar textbooks

Videos

Question

Chapter 6.3, Problem 49E

To determine

The reason that the simplex method is useful than graphical method.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 6.3, Problem 48E

Chapter 6.3, Problem 50E

Students have asked these similar questions

1. (i) Give the definition of a metric on a set X. [5 Marks] (ii) Let X = {a, b, c} and let a function d : XxX → [0, ∞) be defined as d(a, a) = d(b,b) = d(c, c) 0, d(a, c) = d(c, a) 1, d(a, b) = d(b, a) = 4, d(b, c) = d(c,b) = 2. Decide whether d is a metric on X. Justify your answer. = (iii) Consider a metric space (R, d.), where = [10 Marks] 0 if x = y, d* (x, y) 5 if xy. In the metric space (R, d*), describe: (a) open ball B2(0) of radius 2 centred at 0; (b) closed ball B5(0) of radius 5 centred at 0; (c) sphere S10 (0) of radius 10 centred at 0. [5 Marks] [5 Marks] [5 Marks]

(c) sphere S10 (0) of radius 10 centred at 0. [5 Marks] 2. Let C([a, b]) be the metric space of continuous functions on the interval [a, b] with the metric doo (f,g) = max f(x)g(x)|. xЄ[a,b] = 1x. Find: Let f(x) = 1 - x² and g(x): (i) do(f, g) in C'([0, 1]); (ii) do(f,g) in C([−1, 1]). [20 Marks] [20 Marks]

Given lim x-4 f (x) = 1,limx-49 (x) = 10, and lim→-4 h (x) = -7 use the limit properties to find lim→-4 1 [2h (x) — h(x) + 7 f(x)] : - h(x)+7f(x) 3 O DNE

Chapter 6 Solutions

Finite Mathematics and Applied Calculus (MindTap Course List)

Ch. 6.1 - In Exercises 1-26, sketch the region that...Ch. 6.1 - In Exercises 1-26, sketch the region that...Ch. 6.1 - Prob. 3E Ch. 6.1 - Prob. 4E Ch. 6.1 - Prob. 5E Ch. 6.1 - Prob. 6E Ch. 6.1 - Prob. 7E Ch. 6.1 - In Exercises 1-26, sketch the region that...Ch. 6.1 - Prob. 9E Ch. 6.1 - Prob. 10E

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 reason that the simplex method is useful than graphical method.

Solution Summary: The author explains that the simplex method can be used to solve any type of maximization linear programming problem involving 2 or more unknowns.

Videos

The reason that the simplex method is useful than graphical method.

Want to see the full answer?

Chapter 6 Solutions