Linear programming on a micro - The case of the Apple II
type: Item
instance of: scholarly article
title: Linear programming on a micro - The case of the Apple II
zbMATH Open document ID: 0552.90061
DOI: 10.1016/0377-2217(85)90174-2
author: L. Peter Jennergren
published in: European Journal of Operational Research
publication date: 1985-01-01T00:00:00Z
review text: The feasibility of solving LP problems on an Apple II is explored. The maximal size of problems that can be solved is found to be around 50 constraints and 100 variables. Run times may be over 12 hours in interpreted Applesoft BASIC and over one hour in compiled Applesoft BASIC. Numerical stability is somewhat problematic. Nonetheless, the conclusion is that nicely scaled problems can be solved on the Apple II.
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 3880434
zbMATH Keywords: microcomputers
zbMATH Keywords: Apple II
MaRDI profile type: Publication
full work available at URL: 0377-2217(85)90174-2
OpenAlex ID: W2089759763
cites work: Q5630824
description: scientific article; zbMATH DE number 3880434