Skip to main content
SpringerLink
Log in

An extension of the entropic perturbation method of linear programming

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract.

In this paper, an extended form of the entropic perturbation method of linear programming is given, which can overcome the weakness of the original method – being easy of overflow in computing. Moreover, the global convergence of the gradient algorithm for the method is discussed.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of System Engineering, Huazhong University of Science and Technology, Wuhan, 430074, PR China (e-mail: tdggltr@public.wh.hb.cn), , , , , , CN

    D. G. Tian & Q. Fei

Authors
  1. D. G. Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Q. Fei
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Manuscript received: July 1998/final version received: November 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tian, D., Fei, Q. An extension of the entropic perturbation method of linear programming. Mathematical Methods of OR 50, 17–25 (1999). https://doi.org/10.1007/PL00020924

Download citation

  • Issue Date:

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

Search

Navigation