On duality in the vectorial control-approximation problem
From MaRDI portal
Publication:3978455
DOI10.1007/BF01417520zbMath0744.90078OpenAlexW2159283875MaRDI QIDQ3978455
Publication date: 25 June 1992
Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01417520
Continuous location (90B85) Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)
Related Items (7)
Kolmogorov-conditions for vectorial approximation problems ⋮ Vector variational inequality and its duality ⋮ Some deterministic and random vector equilibrium problems ⋮ Duality in vectorial control approximation problems with inequality restrictions ⋮ Properly efficient solutions for vectorial norm approximation ⋮ Generalization and sharpening of some duality relations for a class of vector optimization problems ⋮ Multiobjective control approximation problems: duality and optimality.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sets of efficient points in a normed space
- Strong duality for infinite-dimensional vector-valued programming problems
- Finding efficient solutions for rectilinear distance location problems efficiently
- Proper efficiency and the theory of vector maximization
- Znr yektoriellen linearen tschebyscheff-approximation
- Dualität und algorithmische anwendung beim vektoriellen standortproblem
- Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
- Duality for Multiple Objective Convex Programs
- Proper Efficient Points for Maximizations with Respect to Cones
- A note on Fermat's problem
This page was built for publication: On duality in the vectorial control-approximation problem
