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)

• Interactive fuzzy decision making for multiobjective nonlinear programming using augmented minimax problems
• Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity
• Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
• Higher-order duality in vector optimization over cones
• A duality approach for a class of semivectorial bilevel programming problems
• An interactive multiobjective nonlinear programming procedure
• Duality for multiobjective variational problems with invexity
• Decomposition of multiple criteria mathematical programming problems by dynamic programming
• On matroids with multiple objectives
• Interactive multiple objective optimization: Survey. I: Continuous case
• 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
• Goal programming with linear fractional criteria
• Interactive algorithms for multiple criteria nonlinear programming problems
• Duality for multiobjective variational problems
• Vector-valued lagrangian and multiobjective fractional programming duality
• Multiple-objective programming with polynomial objectives and constraints
• Proximal proper saddle points in set-valued optimization
• On multiple objective programming problems with set functions
• Generalized type I invexity and duality in multiobjective variational problems
• Proper D-solutions of multiobjective programming problems with set functions
• Lagrangian function and duality theory in multiobjective programming with set functions
• Duality theory for infinite-dimensional multiobjective linear programming
• Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives
• The domination property for efficiency in locally convex spaces
• Duality in vector optimization
• Quasimin and quasisaddlepoint for vector optimization
• Higher-order cone-pseudoconvex, quasiconvex and other related functions in vector optimization
• Generalized \((\mathcal F,\alpha , \rho , \theta )\)-\(d\)-\(V\)-univex functions and non-smooth alternative theorems
• Value functions, domination cones and proper efficiency in multicriteria optimization
• Stochastic versus possibilistic programming
• Compromise solutions, domination structures, and Salukvadze's solution
• Nonscalarized multiobjective global optimization
• A saddle-point characterization of Pareto optima
• Multiobjective management of mining under water hazard by game theory
• Title not available (Why is that?)
• Linear complementarity problems and multiple objective programming
• Duality in geometric vector optimization
• Duality and weak efficiency in vector variational problems
• Fuzzy programming and the Pareto optimal set
• Efficiency and proper efficiency in vector maximization with respect to cones
• Properly efficient and efficient solutions for vector maximization problems in Euclidean space
• Characterization of properly efficient solutions by generalized scalarization methods
• Optimality conditions in nonconical multiple objective programming
• Integrating a bi-objective paradigm to tolerance optimization
• A characterization of weakly efficient points
• Multiobjective Fractional Duality Forn-Set Functions
• Fuzzy convexity and multiobjective convex optimization problems
• On multiobjective nonlinear programming with support functions
• Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
• Title not available (Why is that?)
• The range of the efficient frontier in multiple objective linear programming
• Sufficiency in nonsmooth multiobjective programming involving generalized \(( F, \rho\) )-convexity
• Efficiency in multiple objective optimization problems
• Scalarization of Henig proper efficient points in a normed space
• Multicriteria planar location problems
• Generalized convex duality for multiobjective fractional programs
• Multiobjective duality with invexity
• Hartley proper efficiency in multifunction optimization
• Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
• Multiobjective, preference-based search in acyclic OR-graphs
• Superefficiency in local convex spaces
• Pareto optimality in multiobjective problems
• Proper Efficiency and Multiobjective Duality in Nonlinear Programming
• Duality for a Class of Nondifferentiable Multiple Objective Programming Problems
• Weighting factor results in vector optimization
• Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method
• Global efficiency for multiobjective bilevel programming problems under generalized invexity
• An equivalent transformation of multi-objective optimization problems
• An analysis of some dual problems in multiobjective optimization (I)
• On Benson's scalarization in multiobjective optimization
• Title not available (Why is that?)
• On the characterization of noninferior solutions of the vector optimization problem
• Duality for Multiobjective Variational Problems With Pseudo-Invexity
• On the Fritz John saddle point problem for differentiable multiobjective optimization
• 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
• Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
• The equilibria of a multiple objective game
• A reference direction approach to multiple objective quadratic-linear programming
• A multiobjective optimization framework for optimal selection of supplier portfolio
• Scalarization in vector optimization
• A cooperative fuzzy game theoretic approach to multiple objective design optimization
• Direct theorems in semi-infinite convex programming
• Symmetric duality for a class of multiobjective fractional programming problems.
• The effects of adding objectives to an optimisation problem on the solution set
• Optimality and duality for multiobjective fractional programming involving \(n\)-set functions
• Multi-scenario multi-objective optimization with applications in engineering design
• Weak efficiency for multiobjective variational problems.
• Multi-choice multi-objective mathematical programming model for integrated production planning: a case study
• Optimality and duality in multiobjective fractional programming involving \(\rho\)-semilocally type I-preinvex and related functions
• Linear multiple objective programs with zero–one variables
• Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
• A remark on multiobjective stochastic optimization via strongly convex functions
• An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
• Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
• Robustness in nonsmooth nonlinear multi-objective programming
• An exact algorithm for biobjective mixed integer linear programming 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)