A projective variant of the approximate center method for the dual linear programming problem
- 98 Downloads
We deal with a projective path-following method for linear programming. The performance depends on the exponent μ in the numerator of a multiplicative barrier function. The best iteration bound, i.e. O(√nL), occurs for large values of μ, e.g., μ≥2n.
KeywordsLinear programming interior point method central path path-following method projective method polynomial-time
Unable to display preview. Download preview PDF.
- Megiddo, N (1986), Pathways to the Optimal Set in Linear Programming, in: Proceedings of the 7th Mathematical Programming Symposium of Japan, Nagoya, Japan, 1–36.Google Scholar
- Roos, C. and Vial, J.-Ph. (1988), A Polynomial Method of Approximate Centers for Linear Programming, Mathematical Programming, to appear.Google Scholar
- T. Tsuchiya (1990), Global Convergence of the Affine Scaling Methods for Degenerate Linear Programming Problems, The Institute of Statistical Mathematics, Tokyo, Japan.Google Scholar
- Yamashita, H. (1986) A polynomially and Quadratically Convergent Method for Linear Programming, Mathematical Systems Institute, Inc., Tokyo.Google Scholar