Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization

  • Research Paper
  • Published:
4OR Aims and scope Submit manuscript

Abstract

This paper deals with stability analysis in multi-objective combinatorial optimization problems. The stability radius of an efficient solution is defined as the maximal adjustment of the problem parameters such that this solution remains efficient. An algorithm based on inverse optimization is proposed to compute it. The adjustment is limited to the coefficients of the objective functions and measured by the Chebyshev norm. This approach is applied to randomly generated instances of the bi-objective knapsack problem and computational results are reported. Several illustrative examples are analyzed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Chakravartia N, Wagelmansb APM (1998) Calculation of stability radius for combinatorial optimization. Oper Res Lett 23(1):1–7

    Article  Google Scholar 

  • Coffin M, Saltzman MJ (2000) Statistical analysis of computational tests of algorithms and heuristics. INFORMS J Comput 12(1):24–44

    Article  Google Scholar 

  • Ehrgott M (2005) Multicriteria optimization, 2nd edn. Springer, Berlin

    Google Scholar 

  • Emelichev VA, Kuzmin KG (2006) Stability radius of an efficient solution of a vector problem of integer linear programming in the gölder metric. Cybern Syst Anal 42(4):609–614

    Article  Google Scholar 

  • Emelichev VA, Podkopaev D (2010) Quantitative stability analysis for vector problems of 0–1 programming. Discret Optim 7(1–2):48–63

    Article  Google Scholar 

  • Emelichev VA, Kuz’min KG, Leonovich AM (2004) Stability in the combinatorial vector optimization problems. Autom Remote Control 65(2):227–240

    Article  Google Scholar 

  • Kellerer H, Pferschy U, Pisinger D (1994) Knapsack problems. Springer, Berlin

    Google Scholar 

  • Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester

    Google Scholar 

  • Pisinger D (1995) Algorithms for knapsack problems. PhD thesis, Department of Computer Science, University of Copenhagen, Denmark

  • Roland J, De Smet Y, Rui Figueira J (2011) The inverse multi-objective 0,1-knapsack problem under the chebyshev distance. Technical report TR/SMG/2011-002, SMG, CoDE, Université Libre de Bruxelles, Brussels

  • Steuer RE (1986) Multiple criteria optimization: theory, computation and application. Wiley, New York

    Google Scholar 

  • Wendell RE, Lee DN (1977) Efficiency in multiple objective optimization problems. Math Program 12(1):406–414

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Julien Roland.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Roland, J., Smet, Y.D. & Figueira, J.R. On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization. 4OR-Q J Oper Res 10, 379–389 (2012). https://doi.org/10.1007/s10288-012-0215-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-012-0215-y

Keywords

Mathematics Subject Classification (2000)

Navigation