Linear programming reading clrs ch 29 or reference
This presentation is the property of its rightful owner.
Sponsored Links
1 / 52

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


  • 62 Views
  • Uploaded on
  • Presentation posted in: General

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.

Download Presentation

Linear Programming Reading: CLRS, Ch. 29 or reference

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.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 programming reading clrs ch 29 or reference

Linear ProgrammingReading: CLRS, Ch. 29 or reference

CSE 6331 Algorithms

Steve Lai


Linear programming reading clrs ch 29 or reference

Source: Linear programming, Thomas S. Ferguson, UCLA


Simplex method

Simplex Method

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


References

References

  • 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


  • Login