By linear optimization (previously also described as linear programming) one understands the determination of the minimum or maximum of a linear function of finitely many variables that are subject to finitely many conditions. These so-called constraints have the form of linear equations or linear inequalities.
KeywordsCanonical Form Linear Optimization Stability Domain Simplex Algorithm Feasibility Domain
Unable to display preview. Download preview PDF.
- [6.1]E. M. L. Beale, Mathematical programming in practice, Pitman, London, 1968.Google Scholar
- [6.4]A. Kaufmann, Graphs, dynamic programming, and finite games, (translated from the French), Academic Press, New York-London, 1967.Google Scholar
- [6.7]R. J. Rothenberg, Linear programming, North Holland, Amsterdam-New York, 1979.Google Scholar
- [6.8]J. F. Shapiro, Mathematical programming: Structures and algorithms, Wiley, New York-London, 1970.Google Scholar
- [6.9]G. E. Thompson, Linear programming. An elementary introduction, Macmillan, New York-London, 1971.Google Scholar