MICROCOMPUTER ACCURACY IN SOLVING LINEAR PROGRAMMING PROBLEMS WITH REDUNDANT CONSTRAINTS

Alvaro Soler and Earl I. Fuller

No 13722, Staff Papers from University of Minnesota, Department of Applied Economics

Abstract: This study reports on how different microcomputer systems performed in the solution of two linear programming models purposely specified with redundant vectors. Comparisons were made to a Cyber 720 that used both a Fortran and Basic version of the same primal-dual algorithm. Results are mixed. But Microsoft Basic with double precision under CP/M on a Z80A processor performed at least equally well to the Cyber 720 provided that an appropriate essential zero value was specified. Different coefficient scaling schemes were also tested. The results should be of interest to all users of matrix inversion schemes on microcomputers. Extensions of the study to new hardware and software systems are encouraged.

Keywords: Research; Methods/Statistical; Methods (search for similar items in EconPapers)
Pages: 12
Date: 1986
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://ageconsearch.umn.edu/record/13722/files/p86-30.pdf (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:umaesp:13722

DOI: 10.22004/ag.econ.13722

Access Statistics for this paper

More papers in Staff Papers from University of Minnesota, Department of Applied Economics Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search ().