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

Note--An Efficient Goal Programming Algorithm Using Constraint Partitioning and Variable Elimination

Author

Listed:
  • Jeffrey L. Arthur

    (Oregon State University)

  • A. Ravindran

    (Purdue University)

Abstract

An efficient algorithm for solving linear goal programming problems using partitioning and elimination procedures is presented. The algorithm takes advantage of the definition of ordinal preemptive factors in the objective function inherent in most goal programming formulations. Preliminary results indicate that the partitioning algorithm is superior to the existing methods for solving goal programming problems.

Suggested Citation

  • Jeffrey L. Arthur & A. Ravindran, 1978. "Note--An Efficient Goal Programming Algorithm Using Constraint Partitioning and Variable Elimination," Management Science, INFORMS, vol. 24(8), pages 867-868, April.
    • Handle: RePEc:inm:ormnsc:v:24:y:1978:i:8:p:867-868
    DOI: 10.1287/mnsc.24.8.867
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.24.8.867
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.24.8.867?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. Kalu, Timothy Ch. U., 1999. "An algorithm for systems welfare interactive goal programming modelling," European Journal of Operational Research, Elsevier, vol. 116(3), pages 508-529, 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:24:y:1978:i:8:p:867-868. 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.