Nonconvex piecewise linear knapsack problems

Kameshwaran, S and Narahari, Y (2009) Nonconvex piecewise linear knapsack problems. In: European Journal Of Operational Research, 192 (1). pp. 56-68.

PDF no.pdf - Published Version Restricted to Registered users only Download (258kB) | 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 ill 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, near-optimal heuristic using convex envelopes; (2) exact pseudo-polynomial time dynamic programming algorithms; (3) a 2-approximation algorithm; and (4) a fully polynomial time approximation scheme. A comprehensive test suite is developed to generate representative problem instances with different haracteristics. Extensive computational experiments show that the proposed formulations and algorithms are faster than the existing techniques.

Item Type:	Journal Article
Publication:	European Journal Of Operational Research
Publisher:	Elsevier Science BV
Additional Information:	Copyright for this article belongs to Elsevier Science BV
Keywords:	Piecewise linear knapsack problem; Precedence constrained knapsack problem; Multiple choice knapsack problem; Linear relaxation; Dynamic programming; Convex envelope; Approximation algorithm; Fully polynomial time approximation scheme
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	14 May 2009 06:22
Last Modified:	19 Sep 2010 04:52
URI:	http://eprints.iisc.ac.in/id/eprint/16421

Actions (login required)

View Item