43. Multi-product Supply Planning for Combat Units in Battlefield Environment

The multi-product supply planning problem is investigated in the battlefield environment. The practical quantity of the products consumed by the combat units is stochastic, while the supplying process is also uncertain because of the random loss caused by attacks from the enemy. A nonlinear programming model is proposed to optimize the problem with both uncertain demand and supply consideration, and a solution algorithm based on Lagrangian relaxation is developed to obtain the optimal solution. Randomly generated examples involving 10, 100 and 1,000 commodities respectively are solved by the proposed algorithm. The computational performance of the algorithm is analyzed, which shows that the proposed algorithm can obtain optimal solutions for all examples with different sizes in short time.