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 tothe tolerance approach to sensitivity analysis.

MoreLess

Year of publication:	1997
Authors:	Chakravarti, Nilotpal ; Wagelmans, Albert P.M.
Publisher:	Amsterdam and Rotterdam : Tinbergen Institute
Subject:	Mathematische Optimierung \| Theorie \| 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

Series:	Tinbergen Institute Discussion Paper ; 97-106/4
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	787851264 [GVK] hdl:10419/85514 [Handle] RePEc:dgr:uvatin:19970106 [RePEc]
Source:	EconStor

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