A Novel Core-Based Optimization Framework for Binary Integer Programs-the Multidemand Multidimesional Knapsack Problem as a Test Problem

The effectiveness and efficiency of optimization algorithms might deteriorate when solving large-scale binary integer programs (BIPs). Consequently, researchers have tried to fix the values of certain variables called adjunct variables, and only optimize a small problem version formed from the remaining variables called core variables, by relying on information obtained from the BIP's LP-relaxation solution. The resulting reduced problem is called a core problem (CP), and finding an optimal solution to a CP does not mean finding an optimal solution to the BIP unless the adjunct variables are fixed to their optimal values. Thus, in this work, we borrow several concepts from local search (LS) heuristics to move from a CP to a neighbouring CP to find a CP whose optimal solution is also optimal for the BIP. Thus, we call our framework CORE-LP-LS. We also propose a new mechanism to choose core variables based on reduced costs. To demonstrate and test the CORE-LP-LS framework, we solve a set of 126 multidemand multidimensional knapsack problem (MDMKP) instances. We solve the resulting CPs using two algorithms, namely, commercial branch and bound solver and the state-of-the-art meta-heuristic algorithm to solve MDMKP. As a by-product to our experiments, the CORE-LP-LS framework variants found 28 new bestknown solutions and better average solutions for most of the solved instances.