Approximation of the efficient point set by perturbation of the ordering cone
DOI10.1007/BF01415907zbMath0737.90051OpenAlexW2058062420MaRDI QIDQ4713649
Publication date: 25 June 1992
Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01415907
vector optimizationstructural optimizationscalarizationordering coneefficient pointsperturbed problemsoptimal design of stiffened platesreference point algorithm
Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Optimization problems in solid mechanics (74P99) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (7)
Cites Work
- An interactive algorithm for nonlinear vector optimization
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- An improved definition of proper efficiency for vector maximization with respect to cones
- A cone separation theorem
- Proper efficiency with respect to cones
- The structure of admissible points with respect to cone dominance
- Scalarizing vector optimization problems
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximation of the efficient point set by perturbation of the ordering cone