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