IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v114y1999i3p569-579.html
   My bibliography  Save this article

An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem

Author

Listed:
  • Crema, Alejandro

Abstract

No abstract is available for this item.

Suggested Citation

  • Crema, Alejandro, 1999. "An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem," European Journal of Operational Research, Elsevier, vol. 114(3), pages 569-579, May.
    • Handle: RePEc:eee:ejores:v:114:y:1999:i:3:p:569-579
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00132-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Rountree, Suzanne L. K. & Gillett, Billy E., 1982. "Parametric integer linear programming: A synthesis of branch and bound with cutting planes," European Journal of Operational Research, Elsevier, vol. 10(2), pages 183-189, June.
    2. Crema, Alejandro, 1997. "A contraction algorithm for the multiparametric integer linear programming problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 130-139, August.
    3. Larry Jenkins, 1982. "Parametric Mixed Integer Programming: An Application to Solid Waste Management," Management Science, INFORMS, vol. 28(11), pages 1270-1284, November.
    4. Linus Schrage & Laurence Wolsey, 1985. "Sensitivity Analysis for Branch and Bound Integer Programming," Operations Research, INFORMS, vol. 33(5), pages 1008-1023, October.
    5. Loukakis, E. & Muhlemann, A. P., 1984. "Parameterisation algorithms for the integer linear programs in binary variables," European Journal of Operational Research, Elsevier, vol. 17(1), pages 104-115, July.
    6. Wang, Hsiao-Fan & Horng, Jyh-Shing, 1996. "Structural approach to parametric analysis of an IP on the case of the right-hand side," European Journal of Operational Research, Elsevier, vol. 92(1), pages 148-156, 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. Liao, Chao-ning & Önal, Hayri & Chen, Ming-Hsiang, 2009. "Average shadow price and equilibrium price: A case study of tradable pollution permit markets," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1207-1213, August.
    2. Mukherjee, Saral & Chatterjee, A.K., 2006. "The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price," European Journal of Operational Research, Elsevier, vol. 169(1), pages 53-64, February.
    3. Chatterjee A K & Mukherjee, Saral, 2006. "Unified Concept of Bottleneck," IIMA Working Papers WP2006-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    4. Crema, Alejandro, 2002. "An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program," European Journal of Operational Research, Elsevier, vol. 138(3), pages 484-494, May.

    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. Tcha, Dong-wan & Myung, Young-soo & Chung, Ki-ho, 1995. "Parametric uncapacitated facility location," European Journal of Operational Research, Elsevier, vol. 86(3), pages 469-479, November.
    2. Onur Tavaslıoğlu & Oleg A. Prokopyev & Andrew J. Schaefer, 2019. "Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function," Operations Research, INFORMS, vol. 67(6), pages 1659-1677, November.
    3. Babacar Thiongane & Anass Nagih & Gérard Plateau, 2005. "An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual," Annals of Operations Research, Springer, vol. 139(1), pages 353-373, October.
    4. Crema, Alejandro, 1997. "A contraction algorithm for the multiparametric integer linear programming problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 130-139, August.
    5. Crema, Alejandro, 2002. "The multiparametric 0-1-integer linear programming problem: A unified approach," European Journal of Operational Research, Elsevier, vol. 139(3), pages 511-520, June.
    6. Crema, Alejandro, 2000. "An algorithm for the multiparametric 0-1-integer linear programming problem relative to the objective function," European Journal of Operational Research, Elsevier, vol. 125(1), pages 18-24, August.
    7. Crema, Alejandro, 1995. "Average shadow price in a mixed integer linear programming problem," European Journal of Operational Research, Elsevier, vol. 85(3), pages 625-635, September.
    8. Mukherjee, Saral & Chatterjee, A.K., 2006. "The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price," European Journal of Operational Research, Elsevier, vol. 169(1), pages 53-64, February.
    9. Crema, Alejandro, 2002. "An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program," European Journal of Operational Research, Elsevier, vol. 138(3), pages 484-494, May.
    10. Shuming Wang & Tsan Sheng Ng & Manyu Wong, 2016. "Expansion planning for waste‐to‐energy systems using waste forecast prediction sets," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(1), pages 47-70, February.
    11. Efstratios Pistikopoulos & Luis Dominguez & Christos Panos & Konstantinos Kouramas & Altannar Chinchuluun, 2012. "Theoretical and algorithmic advances in multi-parametric programming and control," Computational Management Science, Springer, vol. 9(2), pages 183-203, May.
    12. Su, Jun-Pin & Chiueh, Pei-Te & Hung, Ming-Lung & Ma, Hwong-Wen, 2007. "Analyzing policy impact potential for municipal solid waste management decision-making: A case study of Taiwan," Resources, Conservation & Recycling, Elsevier, vol. 51(2), pages 418-434.
    13. Pati, Rupesh Kumar & Vrat, Prem & Kumar, Pradeep, 2008. "A goal programming model for paper recycling system," Omega, Elsevier, vol. 36(3), pages 405-417, June.
    14. Dai, C. & Li, Y.P. & Huang, G.H., 2012. "An interval-parameter chance-constrained dynamic programming approach for capacity planning under uncertainty," Resources, Conservation & Recycling, Elsevier, vol. 62(C), pages 37-50.
    15. M. W. Dawande & J. N. Hooker, 2000. "Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming," Operations Research, INFORMS, vol. 48(4), pages 623-634, August.
    16. Jenkins, Larry, 1996. "A comment on "Grey integer programming: an application to waste management planning under uncertainty" by Guo H. Huang, Brian W. Baetz, Gilles G. Patry : European Journal of Operational Rese," European Journal of Operational Research, Elsevier, vol. 89(3), pages 671-670, March.
    17. Tsan Sheng Ng & Shuming Wang, 2017. "Recycling systems design using reservation incentive data," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1236-1258, October.
    18. Liao, Chao-ning & Önal, Hayri & Chen, Ming-Hsiang, 2009. "Average shadow price and equilibrium price: A case study of tradable pollution permit markets," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1207-1213, August.
    19. Crema, Alejandro, 1998. "A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 684-695, August.
    20. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, 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:eee:ejores:v:114:y:1999:i:3:p:569-579. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.