Explanation Given information: The objective function which has to maximize is: M = 3 x + 7 y which is subjected to the constraints: { x + 2 y ≤ 10 − 4 x + 3 y ≤ 30 − 2 x + y ≤ 0 x ≥ 0 y ≥ 0 Formula used: The maximization problem of simplex can be solved as below: Step 1: Write the initial tableau and find the feasible solution. Step 2: Find the pivot column, by finding maximum negative number in the last row of the tableau. Step 3: Now divide the all elements which are in the last column by their corresponding elements of pivot column to decide pivot elements. Step 4: Now to make the pivot element unity, divide all the element of pivot row by 1 and make all other elements of pivot column to zero by row operation. Step 5: If there is one or more than one negative number in the last row, then the above tableau is not optimal, it needs iteration. Calculation: Write the provided constraints in the form of linear equations by introducing slack variables, u , v and w which are: x + 2 y + u = 10 − 4 x + 3 y + v = 30 − 2 x + y + w = 0 − 3 x − 7 y + M = 0 Step 1: Write the initial tableau and find the feasible solution. In the matrix form it can be written as: x y u v w M [ 1 2 1 0 0 0 10 − 4 3 0 1 0 0 30 − 2 1 0 0 1 0 0 − 3 − 7 0 0 0 1 0 ] So, the above simplex tableau is initial tableau, therefore one feasible solution is: x = 0 , y = 0 , u = 10 , v = 30 , w = 0 and M = 0 Step 2: Find the pivot column, by finding maximum negative number in the last row of the tableau. From the above table it can be observed that in the last row the maximum negative number is − 7 so the 2 nd column is pivot column. Step 3: Now divide the all elements which are in the last column by their corresponding elements of pivot column to decide pivot elements. x y u v w M u v w M [ 1 2 1 0 0 0 10 − 4 3 0 1 0 0 30 − 2 1 0 0 1 0 0 − 3 − 7 0 0 0 1 0 ] 10 2 = 5 30 3 = 10 0 1 = 0 It can be observed that the minimum positive ratio is 0 which is 3 rd row, therefore the pivot element is 3 rd row and 2 nd column, which is 1. Step 4: Now to make the pivot element unity, divide all the element of pivot row by 2 and make all other elements of pivot column to zero by row operation which is as below: x y u v w M [ 1 2 1 0 0 0 10 − 4 3 0 1 0 0 30 − 2 1 0 0 1 0 0 − 3 − 7 0 0 0 1 0 ] R 1 − 2 × R 3 R 2 − 3 × R 3 R 4 + 7 × R 3 → [ 5 0 1 0 − 2 0 10 2 0 0 1 − 3 0 30 − 2 1 0 0 1 0 0 − 17 0 0 0 7 1 0 ] So, the next tableau for pivot 1 is: u v y M [ 5 0 1 0 − 2 0 10 2 0 0 1 − 3 0 30 − 2 1 0 0 1 0 0 − 17 0 0 0 7 1 0 ] The feasible solution for this tableau is: u = 10 , v = 30 , y = 0 and M = 0

MyLab Math plus Pearson eText -- Standalone Access Card -- for Finite Mathematics & Its Applications (12th Edition)

12th Edition

ISBN: 9780134765723

Author: Larry J. Goldstein, David I. Schneider, Martha J. Siegel, Steven Hair

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 4, Problem 4RE

To determine

To calculate: The maximum value of objective function: M=3x+7y which is subjected to the constraints:

{x+2y≤10−4x+3y≤30−2x+y≤0x≥0y≥0

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 4, Problem 3RE

Chapter 4, Problem 5RE

Students have asked these similar questions

Can social media mistakes hurt your chances of finding a job? According to a survey of 1,000 hiring managers across many different industries, 76% claim that they use social media sites to research prospective candidates for any job. Calculate the probabilities of the following events. (Round your answers to three decimal places.) answer parts a-c. a) Out of 30 job listings, at least 19 will conduct social media screening. b) Out of 30 job listings, fewer than 17 will conduct social media screening. c) Out of 30 job listings, exactly between 19 and 22 (including 19 and 22) will conduct social media screening. show all steps for probabilities please. answer parts a-c.

Question: we know that for rt. (x+ys s ا. 13. rs. and my so using this, show that it vye and EIXI, EIYO This : E (IX + Y) ≤2" (EIX (" + Ely!")

Theorem 2.4 (The Hölder inequality) Let p+q=1. If E|X|P < ∞ and E|Y| < ∞, then . |EXY ≤ E|XY|||X|| ||||q

Chapter 4 Solutions

MyLab Math plus Pearson eText -- Standalone Access Card -- for 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 maximum value of objective function: M = 3 x + 7 y which is subjected to the constraints: { x + 2 y ≤ 10 − 4 x + 3 y ≤ 30 − 2 x + y ≤ 0 x ≥ 0 y ≥ 0

Solution Summary: The author explains how the maximization problem of simplex can be solved by writing the initial tableau and finding the feasible solution.

Videos

To calculate: The maximum value of objective function: M=3x+7y which is subjected to the constraints:

{x+2y≤10−4x+3y≤30−2x+y≤0x≥0y≥0

Want to see the full answer?

Chapter 4 Solutions

The maximum value of objective function: M = 3 x + 7 y which is subjected to the constraints: { x + 2 y ≤ 10 − 4 x + 3 y ≤ 30 − 2 x + y ≤ 0 x ≥ 0 y ≥ 0

Solution Summary: The author explains how the maximization problem of simplex can be solved by writing the initial tableau and finding the feasible solution.

Videos

To calculate: The maximum value of objective function: M=3x+7y which is subjected to the constraints: {x+2y≤10−4x+3y≤30−2x+y≤0x≥0y≥0

Want to see the full answer?

Chapter 4 Solutions

To calculate: The maximum value of objective function: M=3x+7y which is subjected to the constraints:

{x+2y≤10−4x+3y≤30−2x+y≤0x≥0y≥0