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...

Celý popis

Podrobná bibliografia

Vydané v:	Optimization letters Ročník 6; číslo 5; s. 893 - 899
Hlavný autor:	Hladík, Milan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer-Verlag 01.06.2012
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!