Quasiconcavity and nondominated solutions in multiobjective programming
From MaRDI portal
Publication:1908651
DOI10.1007/BF02192029zbMath0842.90103MaRDI QIDQ1908651
Publication date: 4 March 1996
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
multiobjective programmingquasi-concavityPareto-optimal solutionsnondominated solutionsdominance cones
Related Items (6)
Existence of solutions for generalized vector quasi-equilibrium problems ⋮ Intervening duality and bargaining with a farmer-landowner example. ⋮ Cone concavity and multiple-payoff constrained \(n\)-person games ⋮ Benson proper efficiency in the vector optimization of set-valued maps ⋮ Dominance stochastic models in data envelopment analysis ⋮ Generalized connected functions with respect to cones
Cites Work
- Unnamed Item
- Polyhedral cone-ratio DEA models with an illustrative application to large commercials banks
- Fundamental theorems of nondominated solutions associated with cones in normed linear spaces
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Nine kinds of quasiconcavity and concavity
- Generalization of domination structures and nondominated solutions in multicriteria decision making
- Determination of the portfolio selection for a property-liability insurance company
- Proper efficiency and cardinal utilities in multicriteria decision making
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- A note on the relationships between convexity and invexity
- Quasi-Concave Programming
- Cone extremal solutions of multi-payoff games with cross-constrained strategy sets
- Mathematical programming problems with quasi-convex objective functions
This page was built for publication: Quasiconcavity and nondominated solutions in multiobjective programming
