Multi-objective optimization over convex disjunctive feasible sets using reference points

DOI10.1016/0377-2217(95)00323-1zbMath0922.90122OpenAlexW2014273115MaRDI QIDQ1278716

Irena T. Yordanova-Markova, Boyan S. Metev

Publication date: 5 May 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00323-1

zbMATH Keywords

reference pointsdisjunctive feasible setmultiple objective optimization problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Cites Work

• An interactive multiobjective nonlinear programming procedure
• An interactive algorithm for nonlinear vector optimization
• Interactive multiple objective optimization: Survey. I: Continuous case
• An algorithm of internal feasible directions for linear integer programming
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• Use of reference points for solving MONLP problems
• Aspiration based decision support systems. Theory, software and applications
• An interactive procedure for multiple objective integer linear programming problems
• Use of reference points of MOLP problems analysis
• Reference point approximation method for the solution of bicriterial nonlinear optimization problems
• Multicriteria optimization in engineering and in the sciences
• Use of exact penalty functions to determine efficient decisions
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multi-objective optimization over convex disjunctive feasible sets using reference points