The linear multiple choice knapsack problem with equity constraints

George Kozanidis, Emanuel Melachrinoudis and Marius M. Solomon

International Journal of Operational Research, 2005, vol. 1, issue 1/2, 52-73

Abstract: In this paper, we introduce an important variation of a well known problem, the linear multiple choice knapsack problem with equity constraints, which finds application in the allocation of funds to highway improvements. The multiple choice constraints are used to model the interactions that arise among different improvements. The equity constraints are introduced to ensure a balance on the budget amounts allocated to different sets of improvements. We present the mathematical formulation and show that this problem structure has several fundamental properties. These are used to develop an optimal two phase greedy algorithm for its solution. We report computational results which indicate that the algorithm is more efficient than a commercial linear programming package and the outperformance increases with problem size.

Keywords: balanced resource allocation; linear multiple choice knapsack; equity constraints; greedy algorithm; highway improvements; funds allocation; road improvements; budget allocation. (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.inderscience.com/link.php?id=7433 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:1:y:2005:i:1/2:p:52-73

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().