Explanation Procedure used: “Formation of the Dual Problem: Given a minimization problem with ≥ problem constraints, Step 1 Use the coefficients and constants in the problem constraints and the objective function to form a matrix A with the coefficients of the objective function in the last row. Step 2 Interchange the rows and columns of matrix A to form the matrix A T , the transpose of A. Step 3 Use the rows of A T to form a maximization problem with ≤ problem Constraints”. Calculation: The minimization problem is: Minimize C = 4 x 1 + 7 x 2 + 5 x 3 + 6 x 4 subject to x 1 + x 2 ≤ 12 x 3 + x 4 ≤ 25 x 1 + x 3 ≥ 20 x 2 + x 4 ≥ 15 x 1 , x 2 , x 3 , x 4 ≥ 0 Before starting to solve this problem, to multiply the first two constraints by − 1 so that all the problem constraints are of the ≥ type. This will introduce negative constants into the minimization problem but not into the dual problem. Since the coefficients of C are nonnegative, the constants in the dual problem will be nonnegative and the dual will be a standard maximization problem. So, the problem is: Minimize C = 4 x 1 + 7 x 2 + 5 x 3 + 6 x 4 subject to − x 1 − x 2 ≥ − 12 − x 3 − x 4 ≥ − 25 x 1 + x 3 ≥ 20 x 2 + x 4 ≥ 15 x 1 , x 2 , x 3 , x 4 ≥ 0 Apply the steps which are given in the procedure used: A = [ − 1 − 1 0 0 − 12 0 0 − 1 − 1 − 25 1 0 1 0 20 0 1 0 1 15 4 7 5 6 1 ] In given matrix, Interchanging the the first row with first column, second row with second column, and so on. A T = [ − 1 0 1 0 4 − 1 0 0 1 7 0 − 1 1 0 5 0 − 1 0 1 6 − 12 − 25 20 15 1 ] To avoid the confusion, use different variables. Maximize P = − 12 y 1 − 25 y 2 + 20 y 3 + 15 y 4 subject to − y 1 + y 3 ≤ 4 − y 1 + y 4 ≤ 7 − y 2 + y 3 ≤ 5 − y 2 + y 4 ≤ 6 y 1 , y 2 , y 3 , y 4 ≥ 0 Hence, the simplex dual maximization problem is as shown below. Maximize P = − 12 y 1 − 25 y 2 + 20 y 3 + 15 y 4 subject to − y 1 + y 3 ≤ 4 − y 1 + y 4 ≤ 7 − y 2 + y 3 ≤ 5 − y 2 + y 4 ≤ 6 y 1 , y 2 , y 3 , y 4 ≥ 0 Using the variables x 1 , x 2 , x 3 and x 4 from the original problem as the slack variables in the dual problem and obtain the initial system for the dual problem: − y 1 + y 3 + x 1 = 7 − y 1 + y 4 + x 2 = 7 − y 2 + y 3 + x 3 = 5 y 2 + y 4 + x 4 = 6 12 y 1 + 25 y 2 − 20 y 3 − 15 y 4 + P = 0 Now to form a simplex tableau and solve the dual problem: y 1 y 2 y 3 y 4 x 1 x 2 x 3 x 4 P x 1 x 2 x 3 x 4 P [ − 1 0 1 0 1 0 0 0 0 4 − 1 0 0 1 0 1 0 0 0 7 0 − 1 1 0 0 0 1 0 0 5 0 − 1 0 1 0 0 0 1 0 6 12 25 − 20 − 15 0 0 0 0 1 0 ] To select the pivot column, select the most negative number in the bottom row of the tableau and to the left of the P column. The column containing this element is the pivot column . If there is a tie for the most negative indicator, choose either column. Hence, third column is the pivot column. To select the pivot row, check for the smallest quotient for each row above the dashed line. If there is a tie for the smallest quotient, choose either row. 4 1 = 4 ( smallest ) 5 1 = 5 So, the first row is selected as the pivot row. The element at the intersection of the pivot column and the pivot row is called the pivot element. So, the element enclosed in rectangle 1 is the pivot element. y 1 y 2 y 3 y 4 x 1 x 2 x 3 x 4 P x 1 x 2 x 3 x 4 P [ − 1 0 1 0 1 0 0 0 0 4 − 1 0 0 1 0 1 0 0 0 7 0 − 1 1 0 0 0 1 0 0 5 0 − 1 0 1 0 0 0 1 0 6 12 25 − 20 − 15 0 0 0 0 1 0 ] ( R 3 − R 1 → R 3 R 5 + 20 R 1 → R 5 ) y 1 y 2 y 3 y 4 x 1 x 2 x 3 x 4 P ∼ y 3 x 2 x 3 x 4 P [ − 1 0 1 0 1 0 0 0 0 4 − 1 0 0 1 0 1 0 0 0 7 1 − 1 0 0 − 1 0 1 0 0 1 0 − 1 0 1 0 0 0 1 0 6 − 8 25 0 − 15 20 0 0 0 1 80 ] Repeat the same procedure to identify the next pivot element which is 1

Pearson eText for College Mathematics for Business, Economics, Life Sciences, and Social Sciences -- Instant Access (Pearson+)

14th Edition

ISBN: 9780137553341

Author: Raymond Barnett, Michael Ziegler

Publisher: PEARSON+

See similar textbooks

Videos

Question

Chapter 6.3, Problem 48E

To determine

To solve: The linear programming problem by using the simplex dual problem method.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 6.3, Problem 47E

Chapter 6.3, Problem 49E

Students have asked these similar questions

Conduct the hypothesis test and provide the test statistic and the critical value, and state the conclusion. A person drilled a hole in a die and filled it with a lead weight, then proceeded to roll it 200 times. Here are the observed frequencies for the outcomes of 1, 2, 3, 4, 5, and 6, respectively: 28, 32, 46, 39, 29, 26. Use a 0.025 significance level to test the claim that the outcomes are not equally likely. Does it appear that the loaded die behaves differently than a fair die? Click here to view the chi-square distribution table. The test statistic is (Round to three decimal places as needed.) Chi-square distribution table Area to the Right of the Critical Value Degrees of Freedom 0.995 0.99 0.975 0.95 0.90 0.10 0.05 0.025 0.01 0.005 1 0.001 0.004 0.016 2.706 3.841 5.024 6.635 2 0.010 0.020 0.051 0.103 0.211 4.605 5.991 7.378 9.210 7.879 10.597 3 0.072 0.115 0.216 0.352 0.584 6.251 7.815 9.348 11.345 12.838 4 0.207 0.297 0.484 0.711 1.064 7.779 9.488 11.143 13.277 14.860 5…

The online clothing retailer e-Parel is conducting a study to estimate the average size of the orders placed by visitors to its website. The project manager desires a $60 bound on the error of estimation at 90% confidence. The population standard deviation is unknown, and a “best guess” of $175 is used as the planning value for σ. Use the Distributions tool to help you answer the questions that follow. 0123 Select a Distribution The z-value for a 90% confidence interval of the population mean is . In order to satisfy the requirement of a $60 bound on the error of estimation, a sample size no smaller than is needed.

A local electronics store just received a shipment of 620 HDMI cables. The manager wants to estimate the number of defective HDMI cables in the shipment. Rather than checking every HDMI cable, the manager plans to take a simple random sample of size 62 in order to estimate the proportion of defective HDMI cables in the shipment. If the sample proportion of defective HDMI cables, p̂p̂, is greater than 0.0323 (there are more than two defective HDMI cables in the sample), the manager will file a complaint and request a new shipment. Suppose that the true proportion of defective HDMI cables in the shipment is approximately p = 0.02. What is the expected value of the sample proportion? E(Pˆ)E(P^)= Since the sample is to be drawn from a finite population, and since the sample is 5% of the population size, the finite population correction factor needed when you calculate the standard deviation of the sampling distribution. What is the standard deviation of the…

Chapter 6 Solutions

Pearson eText for College Mathematics for Business, Economics, Life Sciences, and Social Sciences -- Instant Access (Pearson+)

Ch. 6.1 - Refer to Example 1. Find the basic solution for...Ch. 6.1 - Construct the table of basic solutions and use it...Ch. 6.1 - Prob. 3MP Ch. 6.1 - Prob. 4MP Ch. 6.1 - Prob. 1ED Ch. 6.1 - The following linear programming problem has only...Ch. 6.1 - Prob. 1E Ch. 6.1 - Prob. 2E Ch. 6.1 - Prob. 3E Ch. 6.1 - Prob. 4E

Ch. 6.1 - In how many ways can two variables be chosen from...Ch. 6.1 - Prob. 6E Ch. 6.1 - Prob. 7E Ch. 6.1 - Prob. 8E Ch. 6.1 - Problems 9–12 refer to the system 9. Find the...Ch. 6.1 - Prob. 10E Ch. 6.1 - Prob. 11E Ch. 6.1 - Prob. 12E Ch. 6.1 - In Problems 13–20, write the e-system obtained via...Ch. 6.1 - In Problems 13–20, write the e-system obtained via...Ch. 6.1 - In Problems 13–20, write the e-system obtained via...Ch. 6.1 - Prob. 16E Ch. 6.1 - Prob. 17E Ch. 6.1 - Prob. 18E Ch. 6.1 - Prob. 19E Ch. 6.1 - Prob. 20E Ch. 6.1 - Prob. 21E Ch. 6.1 - Prob. 22E Ch. 6.1 - Prob. 23E Ch. 6.1 - Prob. 24E Ch. 6.1 - Prob. 25E Ch. 6.1 - Prob. 26E Ch. 6.1 - Prob. 27E Ch. 6.1 - Prob. 28E Ch. 6.1 - Prob. 29E Ch. 6.1 - Prob. 30E Ch. 6.1 - Prob. 31E Ch. 6.1 - Prob. 32E Ch. 6.1 - Prob. 33E Ch. 6.1 - Prob. 34E Ch. 6.1 - Prob. 35E Ch. 6.1 - Prob. 36E Ch. 6.1 - Prob. 37E Ch. 6.1 - Prob. 38E Ch. 6.1 - Problems 31–40 refer to the partially completed...Ch. 6.1 - Prob. 40E Ch. 6.1 - In Problems 41-48, convert the given i-system to...Ch. 6.1 - Prob. 42E Ch. 6.1 - Prob. 43E Ch. 6.1 - Prob. 44E Ch. 6.1 - Prob. 45E Ch. 6.1 - Prob. 46E Ch. 6.1 - In Problems 41-48, convert the given i-system to...Ch. 6.1 - Prob. 48E Ch. 6.1 - Prob. 49E Ch. 6.1 - Prob. 50E Ch. 6.1 - Prob. 51E Ch. 6.1 - Prob. 52E Ch. 6.1 - Prob. 53E Ch. 6.1 - Prob. 54E Ch. 6.1 - Prob. 55E Ch. 6.1 - Prob. 56E Ch. 6.1 - Prob. 57E Ch. 6.1 - Prob. 58E Ch. 6.1 - In Problems 59-66, solve the given linear...Ch. 6.1 - Prob. 60E Ch. 6.1 - Prob. 61E Ch. 6.1 - Prob. 62E Ch. 6.1 - Prob. 63E Ch. 6.1 - In Problems 59-66, solve the given linear...Ch. 6.1 - In Problems 59-66, solve the given linear...Ch. 6.1 - Prob. 66E Ch. 6.1 - Prob. 67E Ch. 6.1 - Prob. 68E Ch. 6.1 - Prob. 69E Ch. 6.1 - Prob. 70E Ch. 6.1 - In Problems 67-70, explain why the linear...Ch. 6.1 - Prob. 72E Ch. 6.1 - Prob. 73E Ch. 6.1 - Prob. 74E Ch. 6.1 - Prob. 75E Ch. 6.1 - Prob. 76E Ch. 6.2 - Solve the following linear programming problem...Ch. 6.2 - Solve using the simplex method: Ch. 6.2 - Prob. 3MP Ch. 6.2 - Prob. 1ED Ch. 6.2 - Prob. 1E Ch. 6.2 - Prob. 2E Ch. 6.2 - Prob. 3E Ch. 6.2 - Prob. 4E Ch. 6.2 - Prob. 5E Ch. 6.2 - Prob. 6E Ch. 6.2 - Prob. 7E Ch. 6.2 - Prob. 8E Ch. 6.2 - In Problems 9–12, Using slack variables, write the...Ch. 6.2 - Prob. 10E Ch. 6.2 - Prob. 11E Ch. 6.2 - Prob. 12E Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Prob. 14E Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Prob. 16E Ch. 6.2 - Prob. 17E Ch. 6.2 - Repeat Problem 17 with P = x1 + 2x2. 17. Ch. 6.2 - Prob. 19E Ch. 6.2 - Prob. 20E Ch. 6.2 - Prob. 21E Ch. 6.2 - Prob. 22E Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Prob. 24E Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Prob. 28E Ch. 6.2 - Prob. 29E Ch. 6.2 - Prob. 30E Ch. 6.2 - Prob. 31E Ch. 6.2 - Prob. 32E Ch. 6.2 - Prob. 33E Ch. 6.2 - Prob. 34E Ch. 6.2 - Prob. 35E Ch. 6.2 - Prob. 36E Ch. 6.2 - Prob. 37E Ch. 6.2 - Prob. 38E Ch. 6.2 - In Problems 37–40, there is a tie for the choice...Ch. 6.2 - Prob. 40E Ch. 6.2 - Prob. 41E Ch. 6.2 - Prob. 42E Ch. 6.2 - Prob. 43E Ch. 6.2 - Prob. 44E Ch. 6.2 - Prob. 45E Ch. 6.2 - Prob. 46E Ch. 6.2 - Prob. 47E Ch. 6.2 - Prob. 48E Ch. 6.2 - Prob. 49E Ch. 6.2 - Prob. 50E Ch. 6.2 - Prob. 51E Ch. 6.2 - Prob. 52E Ch. 6.2 - Prob. 53E Ch. 6.2 - Prob. 54E Ch. 6.2 - Prob. 55E Ch. 6.2 - Prob. 56E Ch. 6.3 - Form the dual problem: Ch. 6.3 - Prob. 2MP Ch. 6.3 - Prob. 3MP Ch. 6.3 - Repeat Example 4 if the shipping charge from plant...Ch. 6.3 - Prob. 1ED Ch. 6.3 - Prob. 2ED Ch. 6.3 - Prob. 1E Ch. 6.3 - Prob. 2E Ch. 6.3 - Prob. 3E Ch. 6.3 - Prob. 4E Ch. 6.3 - Prob. 5E Ch. 6.3 - Prob. 6E Ch. 6.3 - Prob. 7E Ch. 6.3 - In Problems 1–8, find the transpose of each...Ch. 6.3 - In Problems 9 and 10, Form the dual problem. Write...Ch. 6.3 - Prob. 10E Ch. 6.3 - In Problems 11 and 12, a minimization problem, the...Ch. 6.3 - Prob. 12E Ch. 6.3 - Prob. 13E Ch. 6.3 - In Problems 13–20, Form the dual problem. Find the...Ch. 6.3 - In Problems 13–20, Form the dual problem. Find the...Ch. 6.3 - Prob. 16E Ch. 6.3 - In Problems 13–20, Form the dual problem. Find the...Ch. 6.3 - Prob. 18E Ch. 6.3 - Prob. 19E Ch. 6.3 - Prob. 20E Ch. 6.3 - Prob. 21E Ch. 6.3 - Prob. 22E Ch. 6.3 - Solve the linear programming problems in Problems...Ch. 6.3 - Prob. 24E Ch. 6.3 - Prob. 25E Ch. 6.3 - Prob. 26E Ch. 6.3 - Prob. 27E Ch. 6.3 - Prob. 28E Ch. 6.3 - Prob. 29E Ch. 6.3 - Prob. 30E Ch. 6.3 - Prob. 31E Ch. 6.3 - Prob. 32E Ch. 6.3 - Prob. 33E Ch. 6.3 - Prob. 34E Ch. 6.3 - Prob. 35E Ch. 6.3 - Prob. 36E Ch. 6.3 - Prob. 37E Ch. 6.3 - Prob. 38E Ch. 6.3 - Prob. 39E Ch. 6.3 - Prob. 40E Ch. 6.3 - Prob. 41E Ch. 6.3 - Prob. 42E Ch. 6.3 - Prob. 43E Ch. 6.3 - Prob. 44E Ch. 6.3 - Solve the linear programming problems in Problems...Ch. 6.3 - Prob. 46E Ch. 6.3 - Prob. 47E Ch. 6.3 - Prob. 48E Ch. 6.3 - Prob. 49E Ch. 6.3 - Mining. A mining company operates two mines, each...Ch. 6.3 - Prob. 51E Ch. 6.3 - Prob. 52E Ch. 6.3 - Prob. 53E Ch. 6.3 - Prob. 54E Ch. 6.3 - Prob. 55E Ch. 6.3 - Prob. 56E Ch. 6.3 - Prob. 57E Ch. 6.3 - Prob. 58E Ch. 6.4 - Repeat Example 1 for EXAMPLE 1 Finding the...Ch. 6.4 - Prob. 2MP Ch. 6.4 - Prob. 3MP Ch. 6.4 - Prob. 4MP Ch. 6.4 - Prob. 5MP Ch. 6.4 - Interpret the values of the slack and surplus...Ch. 6.4 - Prob. 1E Ch. 6.4 - Prob. 2E Ch. 6.4 - Prob. 3E Ch. 6.4 - Prob. 4E Ch. 6.4 - Prob. 5E Ch. 6.4 - Prob. 6E Ch. 6.4 - Prob. 7E Ch. 6.4 - Prob. 8E Ch. 6.4 - Use the big M method to solve Problems 9–22. 9. Ch. 6.4 - Prob. 10E Ch. 6.4 - Prob. 11E Ch. 6.4 - Prob. 12E Ch. 6.4 - Use the big M method to solve Problems 9–22. 13. Ch. 6.4 - Prob. 14E Ch. 6.4 - Use the big M method to solve Problems 9–22. 15. Ch. 6.4 - Prob. 16E Ch. 6.4 - Prob. 17E Ch. 6.4 - Prob. 18E Ch. 6.4 - Prob. 19E Ch. 6.4 - Prob. 20E Ch. 6.4 - Use the big M method to solve Problems 9-22. 21....Ch. 6.4 - Prob. 22E Ch. 6.4 - Prob. 23E Ch. 6.4 - Prob. 24E Ch. 6.4 - Problems 25–32 are mixed. Some can be solved by...Ch. 6.4 - Prob. 26E Ch. 6.4 - Prob. 27E Ch. 6.4 - Prob. 28E Ch. 6.4 - Prob. 29E Ch. 6.4 - Prob. 30E Ch. 6.4 - Prob. 31E Ch. 6.4 - Prob. 32E Ch. 6.4 - In Problems 33–38, construct a mathematical model...Ch. 6.4 - In Problems 33–38, construct a mathematical model...Ch. 6.4 - In Problems 33-38, construct a mathematical model...Ch. 6.4 - Prob. 36E Ch. 6.4 - Prob. 37E Ch. 6.4 - Prob. 38E Ch. 6.4 - Prob. 39E Ch. 6.4 - Prob. 40E Ch. 6.4 - Prob. 41E Ch. 6.4 - Prob. 42E Ch. 6.4 - Prob. 43E Ch. 6.4 - Prob. 44E Ch. 6.4 - Prob. 45E Ch. 6.4 - Prob. 46E Ch. 6.4 - Prob. 47E Ch. 6 - Prob. 1RE Ch. 6 - Prob. 2RE Ch. 6 - Prob. 3RE Ch. 6 - Prob. 4RE Ch. 6 - Prob. 5RE Ch. 6 - Prob. 6RE Ch. 6 - Prob. 7RE Ch. 6 - Prob. 8RE Ch. 6 - Prob. 9RE Ch. 6 - Prob. 10RE Ch. 6 - Prob. 11RE Ch. 6 - Prob. 12RE Ch. 6 - Prob. 13RE Ch. 6 - Prob. 14RE Ch. 6 - Prob. 15RE Ch. 6 - Prob. 16RE Ch. 6 - Prob. 17RE Ch. 6 - Prob. 18RE Ch. 6 - Prob. 19RE Ch. 6 - Prob. 20RE Ch. 6 - Prob. 21RE Ch. 6 - Prob. 22RE Ch. 6 - Prob. 23RE Ch. 6 - Prob. 24RE Ch. 6 - Prob. 25RE Ch. 6 - Prob. 26RE Ch. 6 - Prob. 27RE Ch. 6 - Prob. 28RE Ch. 6 - In Problems 28 and 29, Introduce slack, surplus,...Ch. 6 - Prob. 30RE Ch. 6 - Prob. 31RE Ch. 6 - Prob. 32RE Ch. 6 - Prob. 33RE Ch. 6 - Prob. 34RE Ch. 6 - Prob. 35RE Ch. 6 - Prob. 36RE Ch. 6 - Prob. 37RE Ch. 6 - Prob. 38RE Ch. 6 - Prob. 39RE Ch. 6 - Prob. 40RE Ch. 6 - Prob. 41RE

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.