Fundamental theorems of nondominated solutions associated with cones in normed linear spaces

DOI10.1016/0022-247X(90)90195-LzbMath0711.90068MaRDI QIDQ922960

A. Charnes, Zhimin Huang, Quan-Ling Wei, William W. Cooper

Publication date: 1990

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

zbMATH Keywords

Fréchet differentiabilityconvex coneconstraint qualificationsregular pointnondominated solutionreal normed linear space

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Related Items

Quasiconcavity and nondominated solutions in multiobjective programming, Analyzing properties of \(K\)-cones in the generalized data envelopment analysis model., Using a Choquet integral-based approach for incorporating decision-maker's preference judgments in a data envelopment analysis model, Proper efficiency and cardinal utilities in multicriteria decision making, A bi-objective generalized data envelopment analysis model and point-to-set mapping projection, The generalized DEA model and the convex cone constrained game, Data envelopment analysis, Contributions of Professor William W. Cooper in operations research and management science, Cone concavity and multiple-payoff constrained \(n\)-person games, A generalized data envelopment analysis model: A unification and extension of existing methods for efficiency analysis of decision making units, Benson proper efficiency in the vector optimization of set-valued maps, Dominance stochastic models in data envelopment analysis, Construction of all DEA efficient surfaces of the production possibility set under the Generalized Data Development Analysis model, Optimality conditions for vector optimization problems of a difference of convex mappings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of multiobjective optimization
• Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions
• Goal programming and multiple objective optimizations. Part I
• A satisfactory treatment of equality and operator constraints in the Dubovitskii-Milyutin optimization formalism
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Cone ratio data envelopment analysis and multi-objective programming
• A unified theory of first and second order conditions for extremum problems in topological vector spaces
• On the intersections of cones and subspaces
• Convex Analysis