Overview | Group | Tree | Graph | Index | Concepts |
The routine CPXprimopt
may be used after a linear program
has been created via a call to CPXcreateprob
, to find a
solution to that problem using the primal simplex method. When this function
is called, the CPLEX primal simplex algorithm attempts to optimize the
specified problem. The results of the optimization are recorded in the CPLEX
problem object.
Example
status = CPXprimopt (env, lp);
env | A pointer to the CPLEX environment as returned by |
lp | A pointer to a CPLEX problem object as returned by |
CPXERR_NO_MEMORY
) or encountering invalid data in the CPLEX problem object (CPXERR_NO_PROBLEM
). Exceeding a user-specified CPLEX limit or proving the model infeasible or unbounded are not considered errors. Note that a zero return value does not necessarily mean that a solution exists. Use query routines CPXsolninfo
, CPXgetstat
, and CPXsolution
to obtain further information about the status of the optimization.