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

Explicit Solutions in Convex Goal Programming

Author

Listed:
  • A. Charnes

    (University of Texas)

  • W. W. Cooper

    (Carnegie-Mellon University)

  • D. Klingman

    (University of Texas)

  • R. J. Niehaus

    (Office of Civilian Manpower Management, Department of the Navy)

Abstract

Goal programming has now become an important tool in areas such as public management science. There is therefore a need for examining ways of securing improved computational efficiency, as is done in this paper, instead of resting only on the linear programming equivalences that were set forth when the original goal programming article was published in Vol. 1, No. 2 of Management Science. Based on lemmata which permit reduction of various important classes of convex goal programming models to problems of full row rank-interval programming type, explicit solutions to convex goal programming problems are exhibited. Some of the equivalences herein established are also useful in their own right and for other classes of problems--e.g., interval programming--as well as advanced start procedures and other such computational matters.

Suggested Citation

  • A. Charnes & W. W. Cooper & D. Klingman & R. J. Niehaus, 1975. "Explicit Solutions in Convex Goal Programming," Management Science, INFORMS, vol. 22(4), pages 438-448, December.
    • Handle: RePEc:inm:ormnsc:v:22:y:1975:i:4:p:438-448
    DOI: 10.1287/mnsc.22.4.438
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.22.4.438
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.22.4.438?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. V M Miori, 2011. "A multiple objective goal programming approach to the truckload routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(8), pages 1524-1532, August.
    2. Chen, Dabai, 1985. "Two essays on the mathematical modelling of a Chinese production team," ISU General Staff Papers 1985010108000017534, Iowa State University, Department of Economics.

    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:22:y:1975:i:4:p:438-448. 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.