0
Linear Programming

Excerpt

Linear programming (LP) is a technique for the special case of a linear OF and linear constraints. In a 2-DV case, both OF and constraints have the linear form of a + bx1 + cx2. While this may seem to be a trivial and restrictive model, it actually represents broad categories of applications in scheduling, blending, allocation, and logistics. LP applications are the mainstay of business optimization, and the applications go well beyond the 2-DV realm, with 100–1000 DVs not uncommon.

12.1Introduction
12.2Visual Representation and Concepts
12.3Basic LP Procedure
12.4Canonical LP Statement
12.5LP Algorithm
12.6Simplex Tableau
12.7Takeaway
12.8Exercises

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In