Linear Programming

Pete Bettinger
Additional contact information
Pete Bettinger: University of Georgia

Chapter Chapter 2 in Forest Harvest Scheduling, 2025, pp 39-81 from Springer

Abstract: Abstract Linear programming is a method for solving problems that are described with an objective function and a set of constraints, where each is represented by a linear equation. The problem, in other words, is represented by equations free of non-linear constraints and integer assignment requirements. Forest harvest scheduling efforts are able to employ linear programming if the model system can be described in a manner consistent with the four assumptions of these types of problems (divisibility, certainty, proportionality, and additivity). Often, linear programming is employed to examine strategic forest planning alternatives that span long time frames and large areas, but these conditions are not necessary to use the problem-solving method. In this chapter, the problem-solving ability of linear programming is described along with a few examples of applications aimed at forest management.

Keywords: Objective function; Resource constraints; Accounting rows; Policy constraints; Simplex method; Slack; Dual price; Shadow price; Reduced cost (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sptchp:978-3-031-89432-9_2

Ordering information: This item can be ordered from
http://www.springer.com/9783031894329

DOI: 10.1007/978-3-031-89432-9_2

Access Statistics for this chapter

More chapters in Springer Texts in Business and Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().