Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
type: Item
instance of: scholarly article
title: Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
zbMATH Open document ID: 1254.90207
author: Milan Hladík
published in: Optimization Letters
publication date: 2012-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6102929
zbMATH Keywords: multiobjective linear programming
zbMATH Keywords: interval matrix
zbMATH Keywords: efficient solution
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: s11590-011-0315-1
OpenAlex ID: W2129552587
cites work: Linear Multiple Objective Problems with Interval Coefficients
cites work: A survey of recent developments in multiobjective optimization
cites work: Multicriteria Optimization
cites work: Linear Optimization Problems with Inexact Data
cites work: Encyclopedia of Optimization
cites work: Computing the tolerances in multiobjective linear programming
cites work: Generalized linear fractional programming under interval uncertainty
cites work: Portfolio selection problem with interval coefficients
cites work: Solutions for the portfolio selection problem with interval and fuzzy coefficients
cites work: Possible and necessary optimality tests in possibilistic linear programming problems
cites work: Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
cites work: Multiple objective linear programming models with interval coefficients -- an illustrated overview
cites work: An interactive method of tackling uncertainty in interval multiple objective linear programming
cites work: Linear optimization and extensions.
cites work: Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999
cites work: Linear Programming with Inexact Data is NP‐Hard
cites work: Computing the norm ∥A∥∞,1 is NP-hard∗
cites work: Q4221106
cites work: Q4546409
DOI: 10.1007/S11590-011-0315-1
description: scientific article; zbMATH DE number 6102929