| Abstract |
In this article, we discuss an exact algorithm for mixed integer concave minimization problems. A piece wise inner-approximation of the concave function is achieved using an auxiliary linear program that leads to a bilevel program, which provides a lower bound to the original problem. The bilevel program is reduced to a single-level formulation with the help of Karush-Kuhn-Tucker(KKT) conditions. Incorporating the KKT conditions lead to complementary slackness conditions that are linearized using BigM. Multiple bilevel programs, When solved over iterations, guarantee convergence to the exact optimum of the original problem. Though the algorithm is general and can be applied to any optimization
problem with concave function(s), in this paper, we solve two common classes of operations and supply chain problems; namely, the concave knapsack problem, and the concave production transportation problem. The computational experiments indicate that our proposed approach out performs the customized methods that have been used in the literature to solve the two classes of problems by an order of magnitude in most of the test cases. |