Premium
Goal programming with dynamic goals
Author(s) -
Caballero Rafael,
Gómez Trinidad,
González Mercedes,
Rey Lourdes,
Ruiz Francisco
Publication year - 1998
Publication title -
journal of multi‐criteria decision analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.462
H-Index - 47
eISSN - 1099-1360
pISSN - 1057-9214
DOI - 10.1002/(sici)1099-1360(199807)7:4<217::aid-mcda187>3.0.co;2-m
Subject(s) - dynamic programming , lexicographical order , mathematical optimization , goal programming , computer science , basis (linear algebra) , scalar (mathematics) , scheme (mathematics) , value (mathematics) , mathematics , machine learning , mathematical analysis , geometry , combinatorics
The aim of this paper is to present a dynamic goal programming scheme. Throughout the revised literature, most of the dynamic goal programming approaches use target values on the final value of the objective functionals. In this paper, dynamic target values are assumed, so that they control not only the final values of the corresponding functionals, but their evolution along the planning period. As a result, the scalar problems are also dynamic ones, where the evolution of the deviation variables is minimized. A lexicographic dynamic goal programming algorithm is developed on these basis, and some considerations are made on the efficiency of the final solutions. © 1998 John Wiley & Sons, Ltd.