Complexity of necessary efficiency in interval linear programming and multiobjective linear programming

We present some complexity results on checking necessary efficiency in interval multiobjective linear programming. Supposing that objective function coefficients perturb within prescribed intervals, a feasible point x * is called necessarily efficient if it is efficient for all instances of interval...

Full description

Bibliographic Details

Published in:	Optimization letters Vol. 6; no. 5; pp. 893 - 899
Main Author:	Hladík, Milan
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer-Verlag 01.06.2012
Subjects:	Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation Interval matrix Multiobjective linear programming Efficient solution NP-completeness
ISSN:	1862-4472, 1862-4480
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!