Proper efficiency and the theory of vector maximization

DOI10.1016/0022-247X(68)90201-1zbMATH Open0181.22806MaRDI QIDQ2534839FDOQ2534839

Authors: A. M. Geoffrion

Publication date: 1968

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

operations research

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Strictly Concave Parametric Programming, Part II: Additional Theory and Computational Considerations
Letter to the Editor—Improper Solutions of the Vector Maximum Problem

Cited In (only showing first 100 items - show all)

A notion of local proper efficiency in the Borwein sense in vector optimisation
Optimality and duality results for a nondifferentiable multiobjective fractional programming problem
Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
Proximal proper efficiency for minimisation with respect to normal cones
Multiobjective symmetric duality with invexity
Higher-Order Duality in Nondifferentiable Multiobjective Programming
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
Mixed type duality in multiobjective fractional programming under generalized \(\rho\)-univex function
Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
Algorithms for the vector maximization problem
Two methods for determining properly effcient solutions with a minimum upper bound for trade-offs
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
Multiobjective programming under generalized type I invexity
On the completeness and constructiveness of parametric characterizations to vector optimization problems
Strongly proper efficient solutions: efficient solutions with bounded trade-offs
Constrained optimization using multiple objective programming
Pre-invex functions in multiple objective optimization
Optimality Conditions and Duality for Multiobjective Control Problems
An interactive weighted Tchebycheff procedure for multiple objective programming
Multicriteria dynamic programming with an application to the integer case
Sufficient conditions and duality for a class of multiobjective fractional programming problems with higher-order \((F,\alpha ,\rho,d)\)-convexity
Efficiency and generalized convex duality for nondifferentiable multiobjective programs
On efficiency and duality for multiobjective programs
On multiple-objective optimization with generalized univexity
The maximization of a function over the efficient set via a penalty function approach
Unified representation of proper efficiency by means of dilating cones
Weak efficiency in multiobjective variational problems under generalized convexity
A note on global Pareto optimality in multicriteria optimization problems
Generalized convex functions and vector variational inequalities
Proper solutions of vector optimization problems
Proper efficiency in locally convex topological vector spaces
Vector variational inequality and vector pseudolinear optimization
Generalized convexity in multiobjective programming
Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity
A combined scalarizing method for multiobjective programming problems
Dynamic programming algorithms for the bi-objective integer knapsack problem
On nonsmooth multiobjective programming with generalized univexity
Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
An exact parallel method for a bi-objective permutation flowshop problem
Multiobjective fractional programming with generalized convexity
The weighted sum method for multi-objective optimization: new insights
Vector equilibrium problem and vector optimization
On approximating weakly/properly efficient solutions in multi-objective programming
Characterizations of the Benson proper efficiency for nonconvex vector optimization
On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
Optimality conditions for semivectorial bilevel convex optimal control problems
On \(G\)-invex multiobjective programming. I: Optimality
Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
Weakly efficient solutions and pseudoinvexity in multiobjective control problems
Optimization over the efficient set
An improved definition of proper efficiency for vector maximization with respect to cones
Proper efficiency with respect to cones
Super efficiency in vector optimization with nearly convexlike set-valued maps.
Optimality and duality for multiobjective nonsmooth programming
\(E\)-Benson proper efficiency in vector optimization
Superefficiency in vector optimization with nearly subconvexlike set-valued maps
Optimality criteria and duality in multiple-objective optimization involving generalized invexity
Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
Efficient solutions and bounds on tradeoffs
Scalarizations for adaptively solving multi-objective optimization problems
Vendor selection in outsourcing
Improved \(\varepsilon\)-constraint method for multiobjective programming
An algorithm for the bi-criterion integer programming problem
Mixed type duality in non-differentiable multi-objective fractional programming under generalised \((\phi, \rho)\)-univex function
Optimality and duality in nonsmooth multiobjective optimization involving generalized type I functions
On efficient solutions with trade-offs bounded by given values
A geometrical solution for quadratic bicriteria location models
Strong duality for proper efficiency in vector optimization
Second order symmetric duality in multiobjective programming
Stability for properly quasiconvex vector optimization problem
Optimality and duality for multiobjective fractional programming involving nonsmooth generalized \((\mathcal F, b, \phi, \rho, \theta)\)-univex functions
Mixed type duality for multiobjective variational problems with generalized (\(F\),\(\rho\))-convexity
Necessary conditions for super minimizers in constrained multiobjective optimization
Robust multiobjective optimization with application to Internet routing
Two phase algorithms for the bi-objective assignment problem
Robust ordinal regression
A survey of recent developments in multiobjective optimization
Existence of efficient and properly efficient solutions to problems of constrained vector optimization
\(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
Sufficiency and duality in nonsmooth multiobjective optimization involving generalized \((F,\alpha,\rho,d)\)-type I functions
Multicriteria scheduling problems: a survey
Second order symmetric duality in nondifferentiable multiobjective programming
Pseudolinearity and efficiency
An upper bound on properly efficient solutions in multiobjective optimization
Stability results for efficient solutions of vector optimization problems
Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps
Multiobjective fractional duality
On some multiobjective optimization problems arising in biology
Multi-objective vehicle routing problems
Robust multiobjective optimization \& applications in portfolio optimization
Existence results for strong vector equilibrium problems and their applications
Super Efficiency in Vector Optimization
Interactive \textsc{Nonconvex Pareto Navigator} for multiobjective optimization
OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
A revised simplex method for linear multiple objective programs
Efficiency and generalized convex duality for multiobjective programs
Optimality conditions for directionally differentiable multi-objective programming problems
An improved algorithm for solving biobjective integer programs

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)