An Iterative Approach to Goal Programming
Jerald P. Dauer, Robert J. Krueger
Abstract
Jerald P. Dauer, Robert J. Krueger
Abstract
An iterative approach is developed for solving general goal programming problems. This approach is then used to solve several nonlinear examples, including an integer solution problem. A dual for linear goal programming problems is developed and sensitivity analysis is discussed. Several new advances in modeling with goal programming which are made possible with this iterative approach are presented, namely least squares attainability of goals and priority dependent constraints.
OpenAlex reports 76 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An iterative approach is developed for solving general goal programming problems. This approach is then used to solve several nonlinear examples, including an integer solution problem. A dual for linear goal programming problems is developed and sensitivity analysis is discussed. Several new advances in modeling with goal programming which are made possible with this iterative approach are presented, namely least squares attainability of goals and priority dependent constraints.
Key concepts: Mathematical optimization, Computer science, Goal programming, Integer programming, Constraint programming, Linear programming, Project management, Iterative method