Approximation of the efficient point set by perturbation of the ordering cone

DOI10.1007/BF01415907zbMath0737.90051MaRDI QIDQ4713649

Siegfried Helbig

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)

zbMATH Keywords

vector optimization; structural optimization; scalarization; ordering cone; efficient points; perturbed problems; optimal design of stiffened plates; reference point algorithm

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C29: Multi-objective and goal programming

74P99: Optimization problems in solid mechanics

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Geoffrion proper efficiency in an infinite dimensional space, On the density of proper efficient points, Stability in disjunctive linear optimization I: continuity of the feasible set, Scalarizations for adaptively solving multi-objective optimization problems, Norm-based approximation in multicriteria programming., Approximation methods in multiobjective programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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