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-10-09
Authors:	Chakravarti, Nilotpal ; Wagelmans, Albert P.M.
Institutions:	Tinbergen Institute
Subject:	stability radius \| sensitivity analysis \| postoptimal analysis \| tolerance approach \| binary programming \| computational complexity

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Tinbergen Institute Discussion Papers.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series Tinbergen Institute Discussion Papers Number 97-106/4
Source:	RePEc - Research Papers in Economics

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