Linear Programming

  • W. D. Wallis

Abstract

In many problems, the object is to optimize — either maximize or minimize — something. A company wishes to maximize profit or minimize cost; a traveler wishes to minimize the length of a journey; a factory manager wishes to maximize output. But it is not always straightforward. For example, a traveler might wish to minimize travel time, but cannot exceed her budget. In this case the financial limitation is called a constraint.

Keywords

Basic Solution Linear Programming Problem Feasible Region Corner Point Simplex Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • W. D. Wallis
    • 1
  1. 1.Department of MathematicsSouthern Illinois UniversityCarbondaleUSA

Personalised recommendations