The formulated problem is a mixed binary non-linear programming problem. Therefore, to address the challenge we first transform the problem into a single-objective problem using Tchebycheff method.

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 ...