Maximal and supremal tolerances in multiobjective linear programming

► We consider stability of efficiency in multiobjective linear programming problems. ► We compute maximal tolerances for perturbations of objective function coefficients. ► We show that the problem is NP-hard, the method is exponential in the worst case. ► We extend the united tolerance to individua...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 228; no. 1; pp. 93 - 101
Main Authors:	Hladík, Milan, Sitarz, Sebastian
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.07.2013 Elsevier Elsevier Sequoia S.A
Subjects:	Algorithms Efficient solution Linear programming Mathematical functions Multiobjective linear programming Sensitivity analysis Studies Tolerance analysis Transportation problem (Operations research) Tolerance analysis Sensitivity analysis Multiobjective linear programming Efficient solution
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!