Browse > Article
http://dx.doi.org/10.15207/JKCS.2019.10.11.071

An Concave Minimization Problem under the Muti-selection Knapsack Constraint  

Oh, Se-Ho (Division of BT Convergence, Cheongju University)
Publication Information
Journal of the Korea Convergence Society / v.10, no.11, 2019 , pp. 71-77 More about this Journal
Abstract
This paper defines a multi-selection knapsack problem and presents an algorithm for seeking its optimal solution. Multi-selection means that all members of the particular group be selected or excluded. Our branch-and-bound algorithm introduces a simplex containing the feasible region of the original problem to exploit the fact that the most tightly underestimating function on the simplex is linear. In bounding operation, the subproblem defined over the candidate simplex is minimized. During the branching process the candidate simplex is splitted into two one-less dimensional subsimplices by being projected onto two hyperplanes. The approach of this paper can be applied to solving the global minimization problems under various types of the knapsack constraints.
Keywords
Branch-And-Bound; Concave minimization; Knapsack; Muti-selection; Simplex;
Citations & Related Records
Times Cited By KSCI : 4  (Citation Analysis)
연도 인용수 순위
1 R. Horst. (1986). A General Class of Branch-and-bound Methods in Global Optimization with Some New Approachs for Concave Minimization. J. Optim. Theory Appl. 51, 271-291.   DOI
2 B. Kalantari & A. Bagchi. (1990). An Algorithm for Quadratic Zero-One Programs. Naval Research Logistics Quarterly, 37, 527-538.   DOI
3 J. J. More & S. A. Vavasis. (1991). On the Solution of Concave Knapsack Problem. Math. Prog. 49, 397-411.   DOI
4 X. L. Sun, F. L. Wang & L. Li. (2005). Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition Method. Journal of Global Optimization. 33, 15-30.   DOI
5 T. V. Tieu. (1978). Convergent Algorithms for Minimizing a Concave Function. Acta Mathematica Vietnamica. 5, 106-113.
6 J. E. Falk & K. R. Hoffman. (1976). A Successive Underestimation Method for Concave Minimization Problems. Math. Opns. Res. 1, 251-259.   DOI
7 R. M. Soland. (1974). Optimal Facility Location with Concave Costs. Opns. Res. 22, 373-382.   DOI
8 H. P. Benson. (1996). Deterministic Algorithms for Constrained Concave Minimization: A Unified Critical Survey. Naval Research Logistics Quarterlyl. 43, 756-795.
9 J. K. Hong. (2017). Review on Security Communication Environment in Intelligent Vehicle Transport System. Journal of Convergence for Information Technology. 7(6), 97-102.   DOI
10 Y. S. Jeong, Y. T. Kim & G. C. Park. (2018). User Privacy management model using multiple group factor based on Block chain. Journal of Convergence for Information Technology. 8(5), 107-113.   DOI
11 S. H. Oh. (2018). A Branch-and-Bound Algorithm for Concave Minimization Problem with Upper Bounded Variables. International Journal of Engineering Technology. 7(2), Sp Is 12, 333-337.   DOI
12 S. H. Oh & H. Dho. (2014). An Algorithm for Globally Minimization of a Linearly Constrained Concave Function over a Parallelepiped. European Journal of Scientific Research, 123(4), 404-411.
13 H. P. Benson. (1985). A Finite Algorithm for Concave Minimization over a Polyhedron. Naval Research Logistics Quarterly. 32, 165-177.   DOI
14 M. W. Choi. (2018). A Study on the Equity of Regulation in Advertising, Journal of Digital Convergence, 16(11), 275-280.   DOI
15 B. Kalantari & J. B. Rosen. (1987). An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions. Math. Opns. Res. 12, 544-560.   DOI
16 E. M. Yang, H. J. Lee & C. H. Seo. (2017). Comparison of Detection Performance of Intrusion Detection System Using Fuzzy and Artificial Neural Network. Journal of Digital Convergence. 15(6), 391-398.   DOI
17 H. Tui. (1964). Concave Programming under Linear Constraints. Dok. Akad. Nauk SSSR 159, 32-35, Translated 1964 in Soviet Math. Dokl. 4, 1437-1440.