Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

On a Two Dimensional Linear Programming Knapsack Problem with the Extended GUB Constrain

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

  • Won, Joong-Yeon (Department of Industrial Engineering, Kyonggi University)
  • 원중연 (경기대학교 첨단산업공학부)
  • Received : 19990500
  • Accepted : 20001200
  • Published : 2001.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

We present a two dimensional linear programming knapsack problem with the extended GUB constraint. The presented problem is an extension of the cardinality constrained linear programming knapsack problem. We identify some new properties of the problem and derive a solution algorithm based on the parametric analysis for the knapsack right-hand-side. The solution algorithm has a worst case time complexity of order O($n^2logn$). A numerical example is given.

Keywords