Efficiency in multiple objective optimization problems
From MaRDI portal
Publication:4136958
DOI10.1007/BF01593807zbMath0362.90092OpenAlexW1970285178MaRDI QIDQ4136958
No author found.
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01593807
Related Items (38)
Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications ⋮ Efficiency in Multi-Objective Fractional Functional Programming ⋮ An approximate strong KKT condition for multiobjective optimization ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ Scalarizations for adaptively solving multi-objective optimization problems ⋮ Strong duality for infinite-dimensional vector-valued programming problems ⋮ Second-order optimality conditions for multiobjective optimization whose order induced by second-order cone ⋮ An approximation method for the efficiency set of multiobjective programming problems ⋮ An exact approach for the minimum-cost bounded-error calibration tree problem ⋮ An improved definition of proper efficiency for vector maximization with respect to cones ⋮ On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization ⋮ Advancing equitability in multiobjective programming ⋮ On solving bi-objective constrained minimum spanning tree problems ⋮ Differential games with nonzero sum (cooperative variant) ⋮ Admissible points of a convex polyhedron ⋮ Duality theory for maximizations with respect to cones ⋮ Ein Verfahren zur interaktiven Lösung nichtlinearer Vektoroptimierungsprobleme ⋮ Designing communication networks for distributed control agents. ⋮ Inverse multi-objective combinatorial optimization ⋮ Second-order optimality conditions for cone constrained multi-objective optimization ⋮ Retrieval and use of the balance set in multiobjective global optimization ⋮ Robust multiobjective optimization with application to Internet routing ⋮ A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem ⋮ Geometric programming approach to an interactive fuzzy inventory problem ⋮ Multiple-objective programming with polynomial objectives and constraints ⋮ Linear complementarity problems and multiple objective programming ⋮ Variable preference modeling with ideal-symmetric convex cones ⋮ Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors. ⋮ Unnamed Item ⋮ A generalized additive, categorical model in data envelopment analysis ⋮ A graphical characterization of the efficient set for convex multiobjective problems ⋮ Existence of efficient solutions for vector maximization problems ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ Efficiency in integral facility design problems ⋮ Decision making under uncertainty: A semi-infinite programming approach ⋮ Efficiency and proper efficiency in vector maximization with respect to cones ⋮ On efficient sets in vector maximum problems - A brief survey ⋮ Optimization over the efficient set: Four special cases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Proper efficiency and the theory of vector maximization
- Ordinary convex programs without a duality gap
- The Vector Maximization Problem: Proper Efficiency and Stability
- Finding all efficient extreme points for multiple objective linear programs
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Geometric programming: A unified duality theory for quadratically constrained quadratic programs and 𝑙_{𝑝}-constrained 𝑙_{𝑝}-approximation problems
- Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs)
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
This page was built for publication: Efficiency in multiple objective optimization problems
