Explanation Given: Minimize w = 7 y 1 + 2 y 2 + 3 y 3 And subject to: y 1 + y 2 + 2 y 3 ≥ 48 y 1 + y 2 ≥ 12 y 3 ≥ 10 3 y 1 + y 3 ≥ 30 With y 1 ≥ 0 , y 2 ≥ 0 , y 3 ≥ 0 Explanation: Consider the details: Minimize w = 7 y 1 + 2 y 2 + 3 y 3 And subject to: y 1 + y 2 + 2 y 3 ≥ 48 y 1 + y 2 ≥ 12 y 3 ≥ 10 3 y 1 + y 3 ≥ 30 With y 1 ≥ 0 , y 2 ≥ 0 , y 3 ≥ 0 Use the dual method. The augmented matrix is: [ 1 1 2 48 1 1 0 12 0 3 0 0 1 1 10 30 7 2 3 0 ] And transpose of the matrix is: [ 1 1 0 3 7 1 1 0 0 2 2 0 1 1 3 48 12 10 30 0 ] Further, write the dual problem. Maximize z = 48 x 1 + 12 x 2 + 10 x 3 + 30 x 4 And subject to: x 1 + x 2 + 3 x 4 ≤ 7 x 1 + x 2 ≤ 2 2 x 1 + x 3 + x 4 ≤ 3 With x 1 ≥ 0 , x 2 ≥ 0 , x 3 ≥ 0 , x 4 ≥ 0 Initial simplex tableau is: [ x 1 x 2 x 3 x 4 s 1 s 2 s 3 z 1 1 0 3 1 0 0 0 7 1 1 0 0 0 1 0 0 2 2 0 1 1 0 0 1 0 3 − 48 − 12 − 10 − 30 0 0 0 1 0 ] Pivot 2 in column 2, row 3. R 1 → − R 3 + 2 R 1 R 2 → − R 3 + 2 R 2 R 4 → 24 R 3 + R 4 [ x 1 x 2 x 3 x 4 s 1 s 2 s 3 z 0 2 − 1 5 2 0 − 1 0 10 0 2 − 1 − 1 0 2 − 1 0 1 2 0 1 1 0 0 1 0 3 0 − 12 − 14 − 6 0 0 24 1 72 ] Pivot 2 in column 2, row 2. R 1 → R 1 − R 2 R 4 → 6 R 2 + R 4 [ x 1 x 2 x 3 x 4 s 1 s 2 s 3 z 0 0 0 6 2 − 2 0 0 10 0 2 − 1 − 1 0 2 − 1 0 1 2 0 1 1 0 0 1 0 3 0 0 8 − 12 0 12 18 1 78 ] Pivot 6 in column 4, row 1. And R 1 → 1 6 R 1 R 2 → 1 12 R 2 R 3 → 1 12 R 3 [ x 1 x 2 x 3 x 4 s 1 s 2 s 3 z 1 0 0 1 1 3 − 1 3 0 0 5 3 0 1 1 2 0 1 6 5 6 1 2 0 4 3 0 1 1 2 0 − 1 6 1 6 1 2 0 2 3 0 0 8 0 4 18 18 1 98 ] Therefore, the minimum value is 98 and y 1 = 4 , y 2 = 8 , y 3 = 18 _ . Now, use the section 4.4 method. First, change the objective. Maximize z = − w = − 7 y 1 − 2 y 2 − 3 y 3 The constraints are not changed. Initial simple tableau is: [ y 1 y 2 y 3 s 1 s 2 s 3 s 4 z 1 1 2 − 1 0 0 0 0 48 1 1 0 0 − 1 0 0 0 12 0 0 1 0 0 − 1 0 0 10 3 0 1 0 0 0 − 1 0 30 7 2 3 0 0 0 0 1 0 ] Pivot 3 in column 1, row 4

Finite Mathematics, Books a la Carte Plus MyLab Math Access Card Package (11th Edition)

11th Edition

ISBN: 9780133886818

Author: Margaret L. Lial, Raymond N. Greenwell, Nathan P. Ritchey

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 4, Problem 27RE

To determine

The minimization of the problem and then determine the solution of the problem by using the dual method and simplex method.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 4, Problem 26RE

Chapter 4, Problem 28RE

Students have asked these similar questions

Page < 1 of 2 - ZOOM + 1) a) Find a matrix P such that PT AP orthogonally diagonalizes the following matrix A. = [{² 1] A = b) Verify that PT AP gives the correct diagonal form. 2 01 -2 3 2) Given the following matrices A = -1 0 1] an and B = 0 1 -3 2 find the following matrices: a) (AB) b) (BA)T 3) Find the inverse of the following matrix A using Gauss-Jordan elimination or adjoint of the matrix and check the correctness of your answer (Hint: AA¯¹ = I). [1 1 1 A = 3 5 4 L3 6 5 4) Solve the following system of linear equations using any one of Cramer's Rule, Gaussian Elimination, Gauss-Jordan Elimination or Inverse Matrix methods and check the correctness of your answer. 4x-y-z=1 2x + 2y + 3z = 10 5x-2y-2z = -1 5) a) Describe the zero vector and the additive inverse of a vector in the vector space, M3,3. b) Determine if the following set S is a subspace of M3,3 with the standard operations. Show all appropriate supporting work.

13) Let U = {j, k, l, m, n, o, p} be the universal set. Let V = {m, o,p), W = {l,o, k}, and X = {j,k). List the elements of the following sets and the cardinal number of each set. a) W° and n(W) b) (VUW) and n((V U W)') c) VUWUX and n(V U W UX) d) vnWnX and n(V WnX)

9) Use the Venn Diagram given below to determine the number elements in each of the following sets. a) n(A). b) n(A° UBC). U B oh a k gy ท W z r e t ་ C

Chapter 4 Solutions

Finite Mathematics, Books a la Carte Plus MyLab Math Access Card Package (11th Edition)

Ch. 4.1 - Convert each inequality into an equation by adding...Ch. 4.1 - Prob. 2E Ch. 4.1 - Convert each inequality into an equation by adding...Ch. 4.1 - Prob. 4E Ch. 4.1 - For Exercises 5-8. (a) determine the number of...Ch. 4.1 - Prob. 6E Ch. 4.1 - For Exercises 5-8, (a) determine the number of...Ch. 4.1 - For Exercises 5-8, (a) determine the number of...Ch. 4.1 - Introduce slack variables as necessary, then...Ch. 4.1 - Introduce slack variables as necessary, then write...

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 minimization of the problem and then determine the solution of the problem by using the dual method and simplex method.

Solution Summary: The author explains how to determine the minimization of the problem by using the dual method and simplex method.

Videos

The minimization of the problem and then determine the solution of the problem by using the dual method and simplex method.

Want to see the full answer?

Chapter 4 Solutions