Characterizing the nondominated set by separable functions
From MaRDI portal
Publication:1093551
DOI10.1007/BF00940308zbMath0628.90077OpenAlexW2091078743MaRDI QIDQ1093551
Publication date: 1988
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00940308
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Some characterizations of the optimal solutions of a vector optimization problem
- An improved definition of proper efficiency for vector maximization with respect to cones
- Compromise solutions and estimation of the noninferior set
- Proper efficiency with respect to cones
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- Characterization of properly efficient solutions by generalized scalarization methods
- Compromise solutions, domination structures, and Salukvadze's solution
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- Vector maximization with two objective functions
- Proper efficiency and the theory of vector maximization
- Note on the mean-square strategy for vector-valued objective functions
- Optimization of vector functionals. I. The programming of optimal trajectories
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Scalarization in vector optimization
- Proper Efficient Points for Maximizations with Respect to Cones
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- State Constraints in Convex Control Problems of Bolza
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Technical Note—Parametric Solution of a Class of Nonconvex Programs
- A Class of Solutions for Group Decision Problems
This page was built for publication: Characterizing the nondominated set by separable functions
