일반연속 다중선택 선형배낭문제의 효율적인 해법연구

An Efficient Algorithm for the Generalized Continuous Multiple Choice linear Knapsack Problem

  • 원중연 (경기대학교 산업공학과)
  • 투고 : 19970400
  • 발행 : 1997.12.31

초록

We consider a generalized problem of the continuous multiple choice knapsack problem and study on the LP relaxation of the candidate problems which are generated in the branch and bound algorithm for solving the generalized problem. The LP relaxed candidate problem is called the generalized continuous multiple choice linear knapsack problem and characterized by some variables which are partitioned into continuous multiple choice constraints and the others which only belong to simple upper bound constraints. An efficient algorithm of order O($n^2logn$) is developed by exploiting some structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

키워드