Hybrid approach for solving multiple-objective linear programs in outcome space
From MaRDI portal
Publication:1265035
DOI10.1023/A:1022628612489zbMath0908.90224OpenAlexW30280826MaRDI QIDQ1265035
Publication date: 28 February 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022628612489
Related Items (14)
A combined scalarizing method for multiobjective programming problems ⋮ ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS ⋮ A Benson type algorithm for nonconvex multiobjective programming problems ⋮ Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem ⋮ Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning ⋮ An approximation algorithm for convex multi-objective programming problems ⋮ Constructing efficient solutions structure of multiobjective linear programming ⋮ Approximating the nondominated set of an MOLP by approximately solving its dual problem ⋮ Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case ⋮ Outcome space partition of the weight set in multiobjective linear programming ⋮ Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program ⋮ The adaptive parameter control method and linear vector optimization ⋮ Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving multiple objective linear programs in objective space
- Constructing the set of efficient objective values in multiple objective linear programs
- Theory of multiobjective optimization
- On efficient sets in vector maximum problems - A brief survey
- Analysis of the objective space in multiple objective linear programming
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- Multiobjective programming and planning
- Using efficient feasible directions in interactive multiple objective linear programming
- A simplified MOLP algorithm: The MOLP-S procedure
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Linear multiobjective programming
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Generating all maximal efficient faces for multiple objective linear programs
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
- Finding all maximal efficient faces in multiobjective linear programming
- Determination of the efficient set in multiobjective linear programming
- Handbook of global optimization
- Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- Multiple Objective Linear Programming with Parametric Criteria Coefficients
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- Solving multiobjective programming problems by discrete representation
- Multiple Objective Linear Programming with Interval Criterion Weights
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Finding all efficient extreme points for multiple objective linear programs
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- On the Determination of Minimal Facets and Edges of a Polyhedral Set
- Algorithms for the vector maximization problem
- Convex Analysis
This page was built for publication: Hybrid approach for solving multiple-objective linear programs in outcome space
