Abstract
Linear Programs are special mathematical programming problems. We understand by a mathematical programming problem in the Euclidean space ℝn the optimization of a given real-valued function — the objective function — on a given subset of ℝn, the so-called feasible set. A mathematical programming problem is called a linear program if its objective function is a linear functional on ℝn and if the feasible set can be described as the intersection of finitely many halfspaces and at most finitely many hyperplanes in ℝn. Hence the feasible set of a linear program may be represented as the solution set of a system of finitely many linear inequalities and, at most, finitely many linear equalities — the so-called (linear) constraints — in a finite number of variables.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kall, P. (1976). Prerequisites. In: Stochastic Linear Programming. Ökonometrie und Unternehmensforschung / Econometrics and Operations Research, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-66252-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-66252-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-66254-6
Online ISBN: 978-3-642-66252-2
eBook Packages: Springer Book Archive