Multi-objective integer non-linear programming (MINP) problems are ubiquitous in real life, however, only the ε-constraint method can be used to solve MINP problems. To improve the computation time of ...

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