Abstract
Redundancy identification techniques play an important role in improving the solvability of a linear program. In this paper, we address the redundancy in multi-dimensional knapsack constraints by proposing a new redundancy identification method. The proposed method is based on the constraint intercepts of Paulraj, Chellappan, and Natesan [A heuristic approach for identification of redundant constraints in linear programming models, Int. J. Comput. Math. 83 (2006), pp. 675–683] and surrogate constraints. In it, feasibility problems are constructed in order to determine the redundancy of the constraints, and are solved by a heuristic algorithm, which is developed to check the redundancy fast. The results of computational experiments show that the proposed method may be used in a preprocessing stage in order to reduce the number of knapsack constraints.
| Original language | English |
|---|---|
| Pages (from-to) | 2470-2482 |
| Number of pages | 13 |
| Journal | International Journal of Computer Mathematics |
| Volume | 91 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 2014 Jan 1 |
Fingerprint
ASJC Scopus subject areas
- Applied Mathematics
- Computer Science Applications
- Computational Theory and Mathematics
Cite this
Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints. / Choi, Jiwoong; Choi, In Chan.
In: International Journal of Computer Mathematics, Vol. 91, No. 12, 01.01.2014, p. 2470-2482.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
AU - Choi, Jiwoong
AU - Choi, In Chan
PY - 2014/1/1
Y1 - 2014/1/1
N2 - Redundancy identification techniques play an important role in improving the solvability of a linear program. In this paper, we address the redundancy in multi-dimensional knapsack constraints by proposing a new redundancy identification method. The proposed method is based on the constraint intercepts of Paulraj, Chellappan, and Natesan [A heuristic approach for identification of redundant constraints in linear programming models, Int. J. Comput. Math. 83 (2006), pp. 675–683] and surrogate constraints. In it, feasibility problems are constructed in order to determine the redundancy of the constraints, and are solved by a heuristic algorithm, which is developed to check the redundancy fast. The results of computational experiments show that the proposed method may be used in a preprocessing stage in order to reduce the number of knapsack constraints.
AB - Redundancy identification techniques play an important role in improving the solvability of a linear program. In this paper, we address the redundancy in multi-dimensional knapsack constraints by proposing a new redundancy identification method. The proposed method is based on the constraint intercepts of Paulraj, Chellappan, and Natesan [A heuristic approach for identification of redundant constraints in linear programming models, Int. J. Comput. Math. 83 (2006), pp. 675–683] and surrogate constraints. In it, feasibility problems are constructed in order to determine the redundancy of the constraints, and are solved by a heuristic algorithm, which is developed to check the redundancy fast. The results of computational experiments show that the proposed method may be used in a preprocessing stage in order to reduce the number of knapsack constraints.
KW - feasibility problems
KW - knapsack constraints
KW - linear program
KW - redundancy
KW - surrogate constraints
UR - http://www.scopus.com/inward/record.url?scp=84914685428&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84914685428&partnerID=8YFLogxK
U2 - 10.1080/00207160.2014.885020
DO - 10.1080/00207160.2014.885020
M3 - Article
AN - SCOPUS:84914685428
VL - 91
SP - 2470
EP - 2482
JO - International Journal of Computer Mathematics
JF - International Journal of Computer Mathematics
SN - 0020-7160
IS - 12
ER -