1 / 52

# Linear Programming Reading: CLRS, Ch. 29 or reference - PowerPoint PPT Presentation

Linear Programming Reading: CLRS, Ch. 29 or reference. CSE 6331 Algorithms Steve Lai. Simplex Method. A system of linear inequalities defines a polytope (or simplex) as a feasible region.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Linear Programming Reading: CLRS, Ch. 29 or reference' - quana

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Linear ProgrammingReading: CLRS, Ch. 29 or reference

CSE 6331 Algorithms

Steve Lai

A system of linear inequalities defines a polytope (or simplex) as a feasible region.

The simplex algorithm begins at a starting vertexand moves along the edges of the polytopeuntil it reaches the vertex of the optimum solution.

Source: Linear programming, Thomas S. Ferguson, UCLA

• T.S. Ferguson, “Linear Programming: A Concise Introduction,” http://www.math.ucla.edu/~tom/LP.pdf .

• Lecture notes: http://www.math.cuhk.edu.hk/~wei/LP11.html