일반화된 일반상한제약을 갖는 이차원 선형계획 배낭문제 연구

Abstract

We study on a generalization of the two dimensional linear programming knapsack problem with the extended GUB constraint, which was presented in paper Won(2001). We identify some new parametric properties of the generalized problem and derive a solution algorithm based on the identified parametric properties. The solution algorithm has a worst case time complexity of order O(), where n is the total number of variables. We illustrate a numerical example.