Towards finding global representations of the efficient set in multiple objective mathematical programming
From MaRDI portal
Publication:4346866
DOI10.1002/(SICI)1520-6750(199702)44:1%3C47::AID-NAV3%3E3.0.CO;2-MzbMATH Open0882.90116OpenAlexW2085967379MaRDI QIDQ4346866FDOQ4346866
Authors: Harold P. Benson, Serpil Sayın 
Publication date: 5 August 1997
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199702)44:1%3C47::aid-nav3%3E3.0.co;2-m
Recommendations
- On parametric representations of the efficient set of multiple objective mathematical programming problems
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- A representation of the set of feasible objectives in multiple objective linear programs
- On Efficient Solutions to Multiple Objective Mathematical Programs
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
Cited In (26)
- Application of Evolutionary Algorithms for Solving Multi-Objective Simulation Optimization Problems
- Bilevel programming for generating discrete representations in multiobjective optimization
- 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
- On parametric representations of the efficient set of multiple objective mathematical programming problems
- On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods
- A radial boundary intersection aided interior point method for multi-objective optimization
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems
- Combining discrete and continuous information for multi-criteria optimization problems
- Representation of the non-dominated set in biobjective discrete optimization
- Hybrid approach for solving multiple-objective linear programs in outcome space
- On the quality of discrete representations in multiple objective programming
- Generating equidistant representations in biobjective programming
- 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
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming
- Norm-based approximation in multicriteria programming.
- A reference point-based evolutionary algorithm for approximating regions of interest in multiobjective problems
- Approximation methods in multiobjective programming
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- Global search perspectives for multiobjective optimization
- Outcome space partition of the weight set in multiobjective linear programming
- Retrieval and use of the balance set in multiobjective global optimization
- Quasi-Newton methods for multiobjective optimization problems
- Title not available (Why is that?)
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
This page was built for publication: Towards finding global representations of the efficient set in multiple objective mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4346866)
