A DISCRETE STOCHASTIC PROGRAMMING MODEL TO ESTIMATE OPTIMAL BURNING SCHEDULES ON RANGELAND

dc.creatorGaroian, Lee
dc.creatorConner, J. Richard
dc.creatorScifres, C.J.
dc.date2017-04-01T13:55:23Z
dc.date.accessioned2026-07-09T04:08:16Z
dc.descriptionMcCartney rose is a range management problem on 500,000 acres of rangeland in Texas. Roller chopping followed by burning is an effective method of improving infested rangeland. However, uncertainty associated with implementing effective burns adversely affects economic feasibility of the treatment sequence. Discrete stochastic programming is used to determine optimal burning schedules under uncertainty. Optimal schedules and expected net returns vary with changes in the probability of a successful burn.
dc.identifierdoi:10.22004/ag.econ.30208
dc.identifierhttps://ageconsearch.umn.edu/record/30208/files/19020053.pdf
dc.identifierhttp://ageconsearch.umn.edu/record/30208
dc.identifier.urihttp://hdl.handle.net/123456789/545378
dc.languageeng
dc.publisher
dc.sourcehttp://ageconsearch.umn.edu/record/30208
dc.titleA DISCRETE STOCHASTIC PROGRAMMING MODEL TO ESTIMATE OPTIMAL BURNING SCHEDULES ON RANGELAND
dc.typeText

Archivos