By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for ...

Many important optimization problems, such as manufacturing scheduling and power system unit commitment, are formulated as Mixed-Integer Linear Programming (MILP) problems. Such problems are generally ...