IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v14y1967i3p221-238.html
   My bibliography  Save this article

The Convex Simplex Method

Author

Listed:
  • Willard I. Zangwill

    (The University of California Berkeley)

Abstract

This paper presents a method, called the convex simplex method, for minimizing a convex objective function subject to linear inequality constraints. The method is a true generalization of Dantzig's linear simplex method both in spirit and in the fact that the same tableau and variable selection techniques are used. With a linear objective function the convex simplex method reduces to the linear simplex method. Moreover, the convex simplex method actually behaves like the linear simplex method whenever it encounters a linear portion of a convex objective function. Many of the sophisticated techniques designed to enhance the efficiency of the linear simplex method are applicable to the convex simplex method. In particular, as an example, a network transportation problem with a convex objective function is solved by using the standard transportation tableau and by only slightly modifying the usual procedure for a linear objective function.

Suggested Citation

  • Willard I. Zangwill, 1967. "The Convex Simplex Method," Management Science, INFORMS, vol. 14(3), pages 221-238, November.
    • Handle: RePEc:inm:ormnsc:v:14:y:1967:i:3:p:221-238
    DOI: 10.1287/mnsc.14.3.221
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.14.3.221
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.14.3.221?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.
    2. Hong Zheng, 2015. "Adaptation of Network Simplex for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 49(3), pages 543-558, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:14:y:1967:i:3:p:221-238. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.