Abstract
In this chapter we consider the primal linear programming problem
, where A = {a ij } are m × n matrices, b = (b 1,…,b m)⊤ ∈ E m, c = (c 1,…,c n)⊤ ∈ E n. We assume that X ≠ ∅, f * = inf x ∈X f(x) > -∞. Then, according to Theorem 2.1.1, X * = {x ∈ X : f(x) = f *} ≠ ∅.
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
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Vasilyev, F.P., Ivanitskiy, A.Y. (2001). Regularization Methods. In: In-Depth Analysis of Linear Programming. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9759-3_5
Download citation
DOI: https://doi.org/10.1007/978-94-015-9759-3_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5851-5
Online ISBN: 978-94-015-9759-3
eBook Packages: Springer Book Archive