IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v54y2017i1d10.1007_s12597-016-0275-4.html
   My bibliography  Save this article

On the achievement stability set for parametric linear goal programming problems

Author

Listed:
  • M. S. Osman

    (Alasher University)

  • M. A. Maaty

    (Higher Technological Institute)

  • F. A. Farahat

    (Higher Technological Institute)

Abstract

Goal Programming (GP) has many significant advances in recent years, particularly in the area of intelligent modeling and solution analysis as it is a powerful and effective methodology for the modeling, solution, and analysis of problems having multiple and conflicting objectives. This paper presents an algorithm for investigating the achievement stability set for parametric linear goal programming problems when parameters exist in the objective function. To avoid the complexity of this problem, the iterative approach in Dauer and Krueger (Oper Res Quart 28(3 Part 2):671–681, 1977) will be used to solve it. This model has been handled because it is very easy for the decision maker to put the weights for goals but, for the sub-goals it will be difficult as they have the same measure.

Suggested Citation

  • M. S. Osman & M. A. Maaty & F. A. Farahat, 2017. "On the achievement stability set for parametric linear goal programming problems," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 181-200, March.
    • Handle: RePEc:spr:opsear:v:54:y:2017:i:1:d:10.1007_s12597-016-0275-4
    DOI: 10.1007/s12597-016-0275-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-016-0275-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-016-0275-4?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:opsear:v:54:y:2017:i:1:d:10.1007_s12597-016-0275-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.