1 / 35

AAOC C222: OPTIMISATION

Reference Books:Hadley, G: Linear Programming, Addison WesleyPant, J.C: Optimization, Jain Brothers. 3. Hillier

domani
Download Presentation

AAOC C222: OPTIMISATION

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

    13. Linear Programming Problems(LPP) An optimization problem is called a Linear Programming Problem (LPP) when the objective function and all the constraints are linear functions of the decision variables, x1, x2, …, xn. We also include the “non-negativity restrictions”, namely xj = 0 for all j=1, 2, …, n. Thus a typical LPP is of the form:

    14. Optimize (i.e. Maximize or Minimize) z = c1 x1 + c2 x2+ …+ cn xn subject to the constraints: a11 x1 + a12 x2 + … + a1n xn = b1 a21 x1 + a22 x2 + … + a2n xn = b2 . . . am1 x1 + am2 x2 + … + amn xn = bm x1, x2, …, xn ? 0

More Related