On a New Constraint Reduction Heuristic Using Improved Bisection Method for Mixed Integer Linear Programming
In this study, we develop a surrogate relaxation-based procedure to reduce mixed-integer linear programming (MILP) problem sizes. This technique starts with one surrogate constraint which is a nonnegative linear combination of multiple constraints of the problem. At this initial step, we calculate o...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Etamaths Publishing
2020-11-01
|
| Series: | International Journal of Analysis and Applications |
| Online Access: | http://etamaths.com/index.php/ijaa/article/view/2276 |