A new algorithm for linear programming that is easy to implement: Application to the transportation problem

Technical Report · Thu Sep 01 00:00:00 EDT 1988

OSTI ID:6757631

Culioli, J C; Protopopescu, V

We propose a new algorithm for linear-programming and apply it to solve some transportation problems. We prove the convergence of the algorithm under reasonable sufficient conditions. The main motivation of this new linear-programming solver is its extreme simplicity and its parallel structure which allows for straightforward implementations on personal computers as well as on more sophisticated machines. We give in the Appendix a version of the algorithm programmed in C in less than 30 lines. We also comment in the Appendix on the relationship of our algorithm with some models of neural networks. 14 refs., 10 figs.

• Research Organization: Oak Ridge National Lab., TN (USA)
• DOE Contract Number: AC05-84OR21400
• OSTI ID: 6757631
• Report Number(s): ORNL/TM-10929; CESAR-88/52; ON: DE89001330
• Country of Publication: United States
• Language: English

Related Subjects

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION
320200 -- Energy Conservation
Consumption
& Utilization-- Transportation
99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
COMPUTERS
CONVERGENCE
DIGITAL COMPUTERS
LINEAR PROGRAMMING
MATHEMATICAL LOGIC
MICROCOMPUTERS
PERSONAL COMPUTERS
PROGRAMMING
TRANSPORTATION SYSTEMS