Multiobjective control approximation problems: duality and optimality.
From MaRDI portal
Publication:1584032
DOI10.1023/A:1004622204554zbMath1050.90025MaRDI QIDQ1584032
Publication date: 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
90C29: Multi-objective and goal programming
90C46: Optimality conditions and duality in mathematical programming
49J53: Set-valued and variational analysis
Related Items
Duality for multiobjective optimization problems with convex objective functions and D.C. constraints, Generalized Lagrange function and generalized weak saddle points for a class of multiobjective fractional optimal control problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Determination of efficient solutions for point-objective locational decision problems
- Geometrical properties of the Fermat-Weber problem
- Approximation durch Lösungen partieller Differentialgleichungen
- Sets of efficient points in a normed space
- Finding efficient solutions for rectilinear distance location problems efficiently
- Duality for optimal control-approximation problems with gauges
- Efficiency in Euclidean constrained location problems
- Duality in vectorial control approximation problems with inequality restrictions
- Dualität und algorithmische anwendung beim vektoriellen standortproblem
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- Duality in vector optimization
- On duality in the vectorial control-approximation problem
- On some relations between a dual pair of multiple objective linear programs
- Generalization and sharpening of some duality relations for a class of vector optimization problems
- Location Theory, Dominance, and Convexity
