The feasibility pump is a well-established primal heuristic for mixed integer programming (MIP) that alternates between solving a linear programming (LP) relaxation of the original problem and ...
A routine written in IML to solve this problem follows. The approach appends slack, surplus, and artificial variables to the model where needed. It then solves phase 1 to find a primal feasible ...
The construction of optimal or nearly optimal block designs, using the A-optimality criterion, is formulated as a non-linear 0-1 programme. An approach which ignores the 0-1 constraint is suggested ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback