Abstract: In this paper we study the problem of multi-item capacitated lot-sizing from the point of commercial
enterprises. We consider profit as the main criteria. This dynamic problem belongs to the class of discrete
optimization and contains boolean variables, algorithmic objective function, where various types of constraints
such as analytical functions, algorithmic and simulation models can be used. We present model and direct search
algorithm that consists of an intelligent iterative search and upper bound set construction, and allows finding
exact solution in reasonable time. We carry out computational investigation and solve a real task with using
developed computational tool to show the efficiency and practical application of the proposed model and
algorithm.
Keywords: direct search; discrete optimization; upper bound; production planning; multi-item capacitated lotsizing;
profit maximization
ACM Classification Keywords: G.1.6 Optimization; J.0 Computer Applications
Link:
APPLICATION OF DISCRETE OPTIMIZATION IN SOLVING A PROBLEM
OF MULTI-ITEM CAPACITATED LOT-SIZING WITH ECONOMIC OBJECTIVES
Igor Kononenko, Igor Protasov
http://foibg.com/ibs_isc/ibs-13/ibs-13-p23.pdf
Wiki
(1.00/10)
