Calculation of Stability Radii for Combinatorial Optimization Problems

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results to the tolerance approach to sensitivity analysis.

MoreLess

Year of publication:	1997-01-01
Authors:	Chakravarti, N. ; Wagelmans, Wagelmans, A.P.M.
Institutions:	Faculteit der Economische Wetenschappen, Erasmus Universiteit Rotterdam
Subject:	binary programming \| computational complexity \| postoptimal analysis \| sensitivity analysis \| stability radius \| tolerance approach

More details

Extent:	application/pdf
Series:	Econometric Institute Research Papers. - ISSN 1566-7294.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series RePEc:ems:eureir Number EI 9740/A
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010731826