Linear programming on a micro - The case of the Apple II
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.
scientific article; zbMATH DE number 3880434