Advertisement

Linear Programming

  • Osman Güler
Chapter
Part of the Graduate Texts in Mathematics book series (GTM, volume 258)

Abstract

A linear program is a problem of minimization (or maximization) of a linear function subject to linear equalities or inequalities, that is, the optimization of a linear function over a polyhedron. It is probably the most practical and important class of practical optimization problems, having wide applications in industry.

Keywords

Feasible Point Dual Pair Dual Program Strong Duality Theorem Weak Duality Theorem 
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 New York 2010

Authors and Affiliations

  1. 1.Department of Mathematics & StatisticsUniversity of MarylandBaltimoreUSA

Personalised recommendations