| Abstract: | 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. |
