Equivalence of balance points and Pareto solutions in multiple-objective programming
From MaRDI portal
Recommendations
Cited in
(24)- Geometric methods to solve max-ordering location problems
- Pareto analysis vis-à-vis balance space approach in multiobjective global optimization
- Box-triangular multiobjective linear programs for resource allocation with application to load management and energy market problems.
- The balance space approach in optimization with Riesz spaces valued objectives. An application to financial markets.
- Min-max formulation of the balance number in multiobjective global optimization.
- The balance space approach to multicriteria decision making -- involving the decision maker.
- Orthogonality in multiobjective optimization
- Balance space in airport construction: Application to the North Sea island option for Schiphol Airport
- Optimizing a linear fractional function over the integer efficient set
- Balance set and Pareto solutions in linear space with application to ongoing optimal resource allocation, investment planning, production, and control problems with multiple objectives
- Radial solutions and orthogonal trajectories in multiobjective global optimization
- Interactive balance space approach for solving multi-level multi-objective programming problems
- Instability and refinement of models in long term planning of large scale projects
- Saddle points and Pareto points in multiple objective programming
- Optimization over equilibrium sets∗
- An indefinite quadratic optimization over an integer efficient set
- Multiple objective programming with piecewise linear functions
- Characteruzation of pareto optimal points in problems with mult-eqality constraints
- On the choice of special Pareto points
- Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
- Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.
- Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software
- Sensitivity of Pareto solutions in multiobjective optimization
- Sensitivity in multiobjective optimization: The generalized envolvent theorem
This page was built for publication: Equivalence of balance points and Pareto solutions in multiple-objective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364227)
