Towards finding global representations of the efficient set in multiple objective mathematical programming
From MaRDI portal
Publication:4346866
DOI<47::AID-NAV3>3.0.CO;2-M 10.1002/(SICI)1520-6750(199702)44:1<47::AID-NAV3>3.0.CO;2-MzbMath0882.90116OpenAlexW2085967379MaRDI QIDQ4346866
Serpil Sayın, Harold P. Benson
Publication date: 5 August 1997
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199702)44:1<47::aid-nav3>3.0.co;2-m
Related Items (23)
Bilevel programming for generating discrete representations in multiobjective optimization ⋮ Representation of the non-dominated set in biobjective discrete optimization ⋮ Unnamed Item ⋮ Adjacency based method for generating maximal efficient faces in multiobjective linear programming ⋮ On the quality of discrete representations in multiple objective programming ⋮ On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods ⋮ Global search perspectives for multiobjective optimization ⋮ A reference point-based evolutionary algorithm for approximating regions of interest in multiobjective problems ⋮ Generating equidistant representations in biobjective programming ⋮ Norm-based approximation in multicriteria programming. ⋮ Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems ⋮ Quasi-Newton methods for multiobjective optimization problems ⋮ Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ Discrete representation of non-dominated sets in multi-objective linear programming ⋮ A regression study of the number of efficient extreme points in multiple objective linear programming ⋮ A radial boundary intersection aided interior point method for multi-objective optimization ⋮ Application of Evolutionary Algorithms for Solving Multi-Objective Simulation Optimization Problems ⋮ Hybrid approach for solving multiple-objective linear programs in outcome space ⋮ A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level ⋮ Outcome space partition of the weight set in multiobjective linear programming ⋮ Approximation methods in multiobjective programming ⋮ \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
This page was built for publication: Towards finding global representations of the efficient set in multiple objective mathematical programming
