Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

The Maximin Linear Programming Knapsack Problem With Extended GUB Constraints

확장된 일반상한제약을 갖는 최대최소 선형계획 배낭문제

  • Published : 2001.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we consider a maximin version of the linear programming knapsack problem with extended generalized upper bound (GUB) constraints. We solve the problem efficiently by exploiting its special structure without transforming it into a standard linear programming problem. We present an O(n$^3$) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.

Keywords

References

  1. European Journal of Operational Research v.89 LP relaxation of the Two Dimensional Knapsack Problem with Box and GUB constraints Bagchi, A.;Bhattacharyya, N.;Chakravarti, N.
  2. Discrete Applied Mathematics v.18 Lagrangean Relaxation for a Lower Bound to a Set Partitioning Problem with Side Constraints: Properties and Algorithms Campello, R.E.;Maculan, N.F.
  3. Operations Research Letters v.8 On a Cardinality Constrained Linear Programming Knapsack Problem Dudzinski, K.
  4. European Journal of Operational Research v.28 Exact Methods for the Knapsack Problem and its Generalizations Dudzinski, K.;Walukiewicz, S.
  5. Mathematical Programming v.29 An O(n) Algorithm for the Multiple-Choice Knapsack Linear Program Dyer, M.E.
  6. Mathematical Programming v.29 An O(nlogn) algorithm for the LP Knapsacks with GUB Constraints Glover, F.;Klingman, D.
  7. Operations Research v.22 Applications of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation Kaplan, S.
  8. Algorithms: Their Complexities and Efficiency Kronsjo, L.I.
  9. European Journal of Operational Research v.83 A Minimal Algorithm for the Multiple-Choice Knapsack Problem Pisinger, D.
  10. Journal of the Korean OR/MS Society v.22 An O(n²logn) Algorithm for the Linear Knapsack Problem with SUB and Extended GUB Constraints Won, J.Y.
  11. Journal of the Korean Institute of Industrial Engineers v.27 On a Two Dimensional Linear Programming Knapsack Problem with the Extended GUB constraint Won, J.Y.
  12. Information Processing Letters v.18 An O(n) Algorithm for the Linear Multiple-Choice Knapsack Problem and Related Problems Zemel, E.