Linear Programming is the process of minimizing a linear objective function subject to a finite number of linear equality and inequality constraints. When airlines schedule their crews, when factory managers compute the mix of raw materials which produces the most profitable blend of output products, when utilities plan their oil and gas purchases, they often find themselves setting up and solving problems with hundreds or thousands of variables and constraints. Few problems studied in computer science have greater application in the real world.
KeywordsBipartite Graph Inequality Constraint Convex Combination Gaussian Elimination Idealize Machine
Unable to display preview. Download preview PDF.
- S. Baase, Computer Algorithms: Introduction to Design and Analysis, second edition, Addison-Wesley, Reading, MA, 1988.Google Scholar
- M. Grotschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, New York, NY, 1988.Google Scholar
- I. Herstein, Topics in Algebra, second edition, Wiley, New York, NY, 1975.Google Scholar
- G. Strang, Linear Algebra and Its Applications, third edition, Harcourt Brace Jovanovich, San Diego, CA, 1988.Google Scholar