LINEARLY-CONSTRAINED ENTROPY MAXIMIZATION PROBLEM WITH QUADRATIC COST AND ITS APPLICATIONS TO TRANSPORTATION PLANNING PROBLEMS

Many transportation problems have been formulated as a linearly-constrained convex programming problem whose objective function consists of entropy functions and other terms reflecting linear cost like travel time. There have been concerns about the adequacy of linear cost in such formulations. This paper intends to address such concerns by proposing a model of linearly-constrained entropy maximization with quadratic cost. The related duality theory has been studied. It leads to the development of a globally convergent algorithm with a quadratic rate of convergence. The efficiency and the robustness of this approach are confirmed by the computational experience.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    1314 Guilford Avenue
    Baltimore, MD  United States  21202
  • Authors:
    • FANG, S C
    • Tsao, HSJ
  • Publication Date: 1995-11

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00715450
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 4 1996 12:00AM