Question

In: Math

Convert the system 3x1 +13x2 - 14x3 = -14 x1 + 4x2 -5x3 = -4 -7x1...

Convert the system

3x1 +13x2 - 14x3 = -14

x1 + 4x2 -5x3 = -4

-7x1 - 25x2 +39x3 = 20

to an augmented matrix. Then reduce the system to echelon form and determine if the system is consistent. If the system in consistent, then find all solutions.

Augmented matrix:

Echelon form:

Is the system consistent?

Solution (x1,x2,x3) =

Expert Solution

augmented matrix is

3	13	-14	-14
1	4	-5	-4
-7	-25	39	20

convert into Reduced Row Eschelon Form...

Divide row1 by 3

1	13/3	-14/3	-14/3
1	4	-5	-4
-7	-25	39	20

Add (-1 * row1) to row2

1	13/3	-14/3	-14/3
0	-1/3	-1/3	2/3
-7	-25	39	20

Add (7 * row1) to row3

1	13/3	-14/3	-14/3
0	-1/3	-1/3	2/3
0	16/3	19/3	-38/3

Divide row2 by -1/3

1	13/3	-14/3	-14/3
0	1	1	-2
0	16/3	19/3	-38/3

Add (-16/3 * row2) to row3

1	13/3	-14/3	-14/3
0	1	1	-2
0	0	1	-2

Add (-1 * row3) to row2

1	13/3	-14/3	-14/3
0	1	0	0
0	0	1	-2

Add (14/3 * row3) to row1

1	13/3	0	-14
0	1	0	0
0	0	1	-2

Add (-13/3 * row2) to row1

1	0	0	-14
0	1	0	0
0	0	1	-2

here for every column there is one pivot entry so system is consistent

so unique solution is

milcah answered 1 year ago

Consider the TOYCO model given below: TOYCO Primal: max z=3x1+2x2+5x3 s.t. x1 + 2x2 + x3...

Consider the TOYCO model given below: TOYCO Primal: max z=3x1+2x2+5x3 s.t. x1 + 2x2 + x3 ? 430 (Operation 1) 3x1 + 2x3 ? 460 (Operation 2) x1 + 4x2 ? 420 (Opeartion 3 ) x1, x2, x3 ?0 Optimal tableau is given below: basic x1 x2 x3 x4 x5 x6 solution z 4 0 0 1 2 0 1350 x2 -1/4 1 0 1/2 -1/4 0 100 x3 3/2 0 1 0 1/2 0 230 x6 2 0 0...

For the system 2x1 − 4x2 + x3 + x4 = 0, x1 − 2x2 +...

For the system 2x1 − 4x2 + x3 + x4 = 0, x1 − 2x2 + 5x4 = 0, find some vectors v1, . . . , vk such that the solution set to this system equals span(v1, . . . , vk).

Consider the following linear optimization model. Z = 3x1+ 6x2+ 2x3 st 3x1 +4x2 + x3...

Consider the following linear optimization model. Z = 3x1+ 6x2+ 2x3 st 3x1 +4x2 + x3 ≤2 x1+ 3x2+ 2x3 ≤ 1 X1, x2, x3 ≥0 (10) Write the optimization problem in standard form with the consideration of slack variables. (30) Solve the problem using simplex tableau method. (10) State the optimal solution for all variables.

Solve the following linear programming model graphically: Max Z= 3x1 +4x2 Subject to: 2x1 + 4x2...

Solve the following linear programming model graphically: Max Z= 3x1 +4x2 Subject to: 2x1 + 4x2 <= 22 -x1 + 4x2 <= 10 4x1 – 2x2 <= 14 x1 – 3x2 <= 1 x1, x2, >=0 Clearly identify the feasible region, YOUR iso-profit line and the optimal solution (that is, d.v. values and O.F. Value.

Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 +...

Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 + 3x2 + x3 ≥ 30 2x1 + x2 + x3 ≤ 50 4x1 + 2x2 + 3x3 ≤ 120 x1, x2, x3 ≥ 0 a) Find the optimal solution by using simplex method b) Find the dual price for the first constraint. c) Find the dual price for the second constraint. d) Find the dual price for the third constraint. e) Suppose the right-hand...

For the linear system x1+3x2=2 3x1+hx2=k Find values for h and k such that the system...

For the linear system x1+3x2=2 3x1+hx2=k Find values for h and k such that the system has: a) no solution b) a unique solution c) infinitely many solutions

Maximize Z= 3 X1+4 X2+2.5X3 Subject to 3X1+4X2+2X3≤500 2X1+1X2+2X3≤400 1X1+3X2+3X3≤300 X1,X2,X3≥0 Change objective function coeffiecient x3...

Maximize Z= 3 X1+4 X2+2.5X3 Subject to 3X1+4X2+2X3≤500 2X1+1X2+2X3≤400 1X1+3X2+3X3≤300 X1,X2,X3≥0 Change objective function coeffiecient x3 to 6 and change coefficient of x3 to 5in constraint 1 ,to 2 in constraint 2 ,to 4 in constraint3. calculate new optimal solution using sensitivity analysis

Consider the following linear program: maximize z = x1 + 4x2 subject to: x1 + 2x2...

Consider the following linear program: maximize z = x1 + 4x2 subject to: x1 + 2x2 <= 13 x1 - x2 <= 8 - x1 + x2 <= 2 -3 <= x1 <= 8 -5 <= x2 <= 4 Starting with x1 and x2 nonbasic at their lower bounds, perform ONE iteration of the Bounded Variables Revised Simplex Method. (Tableau or matrix form is acceptable). Show your work. Clearly identify the entering and leaving variables. After the pivot, identify the...

Consider the following linear programming problem. min −x1 + 4x2 subject to: • x1 + x2...

Consider the following linear programming problem. min −x1 + 4x2 subject to: • x1 + x2 ≥ 1 • 3x1 + x2 ≤ .5 • x1, x2 ≥ 0 Formulate the dual of this problem.

Consider the linear system of equations below 3x1 − x2 + x3 = 1 3x1 +...

Consider the linear system of equations below 3x1 − x2 + x3 = 1 3x1 + 6x2 + 2x3 = 0 3x1 + 3x2 + 7x3 = 4 i. Use the Gauss-Jacobi iterative technique with x (0) = 0 to find approximate solution to the system above up to the third step ii. Use the Gauss-Seidel iterative technique with x (0) = 0 to find approximate solution to the third step