Abstract
We present a new linear-programming algorithm that is simple, effective, fully parallelizable, and immediately implementable on personal computers as well as on more sophisticated machines. Sufficient conditions are found that guarantee the convergence of the algorithm. Some applications are given showing that the applicability of the algorithm is actually wider than indicated by the theoretical results.
| Original language | English |
|---|---|
| Pages (from-to) | 125-129 |
| Number of pages | 5 |
| Journal | Applied Mathematics Letters |
| Volume | 2 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1989 |
Funding
This research was partially sponsored by the Office of Military Applications and the Office of Basic Energy Sciences, U.S. Department of Energy, under contract DE-AC05840R21400 with Martin Marietta Energy Systems, by DARPA, U.S. Department of Defense under Interagency Asrecmcnt DOE #186&A037-Al with Martin Marietta Energy Systems, and by an ORNL Postgraduate Research Appointment administered by Oak Ridge Associated Universities. We thank R. C. Mann and Y. Y. Azmy for their critical reading of the manuscript.