Abstract
The feasible region P, defined by Definition 1.4.1, is of great importance to the LP problem. Theories and methods of LP are closely related to P, without exception. In this chapter, we introduce its special structure in geometry, including P as a polyhedral convex set, interior point, relative interior point, face, vertex, extreme direction, representation of P, optimal face and optimal vertex, graphic approach to LP, heuristic characteristic of an optimal solution, and feasible direction and active constraint.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fletcher R (1981) Practical methods of optimization. Volume 2: constrained optimization. Wiley, Chichester
Farkas J (1902) Uber die Theorie der Einfachen Ungleichungen. Journal für die Reine und Angewandte Mathematik 124:1–27
Hager WW (2002) The dual active set algorithm and its application to linear programming. Comput Optim Appl 21:263–275
Pan P-Q (1990) Practical finite pivoting rules for the simplex method. OR Spektrum 12:219–225
Powell MJD (1989) A tolerant algorithm for linearly constrained optimization calculations. Math Program 45:547–566
Rockafellar RT (1997) Convex analysis. Princeton University Press, Princeton
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
PAN, PQ. (2023). Geometry of Feasible Region. In: Linear Programming Computation. Springer, Singapore. https://doi.org/10.1007/978-981-19-0147-8_2
Download citation
DOI: https://doi.org/10.1007/978-981-19-0147-8_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-0146-1
Online ISBN: 978-981-19-0147-8
eBook Packages: Computer ScienceComputer Science (R0)