 Goal ProgrammingPete Bettinger
Chapter Chapter 4 in Forest Harvest Scheduling, 2025, pp 99-114 from Springer Abstract: Abstract Goal programming is a special extension of linear and mixed integer programming whereby deviations from goals are minimized within an objective function. Thus, in these types of management problems, goals of perhaps very diverse outcomes of forest management (wood production, wildlife, aesthetics, structural conditions, economic value, etc.) and their desired level of achievement need to be defined prior to the application of this problem-solving method. Therefore, one distinct difference between goal programming and straightforward linear or mixed integer programming is the ability of goal programming to recognize these (and other) different types of management outcomes in the objective function of a problem formulation. Further, the goal outcomes can be normalized if their range of measurements is distinctly different. Even further, weights can be devised to force the achievement of certain goals during certain periods of time at the expense, perhaps, of other goals. Keywords: Goal attainment; Normalization; Linear programming; Mixed integer programming (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sptchp:978-3-031-89432-9_4 Ordering information: This item can be ordered from DOI: 10.1007/978-3-031-89432-9_4 Access Statistics for this chapter More chapters in Springer Texts in Business and Economics from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.