Chapter 4.13, Problem 1P

Solved: Consider the following school redistricting problem. Th... | Cheg... http://www.chegg.com/homework-help/use-simplex-algorithm-solve-giap...
Chapter 4.13, Problem 1P Bookmark Show all steps:
Problem
Use the two-phase simplex method to solve the Section 4.12 problems.
Step-by-step solution
Step 1 of 38
Consider the following linear programming problem:
Comment
Step 2 of 38
Now introduce slack variables as:
And surplus variable and artificial variable as:
Such that the standard form of the linear programming problem is:
Comment
Step 3 of 38
Now, the Phase I linear programming problem will be:
The initial basic feasible solution is:
1 of 13 10/6/2017, 6:15 PM
Now, is in initial basic feasible solution, and eliminate it from (row 0) of simplex table. Now
replace (row 0) by:
The initial simplex tableau is shown below:
Comment
Step 4 of 38
Since the highest positive entry in row 0 is 3, now choose variable to enter the basis.
Comment
Step 5 of 38
The pivot is 3 in row 3. Therefore, the variable shall enter in row 3.
Now apply row operations as:
Comment
Step 6 of 38
Since there are no positive coefficients in the row 0, the solution is optimal. Now there are no
artificial variables in the optimal Phase I basis. Now drop the columns for the artificial variables
and reintroduce the original objective function:
Since is in the optimal phase I basis, it is needed to eliminate it from Phase II row 0.
Therefore,
2 of 13 10/6/2017, 6:15 PM
Comment
Step 7 of 38
The Phase II simplex table with the constraints of optimal phase I table is shown below.
Comment
Step 8 of 38
This is optimal since there are no positive entries in row 0. The optimal solution is:
Comment
Step 9 of 38
Comment
Step 10 of 38
Now multiply second inequality by 1 as:
And introduce slack variable as:
And surplus variables and artificial variables as:
Comment
3 of 13 10/6/2017, 6:15 PM
Now, the phase I linear programming problem is:
Now, is in initial basic feasible solution, it is needed to eliminate it from row 0 of simplex table.
And replace row 0 by:
Comment
Step 12 of 38
Since the highest positive entry in row 0 is 2 2, now choose variable to enter the basis.
Now apply row operations:
Comment
Step 13 of 38
Since there are no positive coefficients in the row 0, the solution is optimal.
Now there are no artificial variables in the optimal Phase I basis thus drop the columns for the
artificial variables and reintroduce the original objective function:
Therefore,
Comment
4 of 13 10/6/2017, 6:15 PM
The Phase II simplex table with the constraints of optimal phase I table is shown below:
Comment
Step 15 of 38
This is optimal since there are no positive entries in row 0.
The optimal solution is:
Comment
Step 16 of 38
Consider the following linear programming problem is:
Comment
Step 17 of 38
Now introduce surplus variables and artificial variables as:
Comment
Step 18 of 38
The Phase I linear programming problem is:
Comment
Step 19 of 38
5 of 13 10/6/2017, 6:15 PM
The initial simplex tableau is shown below
Since the highest positive entry in row 0 is 5, choose variable to enter the basis.
Comment
Step 20 of 38
Comment
Step 21 of 38
However, the solution contains:
Therefore, the solution is infeasible.
Comment
Step 22 of 38
Comment
Step 23 of 38
6 of 13 10/6/2017, 6:15 PM
Comment
Step 24 of 38
Comment
Step 25 of 38
Now, is in initial basic feasible solution, it is needed to eliminate it from row 0 of simplex
table.
Now replace row 0 as:
Comment
Step 26 of 38
7 of 13 10/6/2017, 6:15 PM
Step 27 of 38
Since the highest positive entry in row 0 is 3/2, choose variable to enter the basis:
Comment
Step 28 of 38
The pivot is in row 1. Therefore, the variable shall enter in row 1.
Comment
Step 29 of 38
Now there are no artificial variables in the optimal Phase I basis.
Now drop the columns for the artificial variables and reintroduce the original objective function as:
Therefore,
Comment
Step 30 of 38
Comment
8 of 13 10/6/2017, 6:15 PM
Comment
Step 32 of 38
Consider the following linear programming problem is:
Comment
Step 33 of 38
Now introduce artificial variables as:
Now, is in initial basic feasible solution, now eliminate it from row 0 of simplex table.
And replace row 0 as:
Comment
Step 34 of 38
9 of 13 10/6/2017, 6:15 PM
Comment
Step 35 of 38
Comment
Step 36 of 38
Since there are no positive coefficients in the row 0, the solution is optimal. Now there are no
artificial variables in the optimal Phase I basis. Now drop the columns for the artificial variables
and reintroduce the original objective function as:
Therefore,
Comment
Step 37 of 38
Comment
Step 38 of 38
Since there are no positive coefficients in the row 0, the optimal solution is:
10 of 13 10/6/2017, 6:15 PM
Was this solution helpful?
11 of 13 10/6/2017, 6:15 PM
12 of 13 10/6/2017, 6:15 PM
13 of 13 10/6/2017, 6:15 PM

Chapter 4.13, Problem 1P

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter 4.13, Problem 1P

Uploaded by

Copyright:

Available Formats

Solved: Consider the following school redistricting problem. Th... | Cheg... http://www.chegg.com/homework-help/use-simplex-algorithm-solve-giap...

Chapter 4.13, Problem 1P Bookmark Show all steps:

Consider the following linear programming problem:

Now introduce slack variables as:

And surplus variable and artificial variable as:

Now, the Phase I linear programming problem will be:

The initial basic feasible solution is:

The initial simplex tableau is shown below:

The pivot is 3 in row 3. Therefore, the variable shall enter in row 3.

Now apply row operations as:

Consider the following linear programming problem:

Now multiply second inequality by 1 as:

And introduce slack variable as:

And surplus variables and artificial variables as:

Now, the phase I linear programming problem is:

The initial basic feasible solution is:

The initial simplex tableau is shown below:

The pivot is 2 in row 1. Therefore, the variable shall enter in row 1.

Now apply row operations:

This is optimal since there are no positive entries in row 0.

The optimal solution is:

Consider the following linear programming problem is:

Now introduce surplus variables and artificial variables as:

The Phase I linear programming problem is:

The initial basic feasible solution is:

The initial simplex tableau is shown below

The pivot is 3 in row 2. Therefore, the variable shall enter in row 2.

Now apply row operations as:

However, the solution contains:

Therefore, the solution is infeasible.

Consider the following linear programming problem:

The Phase I linear programming problem is:

The initial basic feasible solution is:

Now replace row 0 as:

The initial simplex tableau is shown below:

The pivot is 2 in row 2. Therefore, the variable shall enter in row 2.

Now apply row operations as:

The pivot is in row 1. Therefore, the variable shall enter in row 1.

Now apply row operations as:

Now there are no artificial variables in the optimal Phase I basis.

Consider the following linear programming problem is:

Now introduce artificial variables as:

The Phase I linear programming problem is:

The initial basic feasible solution is:

And replace row 0 as:

The initial simplex tableau is shown below:

The pivot is 1 in row 1. Therefore, the variable shall enter in row 1.

Now apply row operations as:

Was this solution helpful?

You might also like