Proper efficiency and the theory of vector maximization
From MaRDI portal
Publication:2534839
Recommendations
- Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem
- Proper Efficiency in Convex Vector Minimum Problems
- Generalized Proper Efficiency in Multiobjective Programming
- On efficient sets in vector maximum problems - A brief survey
- On the notion of proper efficiency in vector optimization
Cites work
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 3225772 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- scientific article; zbMATH DE number 3078986 (Why is no real title available?)
- Letter to the Editor—Improper Solutions of the Vector Maximum Problem
- Strictly Concave Parametric Programming, Part II: Additional Theory and Computational Considerations
Cited in
(only showing first 100 items - show all)- A note on global Pareto optimality in multicriteria optimization problems
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Necessary conditions for super minimizers in constrained multiobjective optimization
- Generalized convex functions and vector variational inequalities
- Proper solutions of vector optimization problems
- A revised simplex method for linear multiple objective programs
- On nonsmooth multiobjective programming with generalized univexity
- An improved definition of proper efficiency for vector maximization with respect to cones
- Vendor selection in outsourcing
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- Multiobjective fractional duality
- Optimality conditions for semivectorial bilevel convex optimal control problems
- Proper efficiency with respect to cones
- On efficiency and duality for multiobjective programs
- Algorithms for the vector maximization problem
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- On some multiobjective optimization problems arising in biology
- Two methods for determining properly effcient solutions with a minimum upper bound for trade-offs
- Stability for properly quasiconvex vector optimization problem
- An algorithm for the bi-criterion integer programming problem
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Strongly proper efficient solutions: efficient solutions with bounded trade-offs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- Interactive \textsc{Nonconvex Pareto Navigator} for multiobjective optimization
- On \(G\)-invex multiobjective programming. I: Optimality
- Proper efficiency in locally convex topological vector spaces
- Robust multiobjective optimization with application to Internet routing
- Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
- Constrained optimization using multiple objective programming
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- Higher-Order Duality in Nondifferentiable Multiobjective Programming
- Vector variational inequality and vector pseudolinear optimization
- An exact parallel method for a bi-objective permutation flowshop problem
- Optimality and duality for multiobjective fractional programming involving nonsmooth generalized \((\mathcal F, b, \phi, \rho, \theta)\)-univex functions
- Weakly efficient solutions and pseudoinvexity in multiobjective control problems
- Mixed type duality in non-differentiable multi-objective fractional programming under generalised \((\phi, \rho)\)-univex function
- Multiobjective fractional programming with generalized convexity
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces
- Optimization over the efficient set
- Sufficiency and duality in nonsmooth multiobjective optimization involving generalized \((F,\alpha,\rho,d)\)-type I functions
- Optimality and duality in nonsmooth multiobjective optimization involving generalized type I functions
- Optimality and duality for multiobjective nonsmooth programming
- Second order symmetric duality in nondifferentiable multiobjective programming
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- Multi-objective vehicle routing problems
- The weighted sum method for multi-objective optimization: new insights
- Pre-invex functions in multiple objective optimization
- A notion of local proper efficiency in the Borwein sense in vector optimisation
- \(E\)-Benson proper efficiency in vector optimization
- Vector equilibrium problem and vector optimization
- Existence results for strong vector equilibrium problems and their applications
- Efficient solutions and bounds on tradeoffs
- Mixed type duality in multiobjective fractional programming under generalized \(\rho\)-univex function
- Pseudolinearity and efficiency
- Two phase algorithms for the bi-objective assignment problem
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- On multiple-objective optimization with generalized univexity
- Optimality Conditions and Duality for Multiobjective Control Problems
- On efficient solutions with trade-offs bounded by given values
- Robust ordinal regression
- Mixed type duality for multiobjective variational problems with generalized (\(F\),\(\rho\))-convexity
- A geometrical solution for quadratic bicriteria location models
- Multicriteria scheduling problems: a survey
- The maximization of a function over the efficient set via a penalty function approach
- Generalized convexity in multiobjective programming
- An interactive weighted Tchebycheff procedure for multiple objective programming
- A survey of recent developments in multiobjective optimization
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- Strong duality for proper efficiency in vector optimization
- On approximating weakly/properly efficient solutions in multi-objective programming
- Robust multiobjective optimization \& applications in portfolio optimization
- Second order symmetric duality in multiobjective programming
- Existence of efficient and properly efficient solutions to problems of constrained vector optimization
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity
- Multiobjective programming under generalized type I invexity
- Unified representation of proper efficiency by means of dilating cones
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- Scalarizations for adaptively solving multi-objective optimization problems
- Multicriteria dynamic programming with an application to the integer case
- Stability results for efficient solutions of vector optimization problems
- Proximal proper efficiency for minimisation with respect to normal cones
- Optimality and duality results for a nondifferentiable multiobjective fractional programming problem
- Sufficient conditions and duality for a class of multiobjective fractional programming problems with higher-order \((F,\alpha ,\rho,d)\)-convexity
- An upper bound on properly efficient solutions in multiobjective optimization
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- A combined scalarizing method for multiobjective programming problems
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
- Multiobjective symmetric duality with invexity
- Weak efficiency in multiobjective variational problems under generalized convexity
- Efficiency and generalized convex duality for nondifferentiable multiobjective programs
- Super Efficiency in Vector Optimization
- scientific article; zbMATH DE number 7546024 (Why is no real title available?)
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
- Pareto optimality in multiobjective problems
This page was built for publication: Proper efficiency and the theory of vector maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2534839)