A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation

DOI10.2307/2582400zbMath0618.90088OpenAlexW4249903752MaRDI QIDQ3755247

Sang M. Lee, Richard L. Luebbe

Publication date: 1987

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582400

zbMATH Keywords

decision-makingredundant constraintsmultiple-objectivezero-one goal-programming

Mathematics Subject Classification ID

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

Related Items (9)

A review of goal programming and its applications ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ A comparison of genetic and conventional methods for the solution of integer goal programmes ⋮ Feature issue: Multiobjective programming and goal programming ⋮ Goal programming model: A glorious history and a promising future ⋮ A branch and bound algorithm for mixed zero-one multiple objective linear programming ⋮ A multicriteria decision-making approach to university resource allocations and information infrastructure planning ⋮ An interactive procedure for multiple objective integer linear programming problems

This page was built for publication: A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation