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

Strictly Concave Parametric Programming, Part I: Basic Theory

Author

Listed:
  • Arthur M. Geoffrion

    (University of California, Los Angeles)

Abstract

This paper, which is presented in two parts, develops a computational approach to strictly concave parametric programs of the form: Maximize \alpha f 1 (x) + (1 - \alpha )f 2 (x) subject to concave inequality constraints for each fixed value of \alpha in the unit interval, where f 1 and f 2 are strictly concave and certain additional regularity conditions are satisfied. This class of problems subsumes a corresponding class of vector maximum problems and also, by means of a simple device, provides a deformation method for ordinary concave programming. The approach is based on exploiting the continuity properties of the parametric program so as to efficiently maintain a solution to the associated Kuhn-Tucker conditions as a traverses the unit interval. The same approach can be adapted to much more general parametric programs than the one above. In Part I, a Basic Parametric Procedure is derived and shown to be finite in a certain sense. It forms the basis of various parametric programming algorithms, depending on what special assumptions are made on the functions. In Part II, additional theory is developed that facilitates computational implementation, and one possible general-purpose algorithm for a digital computer is given. An illustrative graphical example is presented and several extensions are indicated.

Suggested Citation

  • Arthur M. Geoffrion, 1966. "Strictly Concave Parametric Programming, Part I: Basic Theory," Management Science, INFORMS, vol. 13(3), pages 244-253, November.
  • Handle: RePEc:inm:ormnsc:v:13:y:1966:i:3:p:244-253
    DOI: 10.1287/mnsc.13.3.244
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.13.3.244
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.13.3.244?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. Goh, C. J. & Yang, X. Q., 1996. "Analytic efficient solution set for multi-criteria quadratic programs," European Journal of Operational Research, Elsevier, vol. 92(1), pages 166-181, July.

    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:13:y:1966:i:3:p:244-253. 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.