Simplex algorithm

The initial table is

z X1 X2 X3 S1 S2 S3 RHS
1 -1 -1 -1 0 0 0 0
0 1 2 2 1 0 0 20
0 2 1 2 0 1 0 20
0 2 2 1 0 0 1 20

Now X1 is entered in row 3. The resulting table is

Z X1 X2 X3 S1 S2 S3 RHS
1 0 0 -.5 0 0 .5 10
0 0 1 1.5 1 0 -.5 10
0 0 -1 1 0 1 -1 0
0 1 1 .5 0 0 .5 10

Now X3 is entered in row 3...

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 4.5, Problem 5P

Chapter 4.5, Problem 7P

Students have asked these similar questions

I want to solve 13.2 using matlab please help

a) Show a possible trace of the OSPF algorithm for computing the routing table in Router 2 forthis network.b) Show the messages used by RIP to compute routing tables.

using r language to answer question 4 Question 4: Obtain a 95% standard normal bootstrap confidence interval, a 95% basic bootstrap confidence interval, and a percentile confidence interval for the ρb12 in Question 3.

Chapter 4 Solutions

OPERATIONS RESEARCH >INTERNATIONAL EDITI

Ch. 4.1 - Prob. 1P Ch. 4.1 - Prob. 2P Ch. 4.1 - Prob. 3P Ch. 4.4 - Prob. 1P Ch. 4.4 - Prob. 2P Ch. 4.4 - Prob. 3P Ch. 4.4 - Prob. 4P Ch. 4.4 - Prob. 5P Ch. 4.4 - Prob. 6P Ch. 4.4 - Prob. 7P

Ch. 4.5 - Prob. 1P Ch. 4.5 - Prob. 2P Ch. 4.5 - Prob. 3P Ch. 4.5 - Prob. 4P Ch. 4.5 - Prob. 5P Ch. 4.5 - Prob. 6P Ch. 4.5 - Prob. 7P Ch. 4.6 - Prob. 1P Ch. 4.6 - Prob. 2P Ch. 4.6 - Prob. 3P Ch. 4.6 - Prob. 4P Ch. 4.7 - Prob. 1P Ch. 4.7 - Prob. 2P Ch. 4.7 - Prob. 3P Ch. 4.7 - Prob. 4P Ch. 4.7 - Prob. 5P Ch. 4.7 - Prob. 6P Ch. 4.7 - Prob. 7P Ch. 4.7 - Prob. 8P Ch. 4.7 - Prob. 9P Ch. 4.8 - Prob. 1P Ch. 4.8 - Prob. 2P Ch. 4.8 - Prob. 3P Ch. 4.8 - Prob. 4P Ch. 4.8 - Prob. 5P Ch. 4.8 - Prob. 6P Ch. 4.10 - Prob. 1P Ch. 4.10 - Prob. 2P Ch. 4.10 - Prob. 3P Ch. 4.10 - Prob. 4P Ch. 4.10 - Prob. 5P Ch. 4.11 - Prob. 1P Ch. 4.11 - Prob. 2P Ch. 4.11 - Prob. 3P Ch. 4.11 - Prob. 4P Ch. 4.11 - Prob. 5P Ch. 4.11 - Prob. 6P Ch. 4.12 - Prob. 1P Ch. 4.12 - Prob. 2P Ch. 4.12 - Prob. 3P Ch. 4.12 - Prob. 4P Ch. 4.12 - Prob. 5P Ch. 4.12 - Prob. 6P Ch. 4.13 - Prob. 2P Ch. 4.14 - Prob. 1P Ch. 4.14 - Prob. 2P Ch. 4.14 - Prob. 3P Ch. 4.14 - Prob. 4P Ch. 4.14 - Prob. 5P Ch. 4.14 - Prob. 6P Ch. 4.14 - Prob. 7P Ch. 4.16 - Prob. 1P Ch. 4.16 - Prob. 2P Ch. 4.16 - Prob. 3P Ch. 4.16 - Prob. 5P Ch. 4.16 - Prob. 7P Ch. 4.16 - Prob. 8P Ch. 4.16 - Prob. 9P Ch. 4.16 - Prob. 10P Ch. 4.16 - Prob. 11P Ch. 4.16 - Prob. 12P Ch. 4.16 - Prob. 13P Ch. 4.16 - Prob. 14P Ch. 4.17 - Prob. 1P Ch. 4.17 - Prob. 2P Ch. 4.17 - Prob. 3P Ch. 4.17 - Prob. 4P Ch. 4.17 - Prob. 5P Ch. 4.17 - Prob. 7P Ch. 4.17 - Prob. 8P Ch. 4 - Prob. 1RP Ch. 4 - Prob. 2RP Ch. 4 - Prob. 3RP Ch. 4 - Prob. 4RP Ch. 4 - Prob. 5RP Ch. 4 - Prob. 6RP Ch. 4 - Prob. 7RP Ch. 4 - Prob. 8RP Ch. 4 - Prob. 9RP Ch. 4 - Prob. 10RP Ch. 4 - Prob. 12RP Ch. 4 - Prob. 13RP Ch. 4 - Prob. 14RP Ch. 4 - Prob. 16RP Ch. 4 - Prob. 17RP Ch. 4 - Prob. 18RP Ch. 4 - Prob. 19RP Ch. 4 - Prob. 20RP Ch. 4 - Prob. 21RP Ch. 4 - Prob. 22RP Ch. 4 - Prob. 23RP Ch. 4 - Prob. 24RP Ch. 4 - Prob. 26RP Ch. 4 - Prob. 27RP Ch. 4 - Prob. 28RP

Knowledge Booster

Z	X1	X2	X3	S1	S2	S3	RHS
1	0	0	-.5	0	0	.5	10
0	0	1	1.5	1	0	-.5	10
0	0	-1	1	0	1	-1	0
0	1	1	.5	0	0	.5	10

Z	X1	X2	X3	S1	S2	S3	RHS
1	0	0	-.5	0	0	.5	10
0	0	1	1.5	1	0	-.5	10
0	0	-1	1	0	1	-1	0
0	1	1	.5	0	0	.5	10

Solution Summary: The author explains that the optimal solution to the LP is Z=12, X2=X3=4.

Explanation of Solution

Simplex algorithm The initial table is zX1X2X3S1S2S3RHS1-1-1-10000012210020021201020022100120 Now X1 is entered in row 3. The resulting table is ZX1X2X3S1S2S3RHS100-.500.5100011.510-.51000-1101-10011.500.510 Now X3 is entered in row 3...

Want to see the full answer?

Chapter 4 Solutions

Z	X1	X2	X3	S1	S2	S3	RHS
1	0	0	-.5	0	0	.5	10
0	0	1	1.5	1	0	-.5	10
0	0	-1	1	0	1	-1	0
0	1	1	.5	0	0	.5	10