IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v55y2004i3d10.1057_palgrave.jors.2601701.html
   My bibliography  Save this article

A linear programming approach for linear multi-level programming problems

Author

Listed:
  • S B Sinha

    (Indian Institute of Technology)

  • S Sinha

    (Indian Institute of Technology)

Abstract

In an earlier paper, we proposed a modified fuzzy programming method to handle higher level multi-level decentralized programming problems (ML(D)PPs). Here we present a simple and practical method to solve the same. This method overcomes the subjectivity inherent in choosing the tolerance values and the membership functions. We consider a linear ML(D)PP and apply linear programming (LP) for the optimization of the system in a supervised search procedure, supervised by the higher level decision maker (DM). The higher level DM provides the preferred values of the decision variables under his control to enable the lower level DM to search for his optimum in a narrower feasible space. The basic idea is to reduce the feasible space of a decision variable at each level until a satisfactory point is sought at the last level.

Suggested Citation

  • S B Sinha & S Sinha, 2004. "A linear programming approach for linear multi-level programming problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 312-316, March.
    • Handle: RePEc:pal:jorsoc:v:55:y:2004:i:3:d:10.1057_palgrave.jors.2601701
    DOI: 10.1057/palgrave.jors.2601701
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601701
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601701?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.

    References listed on IDEAS

    as
    1. Cao, D. & Leung, L. C., 2002. "A partial cooperation model for non-unique linear two-level decision problems," European Journal of Operational Research, Elsevier, vol. 140(1), pages 134-141, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Kumari, M. & Singh, O.P. & Meena, D.C., 2017. "Optimising Cropping Pattern in Eastern Uttar Pradesh Using Sen’s Multi Objective Programming Approach," Agricultural Economics Research Review, Agricultural Economics Research Association (India), vol. 30(2).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    2. Cao, Dong & Chen, Mingyuan, 2006. "Capacitated plant selection in a decentralized manufacturing environment: A bilevel optimization approach," European Journal of Operational Research, Elsevier, vol. 169(1), pages 97-110, February.
    3. Bo Zeng, 2020. "A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1128-1142, October.
    4. Juan Jos¨¦ Uchuya Lop¨¦z & Raad Yahya Qassim, 2017. "An Optimal Redesign Approach for Optimal Global Supply Chain Redesign: Brazilian Soybean Grain Study," Business and Management Horizons, Macrothink Institute, vol. 5(2), pages 84-111, December.
    5. Xiang Li & Tiesong Hu & Xin Wang & Ali Mahmoud & Xiang Zeng, 2023. "The New Solution Concept to Ill-Posed Bilevel Programming: Non-Antagonistic Pessimistic Solution," Mathematics, MDPI, vol. 11(6), pages 1-13, March.
    6. Samaddar, Subhashish & Kadiyala, Savitha S., 2006. "An analysis of interorganizational resource sharing decisions in collaborative knowledge creation," European Journal of Operational Research, Elsevier, vol. 170(1), pages 192-210, April.
    7. M. Hosein Zare & Oleg A. Prokopyev & Denis Sauré, 2020. "On Bilevel Optimization with Inexact Follower," Decision Analysis, INFORMS, vol. 17(1), pages 74-95, March.
    8. M. Hosein Zare & Osman Y. Özaltın & Oleg A. Prokopyev, 2018. "On a class of bilevel linear mixed-integer programs in adversarial settings," Journal of Global Optimization, Springer, vol. 71(1), pages 91-113, May.

    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:pal:jorsoc:v:55:y:2004:i:3:d:10.1057_palgrave.jors.2601701. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.palgrave-journals.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.