Abstract
The general linear programming problem has e.g. the form
where q ≤ n; that is, some variables (or “decision variables” or “activities”) x j for j = q+1,...,n may be unrestricted in sign (“free variables”). Inequalities of the type
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
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Padberg, M. (1999). The Linear Programming Problem. In: Linear Optimization and Extensions. Algorithms and Combinatorics, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12273-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-12273-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08511-6
Online ISBN: 978-3-662-12273-0
eBook Packages: Springer Book Archive