Determination of satisfying and efficient solutions in convex multi-objective programming

DOI10.1080/02331939608844204zbMath0866.90100OpenAlexW2040834938MaRDI QIDQ5689833

No author found.

Publication date: 20 July 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939608844204

zbMATH Keywords

efficient solutionsmultiple objective programmingnonlinear convex goal programming

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Related Items (7)

Goal programming to evaluate the profile of the most profitable insurers: an application to the Spanish insurance industry ⋮ Experiments with classification-based scalarizing functions in interactive multiobjective optimization ⋮ An additive achievement scalarizing function for multiobjective programming problems ⋮ Multiple objectives decomposition-coordination methods for hierarchical organizations ⋮ Meta-goal programming ⋮ An application of multiobjective programming to the study of workers' satisfaction in the Spanish labour market ⋮ Lexicographic improvement of the target values in convex goal programming

Uses Software

• nag

Cites Work

• Theory of multiobjective optimization
• More test examples for nonlinear programming codes
• Unnamed Item
• Unnamed Item

This page was built for publication: Determination of satisfying and efficient solutions in convex multi-objective programming