Kameshwaran, S and Narahari, Y
(2009)
Nonconvex piecewise linear knapsack problems.
European Journal of Operational Research, 192 (1).
pp. 5668.
Full text not available from this repository.
(
Request a copy)
Abstract
This paper considers the minimization version of a class of nonconvex knapsack problems with piecewise linear cost structure. The items to be included in the knapsack have a divisible quantity and a cost function. An item can be included partially in the given quantity range and the cost is a nonconvex piecewise linear function of quantity. Given a demand, the optimization problem is to choose an optimal quantity for each item such that the demand is satisfied and the total cost is minimized. This problem and its close variants are encountered in manufacturing planning, supply chain design, volume discount procurement auctions, and many other contemporary applications. Two separate mixed integer linear programming formulations of this problem are proposed and are compared with existing formulations. Motivated by different scenarios in which the problem is useful, the following algorithms are developed: (1) a fast polynomial time, nearoptimal heuristic using convex envelopes; (2) exact pseudopolynomial time dynamic programming algorithms; (3) a 2approximation algorithm; and (4) a fully polynomial time approximation scheme. A comprehensive test suite is developed to generate representative problem instances with different characteristics. Extensive computational experiments show that the proposed formulations and algorithms are faster than the existing techniques.
Actions (login required)

View Item 