Explanation Given Information: The provided matrix is: Minimize c = 2 x + y Subject to 3 x + 2 y ≥ 60 , 2 x + y ≥ 60 , x + 3 y ≥ 60 and x ≥ 0 , y ≥ 0 Formula used: Solving the given Dual problem by the following steps: Step 1) Represent the problem as a matrix. Step 2) Take the transpose of the matrix. Step 3) Write down the dual, which is the LP problem corresponding to the new matrix. If the original problem was a maximization problem, its dual will be a minimization problem, and vice versa. Fundamental Theorem of duality as: If an LP problem has a optimal solution, then so does its dual. Moreover, the primal problem and the dual problem have the same optimal value for their objective functions. Contained in the final tableau of the simplex method applied to an LP problem is the solution to its dual problem: It is given by the bottom entries in the column associated with the slack variables, divided by the entry under the objective variable. Calculation: Consider the provided matrix is: Minimize c = 2 x + y Subject to 3 x + 2 y ≥ 60 , 2 x + y ≥ 60 , x + 3 y ≥ 60 and x ≥ 0 , y ≥ 0 Step 1) Represent the problem as a matrix as: [ 3 2 60 2 1 60 1 3 60 2 1 0 ] Step 2) Take the transpose of the matrix as: [ 3 2 1 2 1 3 60 60 60 2 1 0 ] Step 3) Write down the dual, which is the LP problem corresponding to the new matrix. If the original problem was a maximization problem, its dual will be a minimization problem, and vice versa. Maximize p = 60 x + 60 y + 60 z Subject to 3 x + 2 y ≥ 60 , 2 x + y ≥ 60 , x + 3 y ≥ 60 and x ≥ 0 , y ≥ 0 Solve the dual problem as: x y z s t p s 3 2 1 1 0 0 2 t 2 1 3 0 1 0 1 p − 60 − 60 − 60 0 0 1 0 Apply the row operation 2 R 1 − 3 R 2 and R 3 +

7th Edition

ISBN: 9781337280426

Author: Stefan Waner, Steven Costenoble

Publisher: Cengage Learning

See similar textbooks

Videos

Question

Chapter 5, Problem 19RE

To determine

To calculate: The linear programming problem by the method of duality. Where,

Minimize c=2x+y

Subject to 3x+2y≥60,2x+y≥60,x+3y≥60 and x≥0,y≥0

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 5, Problem 18RE

Chapter 5, Problem 20RE

Students have asked these similar questions

Q / solving ha place equation a x x + u y y = 0 u (x, 0)=0 u ( x, 2) = 10 u (o,y) = 4 (119)=0 и on Rectangular Rejon

(a) Test the hypothesis. Consider the hypothesis test Ho = : against H₁o < 02. Suppose that the sample sizes aren₁ = 7 and n₂ = 13 and that $² = 22.4 and $22 = 28.2. Use α = 0.05. Ho is not ✓ rejected. 9-9 IV (b) Find a 95% confidence interval on of 102. Round your answer to two decimal places (e.g. 98.76).

Let us suppose we have some article reported on a study of potential sources of injury to equine veterinarians conducted at a university veterinary hospital. Forces on the hand were measured for several common activities that veterinarians engage in when examining or treating horses. We will consider the forces on the hands for two tasks, lifting and using ultrasound. Assume that both sample sizes are 6, the sample mean force for lifting was 6.2 pounds with standard deviation 1.5 pounds, and the sample mean force for using ultrasound was 6.4 pounds with standard deviation 0.3 pounds. Assume that the standard deviations are known. Suppose that you wanted to detect a true difference in mean force of 0.25 pounds on the hands for these two activities. Under the null hypothesis, 40 = 0. What level of type II error would you recommend here? Round your answer to four decimal places (e.g. 98.7654). Use a = 0.05. β = i What sample size would be required? Assume the sample sizes are to be equal.…

Chapter 5 Solutions

Finite Mathematics

Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - Prob. 6E Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - Prob. 9E Ch. 5.1 - In Exercises 1-26, sketch the region that...

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 linear programming problem by the method of duality. Where, Minimize c = 2 x + y Subject to 3 x + 2 y ≥ 60 , 2 x + y ≥ 60 , x + 3 y ≥ 60 and x ≥ 0 , y ≥ 0

Solution Summary: The author explains the formula used to solve the linear programming problem by the method of duality.

Videos

To calculate: The linear programming problem by the method of duality. Where,

Minimize c=2x+y

Subject to 3x+2y≥60,2x+y≥60,x+3y≥60 and x≥0,y≥0

Want to see the full answer?

Chapter 5 Solutions

The linear programming problem by the method of duality. Where, Minimize c = 2 x + y Subject to 3 x + 2 y ≥ 60 , 2 x + y ≥ 60 , x + 3 y ≥ 60 and x ≥ 0 , y ≥ 0

Solution Summary: The author explains the formula used to solve the linear programming problem by the method of duality.

Videos

To calculate: The linear programming problem by the method of duality. Where, Minimize c=2x+y Subject to 3x+2y≥60,2x+y≥60,x+3y≥60 and x≥0,y≥0

Want to see the full answer?

Chapter 5 Solutions

To calculate: The linear programming problem by the method of duality. Where,

Minimize c=2x+y

Subject to 3x+2y≥60,2x+y≥60,x+3y≥60 and x≥0,y≥0