EconPapers    
Economics at your fingertips  
 

Nearly Optimal Linear Programming Solutions: Some Conceptual Issues and a Farm Management Application

Robert O. Burton, James S. Gidley, Barton S. Baker and Kimberly J. Reda-Wilson

American Journal of Agricultural Economics, 1987, vol. 69, issue 4, 813-818

Abstract: Nearly optimal solutions in linear programming provide useful information to decision makers. Modeling to generate alternatives may be used to generate a set of nearly optimal solutions from which a decision maker may select the desired solution by considering criteria not quantified in the model. The mathematical problem is to find vertices of a convex polytope. A pivoting method of vertex enumeration is used to generate all extreme-point nearly optimal solutions of an example problem involving selection of a marketing strategy for beef calves. Compared to the optimal solution, nearly optimal solutions have more diversity or use less cash or hired labor.

Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.2307/1242192 (application/pdf)
Access to full text is restricted to subscribers.

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:oup:ajagec:v:69:y:1987:i:4:p:813-818.

Access Statistics for this article

American Journal of Agricultural Economics is currently edited by Madhu Khanna, Brian E. Roe, James Vercammen and JunJie Wu

More articles in American Journal of Agricultural Economics from Agricultural and Applied Economics Association Contact information at EDIRC.
Bibliographic data for series maintained by Oxford University Press ().

 
Page updated 2025-03-19
Handle: RePEc:oup:ajagec:v:69:y:1987:i:4:p:813-818.