Skip to main content
Log in

Modified predictor-corrector algorithm for locating weighted centers in linear programming

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In certain applications of linear programming, the determination of a particular solution, the weighted center of the solution set, is often desired, giving rise to the need for algorithms capable of locating such center. In this paper, we modify the Mizuno-Todd-Ye predictor-corrector algorithm so that the modified algorithm is guaranteed to converge to the weighted center for given weights. The key idea is to ensure that iterates remain in a sequence of shrinking neighborhoods of the weighted central path. The modified algorithm also possesses polynomiality and superlinear convergence.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Charnes, A., Cooper, W. W., andThrall, R. M.,A Structure for Classifying and Characterizing Efficiency and Inefficiency in Data Envelopment Analysis, Journal of Productivity Analysis, Vol. 2, pp. 197–237, 1991.

    Article  Google Scholar 

  2. Thrall, R. M., Private Communications, 1991.

  3. Gonzaga, C. C.,Path-Following Methods for Linear Programming, SIAM Review, Vol. 34, pp. 167–224, 1992.

    Article  Google Scholar 

  4. McLinden, L.,An Analogue of Moreau's Proximation Theorem, with Application to the Nonlinear Complementarity Problem, Pacifi Journal of Mathematics, Vol. 88, pp. 101–161, 1980.

    Google Scholar 

  5. Megiddo, N.,Pathways to the Optimal Set of Linear Programming, Progress in Mathematical Programming, Interior-Point, and Related Methods, Edited by N. Megiddo, Springer-Verlag, New York, New York, pp. 131–158, 1989.

    Google Scholar 

  6. Mizuno, S., Todd, M. J., andYe, Y.,On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming, Technical Report No. 944, School of OR/IE, Cornell University, 1990.

  7. Ye, Y., Güler, O., Tapia, R. A., andZhang, Y., Quadratically Convergent\(O(\sqrt {nL} )\) Algorithm for Linear Programming, Technical Report TR91-26, Department of Mathematical Sciences, Rice University, 1991.

  8. Zhang, Y., andTapia, R. A.,On the Convergence of Interior-Point Methods to the Center of Solution Set in Linear Programming, Technical Report TR91-30, Department of Mathematical Sciences, Rice University, 1991.

  9. Hoffman, A. J.,On Approximate Solutions of Systems of Linear Inequalities, Journal of Research of the National Bureau of Standards, Vol. 49, pp. 263–265, 1952.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by R. A. Tapia

The work of the first author was supported in part by NSF Grant DMS-91-02761 and DOE Contract DE-FG05-91-ER25100.

The work of the second author was supported in part by NSF Cooperative Agreement CCR-88-09615.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, Y., El-Bakry, A. Modified predictor-corrector algorithm for locating weighted centers in linear programming. J Optim Theory Appl 80, 319–331 (1994). https://doi.org/10.1007/BF02192939

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02192939

Key Words

Navigation