DOI QR코드

DOI QR Code

The Cardinality Constrained Multi-Period Linear Programming Knapsack Problem

선수제약 다기간 선형계획 배낭문제

  • Won, Joong-Yeon (Department of Industrial and Management Engineering, Kyonggi University)
  • 원중연 (경기대학교 산업경영공학과)
  • Received : 2015.08.26
  • Accepted : 2015.11.26
  • Published : 2015.12.31

Abstract

In this paper, we present a multi-period 0-1 knapsack problem which has the cardinality constraints. Theoretically, the presented problem can be regarded as an extension of the multi-period 0-1 knapsack problem. In the multi-period 0-1 knapsack problem, there are n jobs to be performed during m periods. Each job has the execution time and its completion gives profit. All the n jobs are partitioned into m periods, and the jobs belong to i-th period may be performed not later than in the i-th period, i = 1, ${\cdots}$, m. The total production time for periods from 1 to i is given by $b_i$ for each i = 1, ${\cdots}$, m, and the objective is to maximize the total profit. In the extended problem, we can select a specified number of jobs from each of periods associated with the corresponding cardinality constraints. As the extended problem is NP-hard, the branch and bound method is preferable to solve it, and therefore it is important to have efficient procedures for solving its linear programming relaxed problem. So we intensively explore the LP relaxed problem and suggest a polynomial time algorithm. We first decompose the LP relaxed problem into m subproblems associated with each cardinality constraints. Then we identify some new properties based on the parametric analysis. Finally by exploiting the special structure of the LP relaxed problem, we develop an efficient algorithm for the LP relaxed problem. The developed algorithm has a worst case computational complexity of order max[$O(n^2logn)$, $O(mn^2)$] where m is the number of periods and n is the total number of jobs. We illustrate a numerical example.

Keywords

References

  1. Campello, R.E. and Maculan, N.F., Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints : properties and algorithms. Discrete Applied Mathematics, 1987, Vol. 18, No. 2, pp. 119-136. https://doi.org/10.1016/0166-218X(87)90015-1
  2. Dudzinski, K. and Walukiewicz, S., On the multiperiod binary knapsack problem. Bulletin of the Polish Academy of Sciences Technical Sciences, 1985, Vol. 33, pp. 85-91.
  3. Dudzinski, K., On a cardinality constrained linear programming knapsack problem. Operations Research letters, 1989, Vol. 8, No. 4, pp. 215-218. https://doi.org/10.1016/0167-6377(89)90063-1
  4. Faaland, B.H., The multiperiod knapsack problem. Operations Research, 1981, Vol. 29, pp. 612-616. https://doi.org/10.1287/opre.29.3.612
  5. Lin, E. and Wu, C., The multiple-choice multi-period knapsack problem. Journal of the Operational Research Society, 2004, Vol. 55, pp. 187-197. https://doi.org/10.1057/palgrave.jors.2601661
  6. Won, J.Y., On a two dimensional linear programming knapsack problem with the extended GUB constraint. Journal of the Korean Institute of Industrial Engineers, 2001, Vol. 27, No. 1, pp. 25-29.
  7. Won, J.Y., The generalized continuous multiple-choice linear knapsack problem with generalized lower bound constraints. Journal of Society of Korea Industrial and Systems Engineering, 1998, Vol. 21, No. 45, pp. 291-299.