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

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

A Concave Function Minimization Algorithm Under 0-1 Knapsack Constraint using Strong Valid Inequalities

유효 절단 부등식을 이용한 오목함수 0-1 배낭제약식 문제의 해법

  • Published : 1997.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

The aim of this paper is to develop the B & B type algorithms for globally minimizing concave function under 0-1 knapsack constraint. The linear convex envelope underestimating the concave object function is introduced for the bounding operations which locate the vertices of the solution set. And the simplex containing the solution set is sequentially partitioned into the subsimplices over which the convex envelopes are calculated in the candidate problems. The adoption of cutting plane method enhances the efficiency of the algorithm. These mean valid inequalities with respect to the integer solution which eliminate the nonintegral points before the bounding operation. The implementations are effectively concretized in connection with the branching stategys.

Keywords

References

  1. 대한산업공학회지 v.19 0-1 배낭 제약식을 갖는 오목함수 최소화 문제의 해법 오세호;정성진
  2. Naval Research Logistics Quarterly v.32 A finite Algorithm for Concave Minimization over a Polyhedron Benson, H. P.
  3. Naval Research Logistics Quarterly v.43 Deterministic Algorithms for Constrained Concave Minimization : A Unified Critical Survey Benson, H. P.
  4. Naval Research Logistics Quarterly v.37 A finite Algorithm for Concave Minimization over a Polyhedron Benson, H. P.;Erenguc, S.S.
  5. Math. Oper.Res. v.1 A Successive Underestimation Methods for Concave Minimization Problems Falk, J. E.;Hoffman, K L.
  6. Oper. Res. v.34 Concave Minimization via Collapsing Polytopes Falk, J. E.;Hoffman, K L.
  7. Management Sci. v.15 An Algorithm for Solving Separable Nonconvex Programming Falk, J. E.;Soland, R. M.
  8. Math. Programming v.20 A Method for Globally Minimizing Concave Functions over Convex Sets Hoffman, K.L.
  9. J. Optim. Theory Appl. v.51 A General Class of Branch-and-Bound Method in Global Optimization with Some New Approaches for Concave Minimization Horst, R.
  10. J. Optim. Theory Appl. v.58 Branch-and-Bound Methods for Solving Systems of Nonlinear Equations and Inequaltites Horst, R.;Thoai, N.V.
  11. Operations Research Letters v.7 On Finding the New Verices and Redundant Constraints in Cutting Plane Algorithms for Global Optimization Horst, R.;Thoai, N.V.;de Vries, J.
  12. Operations Research Letters v.5 Quadratic Functions with Exponential Number of Local Maxima Kalantari, B.
  13. Naval Research Logisitcs Quarterly v.37 An Algorithm for Quadratic Zero-One Programs Kalantari, B.;Bagchi, A.
  14. J. Optim. Theory Appl. v.48 Construction of Large-Scale Global Minimum Concave Quadratic Test Problems Kalantari, B.;Rosen, J.B.
  15. Operations Research Letters v.2 A Branch and Bound Algorithm for a Class of Nonlinear Knapsack Problem Mathur, K.;Salkin, H. M.
  16. Math. Prog. v.49 On the solution of concave knapsack Problem More, J. J.;Vavasis, S.A.
  17. Integer and Combinatorial Optimzation Nemhauser, G.L.;Wolsey, L.A.
  18. Math. Prog. v.46 An Algorithm for a Singly Constrained Class of Quadratic Programs Subject to upper and lower Bounds Pardalos, P. M.;Kovddr, N.
  19. Soviet Math. Dokl. v.5 Concave Programming Under Liner Constraints Tuy, H.