IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v35y1988i1p73-84.html
   My bibliography  Save this article

An approach to postoptimality and sensitivity analysis of zero‐one goal programs

Author

Listed:
  • George R. Wilson
  • Hemant K. Jain

Abstract

In this article we present a methodology for postoptimality and sensitivity analysis of zero‐one goal programs based on the set of k‐best solutions. A method for generating the set of k‐best solutions using a branch and bound algorithm and an implicit enumeration scheme for multiple objective problem are discussed. Rules for determining the range of parameter changes that still allows a member of the k‐best set to be optimal are developed. An investigation of a sufficient condition for postoptimality analysis is also presented.

Suggested Citation

  • George R. Wilson & Hemant K. Jain, 1988. "An approach to postoptimality and sensitivity analysis of zero‐one goal programs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 73-84, February.
    • Handle: RePEc:wly:navres:v:35:y:1988:i:1:p:73-84
    DOI: 10.1002/1520-6750(198802)35:13.0.CO;2-L
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198802)35:13.0.CO;2-L
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(198802)35:13.0.CO;2-L?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
    ---><---

    References listed on IDEAS

    as
    1. Christopher J. Piper & Andris A. Zoltners, 1976. "Some Easy Postoptimality Analysis for Zero-One Programming," Management Science, INFORMS, vol. 22(7), pages 759-765, March.
    2. A. M. Geoffrion & R. E. Marsten, 1972. "Integer Programming Algorithms: A Framework and State-of-the-Art Survey," Management Science, INFORMS, vol. 18(9), pages 465-491, May.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Simpson, Wendell P. & Patterson, James H., 1996. "A multiple-tree search procedure for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 525-542, March.
    3. Thomas L. Morin & Roy E. Marsten, 1974. "Brand-and-Bound Strategies for Dynamic Programming," Discussion Papers 106, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    4. Sotskov, Y. & Sotskova, N. Y. & Werner, F., 1997. "Stability of an optimal schedule in a job shop," Omega, Elsevier, vol. 25(4), pages 397-414, August.
    5. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    6. 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.
    7. Derpich, Ivan & Vera, Jorge R., 2006. "Improving the efficiency of the Branch and Bound algorithm for integer programming based on "flatness" information," European Journal of Operational Research, Elsevier, vol. 174(1), pages 92-101, October.
    8. Vinay Dharmadhikari, 1975. "Decision-Stage Method: Convergence Proof, Special Application, and Computation Experience," NBER Working Papers 0094, National Bureau of Economic Research, Inc.
    9. Amen, Matthias, 2006. "Cost-oriented assembly line balancing: Model formulations, solution difficulty, upper and lower bounds," European Journal of Operational Research, Elsevier, vol. 168(3), pages 747-770, February.
    10. Robert M. Nauss, 2003. "Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 249-266, August.
    11. Lin, Edward Y. H. & Bricker, Dennis L., 1996. "Computational comparison on the partitioning strategies in multiple choice integer programming," European Journal of Operational Research, Elsevier, vol. 88(1), pages 182-202, January.
    12. 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.
    13. R M Nauss, 2004. "The elastic generalized assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1333-1341, December.
    14. Throsby, C.D., 1973. "New Methodologies in Agricultural Production Economics: a Review," 1973 Conference, August 19-30, 1973, São Paulo, Brazil 181385, International Association of Agricultural Economists.
    15. Michael Brusco & Renu Singh & Douglas Steinley, 2009. "Variable Neighborhood Search Heuristics for Selecting a Subset of Variables in Principal Component Analysis," Psychometrika, Springer;The Psychometric Society, vol. 74(4), pages 705-726, December.
    16. Jeffrey Larson & Sven Leyffer & Prashant Palkar & Stefan M. Wild, 2021. "A method for convex black-box integer global optimization," Journal of Global Optimization, Springer, vol. 80(2), pages 439-477, June.
    17. Sun, Minghe, 2002. "The transportation problem with exclusionary side constraints and two branch-and-bound algorithms," European Journal of Operational Research, Elsevier, vol. 140(3), pages 629-647, August.
    18. Kim, Dong-Guen & Kim, Yeong-Dae, 2010. "A branch and bound algorithm for determining locations of long-term care facilities," European Journal of Operational Research, Elsevier, vol. 206(1), pages 168-177, October.
    19. Jeffery Kennington & Eli Olinick & Augustyn Ortynski & Gheorghe Spiride, 2003. "Wavelength Routing and Assignment in a Survivable WDM Mesh Network," Operations Research, INFORMS, vol. 51(1), pages 67-79, February.

    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:wly:navres:v:35:y:1988:i:1:p:73-84. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.