Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
From MaRDI portal
Recommendations
- New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach
- Some results in interval multiobjective linear programming for recognizing different solutions
- Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
- Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem
- Solving interval and fuzzy multi objective linear programming problem by necessarily efficiency points
Cites work
- A survey of recent developments in multiobjective optimization
- An interactive method of tackling uncertainty in interval multiple objective linear programming
- Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999
- Computing the norm ∥A∥∞,1 is NP-hard∗
- Computing the tolerances in multiobjective linear programming
- Encyclopedia of Optimization
- Generalized linear fractional programming under interval uncertainty
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1784659 (Why is no real title available?)
- Linear Multiple Objective Problems with Interval Coefficients
- Linear optimization and extensions.
- Linear Optimization Problems with Inexact Data
- Linear Programming with Inexact Data is NP‐Hard
- Multicriteria Optimization
- Multiple objective linear programming models with interval coefficients -- an illustrated overview
- Portfolio selection problem with interval coefficients
- Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
- Possible and necessary optimality tests in possibilistic linear programming problems
- Solutions for the portfolio selection problem with interval and fuzzy coefficients
Cited in
(30)- On strong optimality of interval linear programming
- Compromising solution of geometric programming problem with bounded parameters
- 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
- Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem
- On highly robust efficient solutions to uncertain multiobjective linear programs
- Generation of some methods for solving interval multi-objective linear programming models
- An ensemble framework for assessing solutions of interval programming problems
- Multiobjective interval linear programming in admissible-order vector space
- Checking weak and strong optimality of the solution to interval convex quadratic program
- New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach
- A note on dependency between interval linear systems
- Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients
- How to determine basis stability in interval linear programming
- Maximal and supremal tolerances in multiobjective linear programming
- Some results in interval multiobjective linear programming for recognizing different solutions
- Manifestation of interval uncertainties for fractional differential equations under conformable derivative
- Robust optimal solutions in interval linear programming with forall-exists quantifiers
- Finding efficient solutions in the interval multi-objective linear programming models
- Newton method to obtain efficient solutions of the optimization problems with interval-valued objective functions
- A Newton method for capturing efficient solutions of interval optimization problems
- Using necessarily weak efficient solutions for solving a biobjective transportation problem with fuzzy objective functions coefficients
- 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
- 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
- Maximal inner boxes in parametric \textit{AE}-solution sets with linear shape
- Absolute value linear programming
- Tolerance analysis in linear programming: searching for lower and upper bounds
This page was built for publication: Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758029)
