A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization

DOI10.1287/opre.35.3.365zbMath0637.90089OpenAlexW2021919197MaRDI QIDQ3778562

G. V. Loganathan, Hanif D. Sherali

Publication date: 1987

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.35.3.365

zbMATH Keywords

multiobjective optimizationcutting planesbest-compromise solutionnonconvex feasible regionsefficient near-optimal solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50)

Related Items (10)

Unified interactive multiple objective programming ⋮ Method of forces for direction finding in interactive multicriterion optimization applications ⋮ An interactive method for multiple-objective mathematical programming problems ⋮ A cutting-plane method to nonsmooth multiobjective optimization problems ⋮ Nonlinear multiple objective optimization: An algorithm and some theory ⋮ A comparative study of interactive tradeoff cutting plane methods for MOMP ⋮ Interactive stability cutting-plane algorithm for multiobjective nonlinear programming problems ⋮ Interactive multiple objective optimization: Survey. I: Continuous case ⋮ Comparative studies in interactive multiple objective mathematical programming ⋮ An interactive interior point algorithm for multiobjective linear programming problems

This page was built for publication: A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization