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

Solving mathematical (math) word problems (MWP) automatically is a challenging research problem in natural language processing, machine learning, and education (learning) technology domains, which has ...