1 / 12

Section 4.1

Section 4.1. The Simplex Method: Standard Maximization Problems. The Simplex Method.

barth
Télécharger la présentation

Section 4.1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Section 4.1 The Simplex Method: Standard Maximization Problems

  2. The Simplex Method The simplex method is an iterative process. Starting at some initial feasible solution (a corner point – usually the origin), each iteration moves to another corner point with an improved (or at least not worse) value of the objective function. Iteration stops when an optimal solution (if it exists) is found.

  3. A Standard (maximization) Linear Programming Problem: • The objective function is to be maximized. • All the variables involved in the problem are nonnegative. • Each constraint may be written so that the expression with the variables is less than or equal to a nonnegative constant.

  4. Ex. A standard maximization problem: Maximize P = 4x + 5y Subject to First introduce nonnegative slack variables to make equations out of the inequalities: Next, rewrite the objective function Set = 0 with a 1 on P: –4x – 5y + P = 0

  5. Form the system: Basic variables Write as a tableau: Nonbasic variables Variables in non-unit columns are given a value of zero, so initially x = y = 0.

  6. Choose a pivot: Ratios: • Select column: select most negative entry in the last row (to left of vertical line). • Select row: select smallest ratio: constant/entry (using only entries from selected column) Next using the pivot, create a unit column

  7. Ratios: Repeat steps

  8. All entries in the last row are nonnegative therefore an optimal solution has been reached: Assign 0 to variables w/out unit columns (u, v). Notice x = 1, y = 5, and P = 25 (the max).

  9. The Simplex Method: • Set up the initial simplex tableau. • If all entries in the last row are nonnegative then an optimal solution has been reached, go to step 4. • Perform the pivot operation: convert pivot to a 1, then use row operations to make a unit column. Return to step 2. • Determine the optimal solution(s). The value of the variable heading each unit column is given by the corresponding value in the column of constants. Variables heading the non-unit columns have value zero.

  10. Multiple Solutions There are infinitely many solutions if and only if the last row to the right of the vertical line of the final simplex tableau has a zero in a non-unit column. No Solution A linear programming problem will have no solution if the simplex method breaks down (ex. if at some stage there are no nonnegative ratios for computation).

  11. Minimization with Constraints Ex. Minimize C = –4 x – 5y Subject to Notice if we let P = –C = 4x + 5y we have a standard maximization problem. If we solve this associated problem we find P = 25, therefore the minimum is C = –25.

More Related