Go to main content
Did you know? By making a gift to AgEcon Search, you are helping ensure that our small non-profit continues to provide free full-text access to 15,000 visitors a day from 170+ countries
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS

Files

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.

Details

PDF

Statistics

from
to
Export
Download Full History