A characterization of weakly efficient points
From MaRDI portal
Recommendations
- Characterization of solutions of multiobjective optimization problem
- Characterization of weakly efficient points
- scientific article; zbMATH DE number 1788231
- Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
- Characterizations of efficient sets by constrained objectives
Cites work
- Finding all efficient extreme points for multiple objective linear programs
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- Note—Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming
- Proper efficiency and the theory of vector maximization
Cited in
(35)- Invex functions and generalized convexity in multiobjective programming
- Efficiency and generalized concavity
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- On efficient solutions in vector optimization
- Characterizations of efficient points in convex vector optimization problems
- Balance set and Pareto solutions in linear space with application to ongoing optimal resource allocation, investment planning, production, and control problems with multiple objectives
- Another approach to multiobjective programming problems with \(F\)-convex functions
- The controlled estimation method in the multiobjective linear fractional problem
- Retrieval and use of the balance set in multiobjective global optimization
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- Free disposal hull condition to verify when efficiency coincides with weak efficiency
- A survey of recent developments in multiobjective optimization
- Characterization of solutions of multiobjective optimization problem
- An \(\eta\)-approximation method in nonlinear vector optimization
- A combined scalarization method for multi-objective optimization problems
- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
- AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
- Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives
- A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
- Characterization of weakly efficient points
- On the existence of efficient points
- scientific article; zbMATH DE number 1314933 (Why is no real title available?)
- scientific article; zbMATH DE number 1328997 (Why is no real title available?)
- scientific article; zbMATH DE number 2070520 (Why is no real title available?)
- scientific article; zbMATH DE number 1788231 (Why is no real title available?)
- scientific article; zbMATH DE number 2123491 (Why is no real title available?)
- Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
- scientific article; zbMATH DE number 2208687 (Why is no real title available?)
- Generalized convexity in multiobjective programming
- Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.
- Duality in nondifferentiable vector programming
- Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software
- A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with G-invex functions
- Optimality conditions and DC-Dinkelbach-type algorithm for vector fractional programming problems with ratios of difference of convex functions
- On the set of weakly efficient minimizers for convex multiobjective programming
This page was built for publication: A characterization of weakly efficient points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804360)
