A logistical build-up problem solved by a hybrid M.I.P. — Algorithm

A certain case of a logistical build-up of stocks of critical articles for an army operation is discussed. A general model is presented and the particular structure studied. the model describes a general mixed integer linear programming problem. Constraints are mainly due to time limitations, limited capacities of transportation capabilities, the required amount articles and human implications such as training, specialization and psychological factors. Costs are optimized. A simplified subproblem is treated numerically to illustrate the application of the algorithm. The solution is given by means of hybrid cutting-plane — branch and bound algorithm.