Utility function programs and optimization over the efficient set in multiple-objective decision making
From MaRDI portal
Publication:1356096
DOI10.1023/A:1022659523991zbMath0871.90072OpenAlexW1538432870MaRDI QIDQ1356096
Reiner Horst, Nguyen Van Thoai
Publication date: 9 October 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022659523991
branch-and-boundmultiple-objective optimization\(\varepsilon\)-approximate global solutionutility function program
Related Items
Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set, Holistic fleet optimization incorporating system design considerations, Computation of ideal and Nadir values and implications for their use in MCDM methods., Criteria and dimension reduction of linear multiple criteria optimization problems, Simplicially-constrained DC optimization over efficient and weakly efficient sets, Optimization over equilibrium sets∗, A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem, On optimization over the efficient set in linear multicriteria programming, Maximizing a linear fractional function on a Pareto efficient frontier, Solving Optimization Problems over the Weakly Efficient Set, Optimization over the efficient set of a parametric multiple objective linear programming problem, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Maximizing a concave function over the efficient or weakly-efficient set, Combination between global and local methods for solving an optimization problem over the efficient set, Global maximization of UTA functions in multi-objective optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An algorithm for optimizing over the weakly-efficient set
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Outer approximation by polyhedral convex sets
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Geometric algorithms and combinatorial optimization
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Handbook of global optimization
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- Introduction to global optimization
- New LP bound in multivariate Lipschitz optimization: Theory and applications
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Linearly constrained global minimization of functions with concave minorants
- Advances in multicriteria analysis
- A cutting plane algorithm for convex programming that uses analytic centers
- On the convergence of the method of analytic centers when applied to convex quadratic programs
- The Cutting-Plane Method for Solving Convex Programs
- Optimization over the efficient set using an active constraint approach
- A Potential Reduction Algorithm Allowing Column Generation
- Algorithms for the vector maximization problem
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Optimization over the efficient set
