Surrogate "Level-Based" Lagrangian Relaxation for mixed-integer linear programming.
Ontology highlight
ABSTRACT: Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from combinatorial complexity. Because of integer decision variables, as the problem size increases, the number of possible solutions increases super-linearly thereby leading to a drastic increase in the computational effort. To efficiently solve MILP problems, a "price-based" decomposition and coordination approach is developed to exploit 1. the super-linear reduction of complexity upon the decomposition and 2. the geometric convergence potential inherent to Polyak's stepsizing formula for the fastest coordination possible to obtain near-optimal solutions in a computationally efficient manner. Unlik
SUBMITTER: Bragin MA
PROVIDER: S-EPMC9794831 | biostudies-literature | 2022 Dec
REPOSITORIES: biostudies-literature
ACCESS DATA