On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise

Algorithmica ◽  
1993 ◽  
Vol 9 (2) ◽  
pp. 184-197 ◽  
Author(s):  
Robert A. Bosch ◽  
Kurt M. Anstreicher
Keyword(s):  
Linear Programming ◽  
Programming Algorithm ◽  
Potential Reduction ◽  
Linear Programming Algorithm

scholarly journals A linear programming algorithm to test for jamming in hard-sphere packings

2004 ◽  
Vol 197 (1) ◽  
pp. 139-166 ◽  
Author(s):  
Aleksandar Donev ◽  
Salvatore Torquato ◽  
Frank H. Stillinger ◽  
Robert Connelly
Keyword(s):  
Linear Programming ◽  
Hard Sphere ◽  
Programming Algorithm ◽  
Sphere Packings ◽  
Linear Programming Algorithm

scholarly journals The treatment of optimizing container transportation dynamic programming and planning

2019 ◽  
Vol 135 ◽  
pp. 02016
Author(s):  
Elena Korchagina ◽  
Andrey Bochkarev ◽  
Pavel Bochkarev ◽  
Sergey Barykin ◽  
Svetlana Suvorova
Keyword(s):  
Mathematical Model ◽  
Dynamic Programming ◽  
Linear Programming ◽  
Numerical Calculation ◽  
Optimal Strategy ◽  
Programming Algorithm ◽  
Container Transportation ◽  
Dynamic Planning ◽  
Railway Freight ◽  
Linear Programming Algorithm

The article addresses the treatment of applying the method of dynamic linear programming to solve the task of choosing the optimal strategy for the containers dispatch, taking into account the significant unevenness of loading and shipment of containers. The optimizing container transportation dynamic planning could be treated as mathematical model of the dynamic multi-period task of the loaded containers shipment, which allows the choice of the optimal strategy for sending containers, taking into account the significant unevenness of their loading and dispatch from the railway freight station. The efficiency of considered method is proved by numerical calculation being presented to disclose the dynamic linear programming algorithm implementing to solve the problem.

Sign in / Sign up

Export Citation Format

Share Document