Artificial-free simplex algorithm based on the non-acute constraint relaxation. - Aua-aree Boonperm; Krung Sinapiromsaran (Appl. Math. Comput., 2014)

A New Initial Basis for Solving the Blending Problem Without Using Artificial Variables. - Chinchet Boonmalert; Aua-aree Boonperm; Wutiphol Sintunavarat (ICO, 2020)

A New Technique for Solving a 2-Dimensional Linear Program by Considering the Coefficient of Constraints. - Panthira Jamrunroj; Aua-aree Boonperm (ICO, 2020)

A New Integer Programming Model for Solving a School Bus Routing Problem with the Student Assignment. - Anthika Lekburapa; Aua-aree Boonperm; Wutiphol Sintunavarat (ICO, 2020)

Solving an Integer Program by Using the Nonfeasible Basis Method Combined with the Cutting Plane Method. - Kasitinart Sangngern; Aua-aree Boonperm (ICO, 2020)