Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
