Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
From MaRDI portal
Publication:1758029
DOI10.1007/s11590-011-0315-1zbMath1254.90207OpenAlexW2129552587MaRDI QIDQ1758029
Publication date: 7 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0315-1
Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29)
Related Items (28)
Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients ⋮ Robust optimal solutions in interval linear programming with forall-exists quantifiers ⋮ Generation of some methods for solving interval multi-objective linear programming models ⋮ On strong optimality of interval linear programming ⋮ Unnamed Item ⋮ Manifestation of interval uncertainties for fractional differential equations under conformable derivative ⋮ Robust optimality analysis of non-degenerate basic feasible solutions in linear programming problems with fuzzy objective coefficients ⋮ A survey of interval algorithms for solving multicriteria analysis problems ⋮ An ensemble framework for assessing solutions of interval programming problems ⋮ Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides ⋮ Various approaches to multiobjective linear programming problems with interval costs and interval weights ⋮ Compromising solution of geometric programming problem with bounded parameters ⋮ How to determine basis stability in interval linear programming ⋮ Multiobjective interval linear programming in admissible-order vector space ⋮ Maximal inner boxes in parametric \textit{AE}-solution sets with linear shape ⋮ Checking weak and strong optimality of the solution to interval convex quadratic program ⋮ Newton method to obtain efficient solutions of the optimization problems with interval-valued objective functions ⋮ On highly robust efficient solutions to uncertain multiobjective linear programs ⋮ A Newton method for capturing efficient solutions of interval optimization problems ⋮ Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs ⋮ Parametric functional representation of interval number with arithmetic operations ⋮ A quasi-Newton method with rank-two update to solve interval optimization problems ⋮ New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach ⋮ Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem ⋮ Finding efficient solutions in the interval multi-objective linear programming models ⋮ A note on dependency between interval linear systems ⋮ Maximal and supremal tolerances in multiobjective linear programming ⋮ Some results in interval multiobjective linear programming for recognizing different solutions
Cites Work
- Unnamed Item
- Unnamed Item
- Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
- An interactive method of tackling uncertainty in interval multiple objective linear programming
- Multiple objective linear programming models with interval coefficients -- an illustrated overview
- Linear optimization and extensions.
- Portfolio selection problem with interval coefficients
- Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999
- Solutions for the portfolio selection problem with interval and fuzzy coefficients
- Possible and necessary optimality tests in possibilistic linear programming problems
- Generalized linear fractional programming under interval uncertainty
- A survey of recent developments in multiobjective optimization
- Encyclopedia of Optimization
- Computing the tolerances in multiobjective linear programming
- Linear Multiple Objective Problems with Interval Coefficients
- Linear Programming with Inexact Data is NP‐Hard
- Computing the norm ∥A∥∞,1 is NP-hard∗
- Multicriteria Optimization
- Linear Optimization Problems with Inexact Data
This page was built for publication: Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
