A branch and bound algorithm with constraint partitioning for integer goal programming problems
From MaRDI portal
Publication:1141085
DOI10.1016/0377-2217(80)90194-0zbMath0436.90104MaRDI QIDQ1141085
Publication date: 1980
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(80)90194-0
branch and bound algorithm; multiobjective decision making; variable elimination; partitioning algorithm; integer goal programming; constraint partitioning; linear goal programming
91B06: Decision theory
90C10: Integer programming
90C31: Sensitivity, stability, parametric optimization
Related Items
A review of goal programming and its applications, Nonlinear goal programming theory and practice: A survey