1 / 11

Simplex Method for Bounded Variables

Simplex Method for Bounded Variables. Linear programming problems with lower and upper bounds Generalizing simplex algorithm for bounded variables Reference: Chapter 5 in Bazaraa, Jarvis, and Sherali. LP Problems with Bounded Variables.

kamea
Télécharger la présentation

Simplex Method for Bounded Variables

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. Simplex Method for Bounded Variables Linear programming problems with lower and upper bounds Generalizing simplex algorithm for bounded variables Reference: Chapter 5 in Bazaraa, Jarvis, and Sherali

  2. LP Problems with Bounded Variables • In most practical Problems, variables are bounded from below as well as above: • We can handle the upper bound constraints implicitly and thus reduce the size of the basis matrix substationally.

  3. Basic Feasible Solution Consider the system: Partition A into [B,N1,N2] such that B is an invertible matrix. We call it a basis structure. The basic solution corresponding to this basis structure is determined in the following manner: If for all , we say that the solution is a basic feasible solution.

  4. Basic Feasible Solution (cont’d) • Consider the solution space given by: • Which is equivalent to:

  5. Basic Feasible Solution (cont’d) Suppose that x2 and x4 are made basic variables, then: • Suppose we set x1=0 and x3=0. Then x2=5 and x4=-6. The resulting solution is not a basic feasible solution. • Suppose we set x1=4 and x3=0. Then x2=1 and x4=6, which is a basic feasible solution. In general, what is the maximum number of basic feasible solutions we can have?

  6. Optimality Conditions for Minimization Problem Basic Feasible Solution: Optimality Conditions:

  7. Handling Entering Variable • If the nonbasic variable entering the basis is at its lower bound, then its value is increased. • If the nonbasic variable entering the basis is at its upper bound, then its value is decreased. • The amount of increase or decrease is determined by the constraint that the values of all basic (and nonbasic) variables remains within their lower and upper bounds.

  8. Example The initial simplex tableau: Entering variable: x2 Leaving variable: x5

  9. Example (cont’d) Next tableau: Entering variable: x3 Leaving variable: x2

  10. Example (cont’d) Next tableau: Entering variable: x1 Leaving variable: x4

  11. Example (cont’d) Final tableau: The current solution is an optimal solution.

More Related