Linear Programming with Mathematica

Michael Carter

No 263763, Department of Economics Discussion Papers from University of Canterbury - New Zealand

Abstract: We exploit the symbolic manipulation capability of Mathematica to elucidate the simplex algorithm of linear programming clearly and intuitively. We then develop a set of tools for conducting sensitivity analysis of the optimal solution. In order to utilize Mathematica's efficient linear programming routine, we develop a function which can deduce the final tableau from the Spartan output of ConstrainedMax. This final tableau contains all the information usually provided by a good linear programming package, which can than be explored using the techniques of sensitivity analysis developed in the paper. This enables the package to be applied to a substantive problem, relying on Mathematica's native code for intensive computation. To illustrate, we apply the package to analyse a classic problem in efficient nutrition.

Keywords: Research; Methods/Statistical; Methods (search for similar items in EconPapers)
Pages: 66
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ageconsearch.umn.edu/record/263763/files/canterbury-nz-079.pdf (application/pdf)
https://ageconsearch.umn.edu/record/263763/files/c ... 9.pdf?subformat=pdfa (application/pdf)

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:ags:canzdp:263763

DOI: 10.22004/ag.econ.263763

Access Statistics for this paper

More papers in Department of Economics Discussion Papers from University of Canterbury - New Zealand Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search ().