`lpx:simplex:`procedureThis procedure solves the given LP problem using the simplex method. It can return one of the following status codes:

LPX_E_OK the LP problem has been successfully solved LPX_E_BADB Unable to start the search, because the initial basis specified in the problem object is invalid--the number of basic (auxiliary and structural) variables is not the same as the number of rows in the problem object. LPX_E_SING Unable to start the search, because the basis matrix corresponding to the initial basis is singular within the working precision. LPX_E_COND Unable to start the search, because the basis matrix corresponding to the initial basis is ill-conditioned, i.e. its condition number is too large. LPX_E_BOUND Unable to start the search, because some double-bounded (auxiliary or structural) variables have incorrect bounds. LPX_E_FAIL The search was prematurely terminated due to the solver failure. LPX_E_OBJLL The search was prematurely terminated, because the objective function being maximized has reached its lower limit and continues decreasing (the dual simplex only). LPX_E_OBJUL The search was prematurely terminated, because the objective function being minimized has reached its upper limit and continues increasing (the dual simplex only). LPX_E_ITLIM The search was prematurely terminated, because the simplex iteration limit has been exceeded. LPX_E_TMLIM The search was prematurely terminated, because the time limit has been exceeded. LPX_E_NOPFS The LP problem instance has no primal feasible solution (only if the LP presolver is used). LPX_E_NODFS The LP problem instance has no dual feasible solution (only if the LP presolver is used).