Methods of the class problem

The tables below show all methods of the class problem of the Xpress Python interface, with the exception of callbacks, which are listed separately. Their invocation is therefore to be preceded by a problem object (the class prefix problem. is omitted in the table for compactness), as follows:

import xpress as xp
p = xp.problem()
x = p.addVariable()
p.setObjective(x + 3 * x**2 + 2)

problem.addcbafterobjective	Declares a callback which will be called after each objective in a multi-objective problem is solved.
problem.addcbbariteration	Declares a barrier iteration callback function, called after each iteration during the interior point algorithm, with the ability to access the current barrier solution/slack/duals or reduced cost values, and to ask barrier to stop.
problem.addcbbarlog	Declares a barrier log callback function, called at each iteration during the interior point algorithm.
problem.addcbbeforeobjective	Declares a callback which will be called before each objective in a multi-objective problem is solved.
problem.addcbchecktime	Declares a callback function which is called every time the Optimizer checks if the time limit has been reached.
problem.addcbchgbranchobject	Declares a callback function that will be called every time the Optimizer has selected a MIP entity for branching.
problem.addcbcutlog	Declares a cut log callback function, called each time the cut log is printed.
problem.addcbcutround	Declares a callback function that is called when the Optimizer could separate cutting planes during the branch and bound search.
problem.addcbdestroymt	Declares a callback function that is called every time a MIP thread is destroyed by the parallel MIP code.
problem.addcbgapnotify	Declares a gap notification callback, to be called when a MIP solve reaches a predefined target, set using the miprelgapnotify, mipabsgapnotify, mipabsgapnotifyobj, and/or mipabsgapnotifybound controls.
problem.addcbinfnode	Declares a user infeasible node callback function, called after the current node has been found to be infeasible during the Branch and Bound search.
problem.addcbintsol	Declares a user integer solution callback function, called every time an integer solution is found by heuristics or during the Branch and Bound search.
problem.addcblplog	Declares a simplex log callback function which is called after every LPLOG iterations of the simplex algorithm.
problem.addcbmessage	Declares an output callback function, called every time a text line relating to the given prob is output by the Optimizer.
problem.addcbmiplog	Declares a MIP log callback function, called each time the MIP log is printed.
problem.addcbmipthread	Declares a MIP thread callback function, called every time a MIP worker problem is created by the parallel MIP code.
problem.addcbnewnode	Declares a callback function that will be called every time a new node is created during the branch and bound search.
problem.addcbnodecutoff	Declares a user node cutoff callback function, called every time a node is cut off as a result of an improved integer solution being found during the branch and bound search.
problem.addcbnodelpsolved	Declares a node LP solved callback function, called during the branch and bound search, after the LP relaxation has been solved for the current node, but before any internal cuts and heuristics have been applied.
problem.addcboptnode	Declares an optimal node callback function, called during the branch and bound search, after the LP relaxation has been solved for the current node, and after any internal cuts and heuristics have been applied, but before the Optimizer checks if the current node should be branched.
problem.addcbpreintsol	Declares a user integer solution callback function, called when an integer solution is found by heuristics or during the branch and bound search, but before it is accepted by the Optimizer.
problem.addcbprenode	Declares a preprocess node callback function, called before the LP relaxation of a node has been optimized, so the solution at the node will not be available.
problem.addcbpresolve	Declares a callback to be called after presolve has been performed.
problem.addcbusersolnotify	Declares a callback function to be called each time a solution added by problem.addmipsol has been processed.
problem.addcoefs	Add non-linear coefficients to the SLP problem
problem.addcols	Add columns to the problem after passing it to the Optimizer using the input routines.
problem.addConstraint	Adds one or more constraints to the problem.
problem.addcuts	Adds cuts directly to the matrix at the current node.
problem.adddfs	Add a set of distribution factors
problem.addgencons	Adds one or more general constraints to the problem.
problem.addIndicator	Adds one or more indicator constraints to the problem.
problem.addManagedCuts	Adds cuts to the Optimizer's internal cut pool from within the cutround callback set by problem.addcbcutround. [Callback, Cuts]
problem.addmipsol	Adds a new feasible, infeasible or partial MIP solution for the problem to the Optimizer.
problem.addnames	Associates names with rows, columns, sets, piecewise linear constraints, general constraints or objectives.
problem.addobj	Appends an objective function with the given coefficients to a multi-objective problem.
problem.addObjective	Adds one or more objective functions to the problem.
problem.addpwlcons	Adds one or more piecewise linear constraints to the problem.
problem.addqmatrix	Adds a new quadratic matrix into a row defined by triplets.
problem.addrows	Adds rows and their coefficient to the problem.
problem.addSets	Allows sets to be added to the problem after passing it to the Optimizer using the input routines. [MIP Entities, Problem Creation]
problem.addSOS	Creates a special ordered set (SOS) constraint within the problem.
problem.addtolsets	Add sets of standard tolerance values to an SLP problem
problem.addVariable	Creates a variable within the problem.
problem.addVariables	Creates a dictionary or NumPy array of variables and adds them to the problem.
problem.addvars	Add SLP variables defined as matrix columns to an SLP problem
problem.basisstability	Returns various measures for the stability of the current basis, including the basis condition number.
problem.bndsa	Returns upper and lower sensitivity ranges for specified variables' lower and upper bounds.
problem.btran	Post-multiplies a (row) vector provided by the user by the inverse of the current basis.
problem.calcobjective	Returns the objective value of a given solution.
problem.calcobjn	Returns the value of a given objective.
problem.calcreducedcosts	Returns the reduced cost values for a given (row) dual solution.
problem.calcslacks	Calculates the row slack values for a given solution.
problem.calcsolinfo	Returns the required property of a solution, like maximum infeasibility of a given primal and duals solution.
problem.cascade	Re-calculate consistent values for SLP variables based on the current values of the remaining variables
problem.cascadeorder	Establish a re-calculation sequence for SLP variables with determining rows.
problem.chgbounds	Changes the bounds on columns in the problem.
problem.chgcascadenlimit	Set a variable specific cascade iteration limit
problem.chgcoef	Changes a single coefficient in the problem.
problem.chgcoltype	Changes the type of a column in the problem.
problem.chgdeltatype	Changes the type of the delta assigned to a nonlinear variable
problem.chgdf	Set or change a distribution factor
problem.chgglblimit	Changes semi-continuous or semi-integer lower bounds, or upper limits on partial integers.
problem.chgmcoef	Change multiple coefficients in the problem.
problem.chgmqobj	Change multiple quadratic coefficients in the objective function.
problem.chgobj	Change the objective function coefficients.
problem.chgobjn	Modifies one or more coefficients of an objective function in a multi-objective problem.
problem.chgobjsense	Changes the problem's objective function objsense to minimize or maximize.
problem.chgqobj	Change a single quadratic coefficient in the objective function corresponding to the variable pair (objqcol1,objqcol2) of the Hessian matrix.
problem.chgqrowcoeff	Changes a single quadratic coefficient in a row.
problem.chgrhs	Changes righthand side values of the problem.
problem.chgrhsrange	Change the range for one or more rows of the problem.
problem.chgrowstatus	Change the status setting of a constraint
problem.chgrowtype	Changes the type of a row in the problem.
problem.chgrowwt	Set or change the initial penalty error weight for a row
problem.chgtolset	Add or change a set of convergence tolerances used for SLP variables
problem.chgvar	Define a column as an SLP variable or change the characteristics and values of an existing SLP variable
problem.clearRowFlags	Clears extra information attached to a range of rows. [Problem Modification]
problem.construct	Create the full augmented SLP matrix and data structures, ready for optimization
problem.copy	Obtains a copy of a problem.
problem.copycallbacks	Copies callback functions defined for one problem to another.
problem.copycontrols	Copies controls defined for one problem to another.
problem.crossoverlpsol	Provides a basic optimal solution for a given solution of an LP problem.
problem.delcoefs	Delete coefficients from the current problem
problem.delCols	Delete columns from a matrix. [Problem Creation]
problem.delConstraint	Delete one or more constraints from the problem.
problem.delcpcuts	Deletes cuts from the cut pool.
problem.delcuts	Deletes cuts from the matrix at the current node.
problem.delgencons	Delete general constraints from a problem.
problem.delindicators	Delete indicator constraints.
problem.delobj	Removes an objective function from a multi-objective problem.
problem.delpwlcons	Delete piecewise linear constraints from a problem.
problem.delqmatrix	Deletes the quadratic part of a row or of the objective function.
problem.delRows	Delete rows from a matrix. [Problem Creation]
problem.delSets	Delete sets from a problem. [MIP Entities, Problem Creation]
problem.delSOS	Delete one or more SOSs from the problem.
problem.deltolsets	Delete tolerance sets from the current problem
problem.delVariable	Delete one or more variables from the problem.
problem.delvars	Convert SLP variables to normal columns.
problem.dumpcontrols	Displays the list of controls and their current value for those controls that have been set to a non default value.
problem.estimaterowdualranges	Performs a dual side range sensitivity analysis, i.e., calculates estimates for the possible ranges for dual values.
problem.evaluatecoef	Evaluate a coefficient using the current values of the variables
problem.evaluateformula	Evaluate a formula using the current values of the variables
problem.fixmipentities	Fixes all the MIP entities to the values of the last found MIP solution.
problem.fixpenalties	Fixe the values of the error vectors
problem.ftran	Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix.
problem.getAttrib	Retrieves one or more attributes of a problem.
problem.getattribinfo	Accesses the id number and the type information of an attribute given its name.
problem.getbasis	Returns the current basis into the user's data arrays.
problem.getbasisval	Returns the current basis status for a specific col or row.
problem.getCallbackDuals	Obtains the dual values from the solution associated with the current callback.
problem.getCallbackPresolveDuals	Returns the dual values from the solution to the presolved problem associated with the current callback.
problem.getCallbackPresolveRedCosts	Returns the reduced costs from the solution to the presolved problem associated with the current callback.
problem.getCallbackPresolveSlacks	Returns the slack values from the solution to the presolved problem associated with the current callback.
problem.getCallbackPresolveSolution	Returns the solution to the presolved problem associated with the current callback.
problem.getCallbackRedCosts	Obtains the reduced costs from the solution associated with the current callback.
problem.getCallbackSlacks	Obtains the slack values from the solution associated with the current callback.
problem.getCallbackSolution	Obtains the solution associated with the current callback.
problem.getcoef	Returns a single coefficient in the constraint matrix.
problem.getcoefformula	Retrieve a single nonlinear matrix coefficient as a formula split into tokens
problem.getcoefs	Retrieve the list of positions of the nonlinear coefficients in the problem
problem.getcolinfo	Get current column information.
problem.getcols	Returns the nonzeros in the constraint matrix for the columns in a given range.
problem.getcoltype	Returns the column types for the columns in a given range.
problem.getConstraint	Returns one or more constraint of a problem corresponding to one or more indices passed as arguments.
problem.getControl	Retrieves one or more controls of a problem.
problem.getcontrolinfo	Accesses the id number and the type information of a control given its name.
problem.getcpcutlist	Returns a list of cut indices from the cut pool.
problem.getcpcuts	Returns cuts from the cut pool.
problem.getcutlist	Retrieves a list of cuts for the cuts active at the current node.
problem.getcutmap	Returns in which rows a list of cutind are currently loaded into the Optimizer.
problem.getcutslack	Used to calculate the slack value of a cut with respect to the current LP relaxation solution.
problem.getdf	Get a distribution factor
problem.getdirs	Returns the directives that have been loaded into a problem.
problem.getdualray	Retrieves a dual ray (dual unbounded direction) for the current problem, if the problem is found to be infeasible.
problem.getDuals	Obtains the dual values associated with the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getgencons	Returns the general constraints y = f(x1, ..., xn, c1, ..., cm) in a given range.
problem.getiisdata	Returns information for an Irreducible Infeasible Set: size, variables (row and column vectors) and conflicting sides of the variables, duals and reduced costs.
problem.getIndex	Returns the numerical index for a specified row, column, or set of the optimizer.
problem.getIndexFromName	Returns the index for a specified row or column name.
problem.getindicators	Returns the indicator constraint condition (indicator variable and complement flag) associated to the rows in a given range.
problem.getinfeas	Returns a list of infeasible primal and dual variables.
problem.getlastbarsol	Obtains the last barrier solution values following optimization that used the barrier solver.
problem.getlasterror	Returns the error message corresponding to the last error triggered by a library function.
problem.getlb	Returns the lower bounds on the columns in a given range.
problem.getlpsol	Obtains the LP solution values following optimization.
problem.getmessagestatus	Returns the current suppression status of a message: nonzero if the message is not suppressed; 0 otherwise.
problem.getmipentities	Retrieves MIP entity information about a problem.
problem.getmqobj	Returns the nonzeros in the quadratic objective coefficients' matrix for the columns in a given range.
problem.getnamelist	Returns the names for the rows, columns, sets, piecewise linear constraints, general constraints or objectives in a given range.
problem.getobj	Returns the objective function coefficients for the columns in a given range.
problem.getobjn	Returns the coefficients of a given objective function for the columns in a given range.
problem.getOutputEnabled	Returns True if Optimizer messages will be written to the Python output stream, False otherwise.
problem.getpivotorder	Returns the pivot order of the basic variables.
problem.getpivots	Returns a list of potential leaving variables if a specified variable enters the basis.
problem.getpresolvebasis	Returns the current basis from memory into the user's data areas.
problem.getpresolvemap	Returns the mapping of the row and column numbers from the presolve problem back to the original problem.
problem.getpresolvesol	Returns the solution for the presolved problem from memory.
problem.getprimalray	Retrieves a primal ray (primal unbounded direction) for the current problem, if the problem is found to be unbounded.
problem.getpwlcons	Returns the piecewise linear constraints y = f(x) in a given range.
problem.getqobj	Returns a single quadratic objective function coefficient corresponding to the variable pair (objqcol1, objqcol2) of the Hessian matrix.
problem.getqrowcoeff	Returns a single quadratic constraint coefficient corresponding to the variable pair (rowqcol1, rowqcol2) of the Hessian of a given constraint.
problem.getqrowqmatrix	Returns the nonzeros in a quadratic constraint coefficients matrix for the columns in a given range.
problem.getqrowqmatrixtriplets	Returns the nonzeros in a quadratic constraint coefficients matrix as triplets (index pairs with coefficients).
problem.getqrows	Returns a list of row objects that have quadratic coefficients.
problem.getRedCosts	Obtains the reduced costs associated with the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getrhs	Returns the right hand side elements for the rows in a given range.
problem.getrhsrange	Returns the right hand side range values for the rows in a given range.
problem.getRowFlags	Retrieve if a range of rows have been set up as special rows. [Problem Information]
problem.getrowinfo	Get current row information.
problem.getrows	Returns the nonzeros in the constraint matrix for the rows in a given range.
problem.getrowstatus	Retrieve the status setting of a constraint
problem.getrowtype	Returns the row types for the rows in a given range.
problem.getrowwt	Get the initial penalty error weight for a row
problem.getScale	Returns the the current scaling of the matrix. [Numerics]
problem.getscaledinfeas	Returns a list of scaled infeasible primal and dual variables for the original problem.
problem.getSlacks	Obtains the slack values associated with the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getSolution	Obtains the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getSOS	Returns one or more SOSs of a problem corresponding to one or more indices passed as arguments.
problem.gettolset	Retrieve the values of a set of convergence tolerances for an SLP problem
problem.getub	Returns the upper bounds on the columns in a given range.
problem.getunbvec	Returns the index vector which causes the primal simplex or dual simplex algorithm to determine that a problem is primal or dual unbounded respectively.
problem.getvar	Retrieve information about an SLP variable
problem.getVariable	Returns one or more variables of a problem corresponding to one or more indices passed as arguments.
problem.hasdualray	Returns true if a dual ray (dual unbounded direction) exists for the current problem, if the problem is found to be infeasible.
problem.hasprimalray	Returns true if a primal ray (primal unbounded direction) exists for the current problem, if the problem is found to be unbounded.
problem.iisall	Performs an automated search for independent Irreducible Infeasible Sets (IIS) in an infeasible problem.
problem.iisclear	Resets the search for Irreducible Infeasible Sets (IIS).
problem.iisfirst	Initiates a search for an Irreducible Infeasible Set (IIS) in an infeasible problem.
problem.iisisolations	Performs the isolation identification procedure for an Irreducible Infeasible Set (IIS).
problem.iisnext	Continues the search for further Irreducible Infeasible Sets (IIS).
problem.iisstatus	Returns statistics on the Irreducible Infeasible Sets (IIS) found so far.
problem.iiswrite	Writes an LP/MPS/CSV file containing a given Irreducible Infeasible Set (IIS).
problem.interrupt	Interrupts the Optimizer algorithms.
problem.loadbasis	Loads a basis as specified by the user.
problem.loadbranchdirs	Loads directives into the current problem to specify which MIP entities the Optimizer should continue to branch on when a node solution is integer feasible.
problem.loadcoefs	Load non-linear coefficients into the SLP problem
problem.loadcuts	Loads cuts from the cut pool into the matrix.
problem.loaddelayedrows	Specifies that a set of rows in the problem will be treated as delayed rows during a tree search.
problem.loaddfs	Load a set of distribution factors
problem.loaddirs	Loads directives into the problem.
problem.loadlpsol	Loads an LP solution for the problem into the Optimizer.
problem.loadmipsol	Loads a MIP solution for the problem into the Optimizer.
problem.loadmodelcuts	Specifies that a set of rows in the problem will be treated as model cuts.
problem.loadpresolvebasis	Loads a presolved basis from the user's areas.
problem.loadpresolvedirs	Loads directives into the presolved matrix.
problem.loadproblem	Load an optimization problem, possibly with quadratic objective and/or constraints, and integer variables.
problem.loadsecurevecs	Allows the user to mark rows and columns in order to prevent the presolve removing these rows and columns from the problem.
problem.loadtolsets	Load sets of standard tolerance values into an SLP problem
problem.loadvars	Load SLP variables defined as matrix columns into an SLP problem
problem.lpoptimize	Begins a search for the optimal continuous (LP) solution.
problem.mipoptimize	Begins a tree search for the optimal MIP solution.
problem.msaddcustompreset	A combined version of msaddjob and msaddpreset.
problem.msaddjob	Adds a multistart job to the multistart pool
problem.msaddpreset	Loads a preset of jobs into the multistart job pool.
problem.msclear	Removes all scheduled jobs from the multistart job pool
problem.name	Returns the name of the problem as a Python string.
problem.nlpAddFormulas	Add non-linear formulas to the SLP problem. [Problem Modification]
problem.nlpchgformula	Add or replace a single matrix formula using a parsed or unparsed formula
problem.nlpchgformulastr	Add or replace a single matrix formula using a character string for the formula.
problem.nlpDelFormulas	Delete nonlinear formulas from the current problem [Problem Modification]
problem.nlpgetformula	Retrieve a single matrix formula split into tokens
problem.nlpGetFormulaRows	Retrieve the list of positions of the nonlinear formulas in the problem [Problem Information]
problem.nlpgetformulastr	Retrieve a single matrix formula in a character string
problem.nlpLoadFormulas	Load non-linear formulas into the SLP problem [Problem Information]
problem.nlpoptimize	Solves an SLP problem
problem.nlpsetinitval	Set the initial value of a nonlinear variable
problem.objsa	Returns upper and lower sensitivity ranges for specified objective function coefficients.
problem.optimize	Begins a search for the optimal solution of the problem.
problem.pivot	Performs a simplex pivot by bringing variable enter into the basis and removing leave. [Linear Algebra, Simplex]
problem.postsolve	Postsolve the current problem when it is in a presolved state.
problem.postSolveSol	Postsolves a primal solution formulated in the presolved space into the corresponding solution formulated in the original space. The problem itself is unchanged. [Presolve, Solution]
problem.presolve	Perform a nonlinear presolve on the problem
problem.presolverow	Presolves a row formulated in terms of the original variables such that it can be added to a presolved problem.
problem.printevalinfo	Print a summary of any evaluation errors that may have occurred during solving a problem
problem.printIIS	Prints a given Irreducible Infeasible Set (IIS) in the log. [Infeasibility, Logging]
problem.printmemory	Print the dimensions and memory allocations for a problem
problem.read	Read an optimization problem into a Python problem object created prior to the call.
problem.readbasis	Instructs the Optimizer to read in a previously saved basis from a file.
problem.readbinsol	Reads a solution from a binary solution file.
problem.readdirs	Reads a directives file to help direct the tree search.
problem.readslxsol	Reads an ASCII solution file .slx created by the problem.writeslxsol function.
problem.refinemipsol	Runs the MIP solution refiner.
problem.reinitialize	Reset the SLP problem to match a just augmented system
problem.removecbafterobjective	Removes a user after objective callback function previously added by addcbafterobjective.
problem.removecbbariteration	Removes a barrier iteration callback function previously added by addcbbariteration.
problem.removecbbarlog	Removes a newton barrier log callback function previously added by addcbbarlog.
problem.removecbbeforeobjective	Removes a user before objective callback function previously added by addcbbeforeobjective.
problem.removecbchecktime	Removes a callback function previously added by problem.addcbchecktime.
problem.removecbchgbranchobject	Removes a callback function previously added by addcbchgbranchobject.
problem.removecbcutlog	Removes a cut log callback function previously added by addcbcutlog.
problem.removecbcutround	Removes a cut round callback function previously added by addcbcutround.
problem.removecbdestroymt	Removes a slave thread destruction callback function previously added by addcbdestroymt.
problem.removecbgapnotify	Removes a callback function previously added by problem.addcbgapnotify.
problem.removecbinfnode	Removes a user infeasible node callback function previously added by addcbinfnode.
problem.removecbintsol	Removes an integer solution callback function previously added by addcbintsol.
problem.removecblplog	Removes a simplex log callback function previously added by addcblplog.
problem.removecbmessage	Removes a message callback function previously added by addcbmessage.
problem.removecbmiplog	Removes a MIP log callback function previously added by addcbmiplog.
problem.removecbmipthread	Removes a callback function previously added by addcbmipthread.
problem.removecbnewnode	Removes a new-node callback function previously added by addcbnewnode.
problem.removecbnodecutoff	Removes a node-cutoff callback function previously added by addcbnodecutoff.
problem.removecbnodelpsolved	Removes a node lp solved callback function previously added by addcbnodelpsolved.
problem.removecboptnode	Removes a node-optimal callback function previously added by addcboptnode.
problem.removecbpreintsol	Removes a pre-integer solution callback function previously added by addcbpreintsol.
problem.removecbprenode	Removes a preprocess node callback function previously added by addcbprenode.
problem.removecbpresolve	Removes a presolve callback function previously added by addcbpresolve.
problem.removecbusersolnotify	Removes a user solution notification callback previously added by problem.addcbusersolnotify.
problem.repairinfeas	Provides a simplified interface for problem.repairweightedinfeas.
problem.repairweightedinfeas	Attempts to identify a 'solution' that violates a selected set of constraints and bounds minimally, while satisfying all other constraints and bounds.
problem.repairweightedinfeasbounds	An extended version of problem.repairweightedinfeas that allows for bounding the level of relaxation allowed.
problem.reset	Clears all information regarding an optimization problem and returns it to the same status as it would be after creation.
problem.restore	Restores the Optimizer's data structures from a file created by problem.save.
problem.rhssa	Returns upper and lower sensitivity ranges for specified right hand side (RHS) function coefficients.
problem.save	Saves the current data structures, i.e., matrices, control settings and problem attribute settings to file and terminates the run so that optimization can be resumed later.
problem.scale	Re-scales the current problem.
problem.scaling	Analyze the current matrix for largest/smallest coefficients and ratios
problem.setcbcascadeend	Set a user callback to be called at the end of the cascading process, after the last variable has been cascaded
problem.setcbcascadestart	Set a user callback to be called at the start of the cascading process, before any variables have been cascaded
problem.setcbcascadevar	Set a user callback to be called after each column has been cascaded
problem.setcbcascadevarfail	Set a user callback to be called after cascading a column was not successful
problem.setcbcoefevalerror	Set a user callback to be called when an evaluation of a coefficient fails during the solve
problem.setcbconstruct	Set a user callback to be called during the Xpress SLP augmentation process
problem.setcbdestroy	Set a user callback to be called when an SLP problem is about to be destroyed
problem.setcbdrcol	Set a user callback used to override the update of variables with small determining column
problem.setcbintsol	Set a user callback to be called during MISLP when an integer solution is obtained
problem.setcbiterend	Set a user callback to be called at the end of each SLP iteration
problem.setcbiterstart	Set a user callback to be called at the start of each SLP iteration
problem.setcbitervar	Set a user callback to be called after each column has been tested for convergence
problem.setcbmessage	Set a user callback to be called whenever Xpress Nonlinear outputs a line of text
problem.setcbmsjobend	Set a user callback to be called every time a new multistart job finishes.
problem.setcbmsjobstart	Set a user callback to be called every time a new multistart job is created, and the pre-loaded settings are applied
problem.setcbmswinner	Set a user callback to be called every time a new multistart job is created, and the pre-loaded settings are applied
problem.setcboptnode	Set a user callback to be called during MISLP when an optimal SLP solution is obtained at a node
problem.setcbprenode	Set a user callback to be called during MISLP after the set-up of the SLP problem to be solved at a node, but before SLP optimization
problem.setcbpreupdatelinearization	Set a user callback to be called before the linearization is updated
problem.setcbslpend	Set a user callback to be called at the end of the SLP optimization
problem.setcbslpnode	Set a user callback to be called during MISLP after the SLP optimization at each node.
problem.setcbslpstart	Set a user callback to be called at the start of the SLP optimization
problem.setControl	Sets one or more controls of a problem.
problem.setcurrentiv	Transfer the current solution to initial values
problem.setdefaultcontrol	Sets one control to its default value.
problem.setdefaults	Sets all controls to their default values.
problem.setindicators	Specifies that a set of rows in the problem will be treated as indicator constraints during a tree search.
problem.setlogfile	This directs all Optimizer output to a log file.
problem.setmessagestatus	Manages suppression of messages.
problem.setObjective	Sets the objective function of the problem.
problem.setOutputEnabled	Enables or disables writing Optimizer messages to the Python output stream.
problem.setprobname	Sets the current default problem name.
problem.slpchgcoef	Add or change a single matrix coefficient using a parsed or unparsed formula
problem.slpchgcoefstr	Add or change a single matrix coefficient using a string for the formula
problem.slpgetcoefformula	Retrieve a single matrix formula split into tokens
problem.slpgetcoefstr	Retrieve a single matrix coefficient as a formula in a character string
problem.slpSetDetRow	Set the determining row of a variable [Cascading, Data Input, SLP]
problem.sparseBTran	Post-multiplies a (row) vector provided by the user by the inverse of the current matrix. Sparse version of problem.btran. [Linear Algebra, Simplex]
problem.sparseFTran	Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix. Sparse version of problem.ftran. [Linear Algebra, Simplex]
problem.storecuts	Stores cuts into the cut pool, but does not apply them to the current node.
problem.strongbranch	Performs strong branching iterations on all specified bound changes.
problem.strongbranchcb	Performs strong branching iterations on all specified bound changes.
problem.tune	Begin a tuner session for the current problem.
problem.tuneprobsetfile	Begins a tuner session for a set of problems.
problem.tunerreadmethod	Load a user defined tuner method from the given file.
problem.tunerwritemethod	Writes the current tuner method to a given file or prints it to the console.
problem.unconstruct	Reset the SLP problem and removes the augmentation structures
problem.updatelinearization	Updates the current linearization
problem.validate	Validate the feasibility of constraints in a converged solution
problem.validatekkt	Validates the first order optimality conditions also known as the Karush-Kuhn-Tucker (KKT) conditions versus the currect solution
problem.validaterow	Prints an extensive analysis on a given constraint of the SLP problem
problem.validatevector	Validate the feasibility of constraints for a given solution
problem.write	Writes the current problem to an MPS or LP file.
problem.writebasis	Writes the current basis to a file for later input into the Optimizer.
problem.writebinsol	Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer.
problem.writedirs	Writes the tree search directives from the current problem to a directives file.
problem.writeprtsol	Writes the current solution to a fixed format ASCII file, problem_name.prt.
problem.writeslxsol	Creates an ASCII solution file (.slx) using a similar format to MPS files.
problem.writesol	Writes the current solution to a CSV format ASCII file, problem_name.asc(and .hdr).

The following table contains the problem functions to be called for nonlinear problems.

problem.addcbafterobjective	Declares a callback which will be called after each objective in a multi-objective problem is solved.
problem.addcbbariteration	Declares a barrier iteration callback function, called after each iteration during the interior point algorithm, with the ability to access the current barrier solution/slack/duals or reduced cost values, and to ask barrier to stop.
problem.addcbbarlog	Declares a barrier log callback function, called at each iteration during the interior point algorithm.
problem.addcbbeforeobjective	Declares a callback which will be called before each objective in a multi-objective problem is solved.
problem.addcbchecktime	Declares a callback function which is called every time the Optimizer checks if the time limit has been reached.
problem.addcbchgbranchobject	Declares a callback function that will be called every time the Optimizer has selected a MIP entity for branching.
problem.addcbcutlog	Declares a cut log callback function, called each time the cut log is printed.
problem.addcbcutround	Declares a callback function that is called when the Optimizer could separate cutting planes during the branch and bound search.
problem.addcbdestroymt	Declares a callback function that is called every time a MIP thread is destroyed by the parallel MIP code.
problem.addcbgapnotify	Declares a gap notification callback, to be called when a MIP solve reaches a predefined target, set using the miprelgapnotify, mipabsgapnotify, mipabsgapnotifyobj, and/or mipabsgapnotifybound controls.
problem.addcbinfnode	Declares a user infeasible node callback function, called after the current node has been found to be infeasible during the Branch and Bound search.
problem.addcbintsol	Declares a user integer solution callback function, called every time an integer solution is found by heuristics or during the Branch and Bound search.
problem.addcblplog	Declares a simplex log callback function which is called after every LPLOG iterations of the simplex algorithm.
problem.addcbmessage	Declares an output callback function, called every time a text line relating to the given prob is output by the Optimizer.
problem.addcbmiplog	Declares a MIP log callback function, called each time the MIP log is printed.
problem.addcbmipthread	Declares a MIP thread callback function, called every time a MIP worker problem is created by the parallel MIP code.
problem.addcbnewnode	Declares a callback function that will be called every time a new node is created during the branch and bound search.
problem.addcbnodecutoff	Declares a user node cutoff callback function, called every time a node is cut off as a result of an improved integer solution being found during the branch and bound search.
problem.addcbnodelpsolved	Declares a node LP solved callback function, called during the branch and bound search, after the LP relaxation has been solved for the current node, but before any internal cuts and heuristics have been applied.
problem.addcboptnode	Declares an optimal node callback function, called during the branch and bound search, after the LP relaxation has been solved for the current node, and after any internal cuts and heuristics have been applied, but before the Optimizer checks if the current node should be branched.
problem.addcbpreintsol	Declares a user integer solution callback function, called when an integer solution is found by heuristics or during the branch and bound search, but before it is accepted by the Optimizer.
problem.addcbprenode	Declares a preprocess node callback function, called before the LP relaxation of a node has been optimized, so the solution at the node will not be available.
problem.addcbpresolve	Declares a callback to be called after presolve has been performed.
problem.addcbusersolnotify	Declares a callback function to be called each time a solution added by problem.addmipsol has been processed.
problem.addcoefs	Add non-linear coefficients to the SLP problem
problem.addcols	Add columns to the problem after passing it to the Optimizer using the input routines.
problem.addConstraint	Adds one or more constraints to the problem.
problem.addcuts	Adds cuts directly to the matrix at the current node.
problem.adddfs	Add a set of distribution factors
problem.addgencons	Adds one or more general constraints to the problem.
problem.addIndicator	Adds one or more indicator constraints to the problem.
problem.addManagedCuts	Adds cuts to the Optimizer's internal cut pool from within the cutround callback set by problem.addcbcutround. [Callback, Cuts]
problem.addmipsol	Adds a new feasible, infeasible or partial MIP solution for the problem to the Optimizer.
problem.addnames	Associates names with rows, columns, sets, piecewise linear constraints, general constraints or objectives.
problem.addobj	Appends an objective function with the given coefficients to a multi-objective problem.
problem.addObjective	Adds one or more objective functions to the problem.
problem.addpwlcons	Adds one or more piecewise linear constraints to the problem.
problem.addqmatrix	Adds a new quadratic matrix into a row defined by triplets.
problem.addrows	Adds rows and their coefficient to the problem.
problem.addSets	Allows sets to be added to the problem after passing it to the Optimizer using the input routines. [MIP Entities, Problem Creation]
problem.addSOS	Creates a special ordered set (SOS) constraint within the problem.
problem.addtolsets	Add sets of standard tolerance values to an SLP problem
problem.addVariable	Creates a variable within the problem.
problem.addVariables	Creates a dictionary or NumPy array of variables and adds them to the problem.
problem.addvars	Add SLP variables defined as matrix columns to an SLP problem
problem.basisstability	Returns various measures for the stability of the current basis, including the basis condition number.
problem.bndsa	Returns upper and lower sensitivity ranges for specified variables' lower and upper bounds.
problem.btran	Post-multiplies a (row) vector provided by the user by the inverse of the current basis.
problem.calcobjective	Returns the objective value of a given solution.
problem.calcobjn	Returns the value of a given objective.
problem.calcreducedcosts	Returns the reduced cost values for a given (row) dual solution.
problem.calcslacks	Calculates the row slack values for a given solution.
problem.calcsolinfo	Returns the required property of a solution, like maximum infeasibility of a given primal and duals solution.
problem.cascade	Re-calculate consistent values for SLP variables based on the current values of the remaining variables
problem.cascadeorder	Establish a re-calculation sequence for SLP variables with determining rows.
problem.chgbounds	Changes the bounds on columns in the problem.
problem.chgcascadenlimit	Set a variable specific cascade iteration limit
problem.chgcoef	Changes a single coefficient in the problem.
problem.chgcoltype	Changes the type of a column in the problem.
problem.chgdeltatype	Changes the type of the delta assigned to a nonlinear variable
problem.chgdf	Set or change a distribution factor
problem.chgglblimit	Changes semi-continuous or semi-integer lower bounds, or upper limits on partial integers.
problem.chgmcoef	Change multiple coefficients in the problem.
problem.chgmqobj	Change multiple quadratic coefficients in the objective function.
problem.chgobj	Change the objective function coefficients.
problem.chgobjn	Modifies one or more coefficients of an objective function in a multi-objective problem.
problem.chgobjsense	Changes the problem's objective function objsense to minimize or maximize.
problem.chgqobj	Change a single quadratic coefficient in the objective function corresponding to the variable pair (objqcol1,objqcol2) of the Hessian matrix.
problem.chgqrowcoeff	Changes a single quadratic coefficient in a row.
problem.chgrhs	Changes righthand side values of the problem.
problem.chgrhsrange	Change the range for one or more rows of the problem.
problem.chgrowstatus	Change the status setting of a constraint
problem.chgrowtype	Changes the type of a row in the problem.
problem.chgrowwt	Set or change the initial penalty error weight for a row
problem.chgtolset	Add or change a set of convergence tolerances used for SLP variables
problem.chgvar	Define a column as an SLP variable or change the characteristics and values of an existing SLP variable
problem.clearRowFlags	Clears extra information attached to a range of rows. [Problem Modification]
problem.construct	Create the full augmented SLP matrix and data structures, ready for optimization
problem.copy	Obtains a copy of a problem.
problem.copycallbacks	Copies callback functions defined for one problem to another.
problem.copycontrols	Copies controls defined for one problem to another.
problem.crossoverlpsol	Provides a basic optimal solution for a given solution of an LP problem.
problem.delcoefs	Delete coefficients from the current problem
problem.delCols	Delete columns from a matrix. [Problem Creation]
problem.delConstraint	Delete one or more constraints from the problem.
problem.delcpcuts	Deletes cuts from the cut pool.
problem.delcuts	Deletes cuts from the matrix at the current node.
problem.delgencons	Delete general constraints from a problem.
problem.delindicators	Delete indicator constraints.
problem.delobj	Removes an objective function from a multi-objective problem.
problem.delpwlcons	Delete piecewise linear constraints from a problem.
problem.delqmatrix	Deletes the quadratic part of a row or of the objective function.
problem.delRows	Delete rows from a matrix. [Problem Creation]
problem.delSets	Delete sets from a problem. [MIP Entities, Problem Creation]
problem.delSOS	Delete one or more SOSs from the problem.
problem.deltolsets	Delete tolerance sets from the current problem
problem.delVariable	Delete one or more variables from the problem.
problem.delvars	Convert SLP variables to normal columns.
problem.dumpcontrols	Displays the list of controls and their current value for those controls that have been set to a non default value.
problem.estimaterowdualranges	Performs a dual side range sensitivity analysis, i.e., calculates estimates for the possible ranges for dual values.
problem.evaluatecoef	Evaluate a coefficient using the current values of the variables
problem.evaluateformula	Evaluate a formula using the current values of the variables
problem.fixmipentities	Fixes all the MIP entities to the values of the last found MIP solution.
problem.fixpenalties	Fixe the values of the error vectors
problem.ftran	Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix.
problem.getAttrib	Retrieves one or more attributes of a problem.
problem.getattribinfo	Accesses the id number and the type information of an attribute given its name.
problem.getbasis	Returns the current basis into the user's data arrays.
problem.getbasisval	Returns the current basis status for a specific col or row.
problem.getCallbackDuals	Obtains the dual values from the solution associated with the current callback.
problem.getCallbackPresolveDuals	Returns the dual values from the solution to the presolved problem associated with the current callback.
problem.getCallbackPresolveRedCosts	Returns the reduced costs from the solution to the presolved problem associated with the current callback.
problem.getCallbackPresolveSlacks	Returns the slack values from the solution to the presolved problem associated with the current callback.
problem.getCallbackPresolveSolution	Returns the solution to the presolved problem associated with the current callback.
problem.getCallbackRedCosts	Obtains the reduced costs from the solution associated with the current callback.
problem.getCallbackSlacks	Obtains the slack values from the solution associated with the current callback.
problem.getCallbackSolution	Obtains the solution associated with the current callback.
problem.getcoef	Returns a single coefficient in the constraint matrix.
problem.getcoefformula	Retrieve a single nonlinear matrix coefficient as a formula split into tokens
problem.getcoefs	Retrieve the list of positions of the nonlinear coefficients in the problem
problem.getcolinfo	Get current column information.
problem.getcols	Returns the nonzeros in the constraint matrix for the columns in a given range.
problem.getcoltype	Returns the column types for the columns in a given range.
problem.getConstraint	Returns one or more constraint of a problem corresponding to one or more indices passed as arguments.
problem.getControl	Retrieves one or more controls of a problem.
problem.getcontrolinfo	Accesses the id number and the type information of a control given its name.
problem.getcpcutlist	Returns a list of cut indices from the cut pool.
problem.getcpcuts	Returns cuts from the cut pool.
problem.getcutlist	Retrieves a list of cuts for the cuts active at the current node.
problem.getcutmap	Returns in which rows a list of cutind are currently loaded into the Optimizer.
problem.getcutslack	Used to calculate the slack value of a cut with respect to the current LP relaxation solution.
problem.getdf	Get a distribution factor
problem.getdirs	Returns the directives that have been loaded into a problem.
problem.getdualray	Retrieves a dual ray (dual unbounded direction) for the current problem, if the problem is found to be infeasible.
problem.getDuals	Obtains the dual values associated with the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getgencons	Returns the general constraints y = f(x1, ..., xn, c1, ..., cm) in a given range.
problem.getiisdata	Returns information for an Irreducible Infeasible Set: size, variables (row and column vectors) and conflicting sides of the variables, duals and reduced costs.
problem.getIndex	Returns the numerical index for a specified row, column, or set of the optimizer.
problem.getIndexFromName	Returns the index for a specified row or column name.
problem.getindicators	Returns the indicator constraint condition (indicator variable and complement flag) associated to the rows in a given range.
problem.getinfeas	Returns a list of infeasible primal and dual variables.
problem.getlastbarsol	Obtains the last barrier solution values following optimization that used the barrier solver.
problem.getlasterror	Returns the error message corresponding to the last error triggered by a library function.
problem.getlb	Returns the lower bounds on the columns in a given range.
problem.getlpsol	Obtains the LP solution values following optimization.
problem.getmessagestatus	Returns the current suppression status of a message: nonzero if the message is not suppressed; 0 otherwise.
problem.getmipentities	Retrieves MIP entity information about a problem.
problem.getmqobj	Returns the nonzeros in the quadratic objective coefficients' matrix for the columns in a given range.
problem.getnamelist	Returns the names for the rows, columns, sets, piecewise linear constraints, general constraints or objectives in a given range.
problem.getobj	Returns the objective function coefficients for the columns in a given range.
problem.getobjn	Returns the coefficients of a given objective function for the columns in a given range.
problem.getOutputEnabled	Returns True if Optimizer messages will be written to the Python output stream, False otherwise.
problem.getpivotorder	Returns the pivot order of the basic variables.
problem.getpivots	Returns a list of potential leaving variables if a specified variable enters the basis.
problem.getpresolvebasis	Returns the current basis from memory into the user's data areas.
problem.getpresolvemap	Returns the mapping of the row and column numbers from the presolve problem back to the original problem.
problem.getpresolvesol	Returns the solution for the presolved problem from memory.
problem.getprimalray	Retrieves a primal ray (primal unbounded direction) for the current problem, if the problem is found to be unbounded.
problem.getpwlcons	Returns the piecewise linear constraints y = f(x) in a given range.
problem.getqobj	Returns a single quadratic objective function coefficient corresponding to the variable pair (objqcol1, objqcol2) of the Hessian matrix.
problem.getqrowcoeff	Returns a single quadratic constraint coefficient corresponding to the variable pair (rowqcol1, rowqcol2) of the Hessian of a given constraint.
problem.getqrowqmatrix	Returns the nonzeros in a quadratic constraint coefficients matrix for the columns in a given range.
problem.getqrowqmatrixtriplets	Returns the nonzeros in a quadratic constraint coefficients matrix as triplets (index pairs with coefficients).
problem.getqrows	Returns a list of row objects that have quadratic coefficients.
problem.getRedCosts	Obtains the reduced costs associated with the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getrhs	Returns the right hand side elements for the rows in a given range.
problem.getrhsrange	Returns the right hand side range values for the rows in a given range.
problem.getRowFlags	Retrieve if a range of rows have been set up as special rows. [Problem Information]
problem.getrowinfo	Get current row information.
problem.getrows	Returns the nonzeros in the constraint matrix for the rows in a given range.
problem.getrowstatus	Retrieve the status setting of a constraint
problem.getrowtype	Returns the row types for the rows in a given range.
problem.getrowwt	Get the initial penalty error weight for a row
problem.getScale	Returns the the current scaling of the matrix. [Numerics]
problem.getscaledinfeas	Returns a list of scaled infeasible primal and dual variables for the original problem.
problem.getSlacks	Obtains the slack values associated with the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getSolution	Obtains the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getSOS	Returns one or more SOSs of a problem corresponding to one or more indices passed as arguments.
problem.gettolset	Retrieve the values of a set of convergence tolerances for an SLP problem
problem.getub	Returns the upper bounds on the columns in a given range.
problem.getunbvec	Returns the index vector which causes the primal simplex or dual simplex algorithm to determine that a problem is primal or dual unbounded respectively.
problem.getvar	Retrieve information about an SLP variable
problem.getVariable	Returns one or more variables of a problem corresponding to one or more indices passed as arguments.
problem.hasdualray	Returns true if a dual ray (dual unbounded direction) exists for the current problem, if the problem is found to be infeasible.
problem.hasprimalray	Returns true if a primal ray (primal unbounded direction) exists for the current problem, if the problem is found to be unbounded.
problem.iisall	Performs an automated search for independent Irreducible Infeasible Sets (IIS) in an infeasible problem.
problem.iisclear	Resets the search for Irreducible Infeasible Sets (IIS).
problem.iisfirst	Initiates a search for an Irreducible Infeasible Set (IIS) in an infeasible problem.
problem.iisisolations	Performs the isolation identification procedure for an Irreducible Infeasible Set (IIS).
problem.iisnext	Continues the search for further Irreducible Infeasible Sets (IIS).
problem.iisstatus	Returns statistics on the Irreducible Infeasible Sets (IIS) found so far.
problem.iiswrite	Writes an LP/MPS/CSV file containing a given Irreducible Infeasible Set (IIS).
problem.interrupt	Interrupts the Optimizer algorithms.
problem.loadbasis	Loads a basis as specified by the user.
problem.loadbranchdirs	Loads directives into the current problem to specify which MIP entities the Optimizer should continue to branch on when a node solution is integer feasible.
problem.loadcoefs	Load non-linear coefficients into the SLP problem
problem.loadcuts	Loads cuts from the cut pool into the matrix.
problem.loaddelayedrows	Specifies that a set of rows in the problem will be treated as delayed rows during a tree search.
problem.loaddfs	Load a set of distribution factors
problem.loaddirs	Loads directives into the problem.
problem.loadlpsol	Loads an LP solution for the problem into the Optimizer.
problem.loadmipsol	Loads a MIP solution for the problem into the Optimizer.
problem.loadmodelcuts	Specifies that a set of rows in the problem will be treated as model cuts.
problem.loadpresolvebasis	Loads a presolved basis from the user's areas.
problem.loadpresolvedirs	Loads directives into the presolved matrix.
problem.loadproblem	Load an optimization problem, possibly with quadratic objective and/or constraints, and integer variables.
problem.loadsecurevecs	Allows the user to mark rows and columns in order to prevent the presolve removing these rows and columns from the problem.
problem.loadtolsets	Load sets of standard tolerance values into an SLP problem
problem.loadvars	Load SLP variables defined as matrix columns into an SLP problem
problem.lpoptimize	Begins a search for the optimal continuous (LP) solution.
problem.mipoptimize	Begins a tree search for the optimal MIP solution.
problem.msaddcustompreset	A combined version of msaddjob and msaddpreset.
problem.msaddjob	Adds a multistart job to the multistart pool
problem.msaddpreset	Loads a preset of jobs into the multistart job pool.
problem.msclear	Removes all scheduled jobs from the multistart job pool
problem.name	Returns the name of the problem as a Python string.
problem.nlpAddFormulas	Add non-linear formulas to the SLP problem. [Problem Modification]
problem.nlpchgformula	Add or replace a single matrix formula using a parsed or unparsed formula
problem.nlpchgformulastr	Add or replace a single matrix formula using a character string for the formula.
problem.nlpDelFormulas	Delete nonlinear formulas from the current problem [Problem Modification]
problem.nlpgetformula	Retrieve a single matrix formula split into tokens
problem.nlpGetFormulaRows	Retrieve the list of positions of the nonlinear formulas in the problem [Problem Information]
problem.nlpgetformulastr	Retrieve a single matrix formula in a character string
problem.nlpLoadFormulas	Load non-linear formulas into the SLP problem [Problem Information]
problem.nlpoptimize	Solves an SLP problem
problem.nlpsetinitval	Set the initial value of a nonlinear variable
problem.objsa	Returns upper and lower sensitivity ranges for specified objective function coefficients.
problem.optimize	Begins a search for the optimal solution of the problem.
problem.pivot	Performs a simplex pivot by bringing variable enter into the basis and removing leave. [Linear Algebra, Simplex]
problem.postsolve	Postsolve the current problem when it is in a presolved state.
problem.postSolveSol	Postsolves a primal solution formulated in the presolved space into the corresponding solution formulated in the original space. The problem itself is unchanged. [Presolve, Solution]
problem.presolve	Perform a nonlinear presolve on the problem
problem.presolverow	Presolves a row formulated in terms of the original variables such that it can be added to a presolved problem.
problem.printevalinfo	Print a summary of any evaluation errors that may have occurred during solving a problem
problem.printIIS	Prints a given Irreducible Infeasible Set (IIS) in the log. [Infeasibility, Logging]
problem.printmemory	Print the dimensions and memory allocations for a problem
problem.read	Read an optimization problem into a Python problem object created prior to the call.
problem.readbasis	Instructs the Optimizer to read in a previously saved basis from a file.
problem.readbinsol	Reads a solution from a binary solution file.
problem.readdirs	Reads a directives file to help direct the tree search.
problem.readslxsol	Reads an ASCII solution file .slx created by the problem.writeslxsol function.
problem.refinemipsol	Runs the MIP solution refiner.
problem.reinitialize	Reset the SLP problem to match a just augmented system
problem.removecbafterobjective	Removes a user after objective callback function previously added by addcbafterobjective.
problem.removecbbariteration	Removes a barrier iteration callback function previously added by addcbbariteration.
problem.removecbbarlog	Removes a newton barrier log callback function previously added by addcbbarlog.
problem.removecbbeforeobjective	Removes a user before objective callback function previously added by addcbbeforeobjective.
problem.removecbchecktime	Removes a callback function previously added by problem.addcbchecktime.
problem.removecbchgbranchobject	Removes a callback function previously added by addcbchgbranchobject.
problem.removecbcutlog	Removes a cut log callback function previously added by addcbcutlog.
problem.removecbcutround	Removes a cut round callback function previously added by addcbcutround.
problem.removecbdestroymt	Removes a slave thread destruction callback function previously added by addcbdestroymt.
problem.removecbgapnotify	Removes a callback function previously added by problem.addcbgapnotify.
problem.removecbinfnode	Removes a user infeasible node callback function previously added by addcbinfnode.
problem.removecbintsol	Removes an integer solution callback function previously added by addcbintsol.
problem.removecblplog	Removes a simplex log callback function previously added by addcblplog.
problem.removecbmessage	Removes a message callback function previously added by addcbmessage.
problem.removecbmiplog	Removes a MIP log callback function previously added by addcbmiplog.
problem.removecbmipthread	Removes a callback function previously added by addcbmipthread.
problem.removecbnewnode	Removes a new-node callback function previously added by addcbnewnode.
problem.removecbnodecutoff	Removes a node-cutoff callback function previously added by addcbnodecutoff.
problem.removecbnodelpsolved	Removes a node lp solved callback function previously added by addcbnodelpsolved.
problem.removecboptnode	Removes a node-optimal callback function previously added by addcboptnode.
problem.removecbpreintsol	Removes a pre-integer solution callback function previously added by addcbpreintsol.
problem.removecbprenode	Removes a preprocess node callback function previously added by addcbprenode.
problem.removecbpresolve	Removes a presolve callback function previously added by addcbpresolve.
problem.removecbusersolnotify	Removes a user solution notification callback previously added by problem.addcbusersolnotify.
problem.repairinfeas	Provides a simplified interface for problem.repairweightedinfeas.
problem.repairweightedinfeas	Attempts to identify a 'solution' that violates a selected set of constraints and bounds minimally, while satisfying all other constraints and bounds.
problem.repairweightedinfeasbounds	An extended version of problem.repairweightedinfeas that allows for bounding the level of relaxation allowed.
problem.reset	Clears all information regarding an optimization problem and returns it to the same status as it would be after creation.
problem.restore	Restores the Optimizer's data structures from a file created by problem.save.
problem.rhssa	Returns upper and lower sensitivity ranges for specified right hand side (RHS) function coefficients.
problem.save	Saves the current data structures, i.e., matrices, control settings and problem attribute settings to file and terminates the run so that optimization can be resumed later.
problem.scale	Re-scales the current problem.
problem.scaling	Analyze the current matrix for largest/smallest coefficients and ratios
problem.setcbcascadeend	Set a user callback to be called at the end of the cascading process, after the last variable has been cascaded
problem.setcbcascadestart	Set a user callback to be called at the start of the cascading process, before any variables have been cascaded
problem.setcbcascadevar	Set a user callback to be called after each column has been cascaded
problem.setcbcascadevarfail	Set a user callback to be called after cascading a column was not successful
problem.setcbcoefevalerror	Set a user callback to be called when an evaluation of a coefficient fails during the solve
problem.setcbconstruct	Set a user callback to be called during the Xpress SLP augmentation process
problem.setcbdestroy	Set a user callback to be called when an SLP problem is about to be destroyed
problem.setcbdrcol	Set a user callback used to override the update of variables with small determining column
problem.setcbintsol	Set a user callback to be called during MISLP when an integer solution is obtained
problem.setcbiterend	Set a user callback to be called at the end of each SLP iteration
problem.setcbiterstart	Set a user callback to be called at the start of each SLP iteration
problem.setcbitervar	Set a user callback to be called after each column has been tested for convergence
problem.setcbmessage	Set a user callback to be called whenever Xpress Nonlinear outputs a line of text
problem.setcbmsjobend	Set a user callback to be called every time a new multistart job finishes.
problem.setcbmsjobstart	Set a user callback to be called every time a new multistart job is created, and the pre-loaded settings are applied
problem.setcbmswinner	Set a user callback to be called every time a new multistart job is created, and the pre-loaded settings are applied
problem.setcboptnode	Set a user callback to be called during MISLP when an optimal SLP solution is obtained at a node
problem.setcbprenode	Set a user callback to be called during MISLP after the set-up of the SLP problem to be solved at a node, but before SLP optimization
problem.setcbpreupdatelinearization	Set a user callback to be called before the linearization is updated
problem.setcbslpend	Set a user callback to be called at the end of the SLP optimization
problem.setcbslpnode	Set a user callback to be called during MISLP after the SLP optimization at each node.
problem.setcbslpstart	Set a user callback to be called at the start of the SLP optimization
problem.setControl	Sets one or more controls of a problem.
problem.setcurrentiv	Transfer the current solution to initial values
problem.setdefaultcontrol	Sets one control to its default value.
problem.setdefaults	Sets all controls to their default values.
problem.setindicators	Specifies that a set of rows in the problem will be treated as indicator constraints during a tree search.
problem.setlogfile	This directs all Optimizer output to a log file.
problem.setmessagestatus	Manages suppression of messages.
problem.setObjective	Sets the objective function of the problem.
problem.setOutputEnabled	Enables or disables writing Optimizer messages to the Python output stream.
problem.setprobname	Sets the current default problem name.
problem.slpchgcoef	Add or change a single matrix coefficient using a parsed or unparsed formula
problem.slpchgcoefstr	Add or change a single matrix coefficient using a string for the formula
problem.slpgetcoefformula	Retrieve a single matrix formula split into tokens
problem.slpgetcoefstr	Retrieve a single matrix coefficient as a formula in a character string
problem.slpSetDetRow	Set the determining row of a variable [Cascading, Data Input, SLP]
problem.sparseBTran	Post-multiplies a (row) vector provided by the user by the inverse of the current matrix. Sparse version of problem.btran. [Linear Algebra, Simplex]
problem.sparseFTran	Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix. Sparse version of problem.ftran. [Linear Algebra, Simplex]
problem.storecuts	Stores cuts into the cut pool, but does not apply them to the current node.
problem.strongbranch	Performs strong branching iterations on all specified bound changes.
problem.strongbranchcb	Performs strong branching iterations on all specified bound changes.
problem.tune	Begin a tuner session for the current problem.
problem.tuneprobsetfile	Begins a tuner session for a set of problems.
problem.tunerreadmethod	Load a user defined tuner method from the given file.
problem.tunerwritemethod	Writes the current tuner method to a given file or prints it to the console.
problem.unconstruct	Reset the SLP problem and removes the augmentation structures
problem.updatelinearization	Updates the current linearization
problem.validate	Validate the feasibility of constraints in a converged solution
problem.validatekkt	Validates the first order optimality conditions also known as the Karush-Kuhn-Tucker (KKT) conditions versus the currect solution
problem.validaterow	Prints an extensive analysis on a given constraint of the SLP problem
problem.validatevector	Validate the feasibility of constraints for a given solution
problem.write	Writes the current problem to an MPS or LP file.
problem.writebasis	Writes the current basis to a file for later input into the Optimizer.
problem.writebinsol	Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer.
problem.writedirs	Writes the tree search directives from the current problem to a directives file.
problem.writeprtsol	Writes the current solution to a fixed format ASCII file, problem_name.prt.
problem.writeslxsol	Creates an ASCII solution file (.slx) using a similar format to MPS files.
problem.writesol	Writes the current solution to a CSV format ASCII file, problem_name.asc(and .hdr).

The following table contains methods that can be called from a problem before optimization has started, to add or remove callbacks.

problem.addcbafterobjective	Declares a callback which will be called after each objective in a multi-objective problem is solved.
problem.addcbbariteration	Declares a barrier iteration callback function, called after each iteration during the interior point algorithm, with the ability to access the current barrier solution/slack/duals or reduced cost values, and to ask barrier to stop.
problem.addcbbarlog	Declares a barrier log callback function, called at each iteration during the interior point algorithm.
problem.addcbbeforeobjective	Declares a callback which will be called before each objective in a multi-objective problem is solved.
problem.addcbchecktime	Declares a callback function which is called every time the Optimizer checks if the time limit has been reached.
problem.addcbchgbranchobject	Declares a callback function that will be called every time the Optimizer has selected a MIP entity for branching.
problem.addcbcutlog	Declares a cut log callback function, called each time the cut log is printed.
problem.addcbcutround	Declares a callback function that is called when the Optimizer could separate cutting planes during the branch and bound search.
problem.addcbdestroymt	Declares a callback function that is called every time a MIP thread is destroyed by the parallel MIP code.
problem.addcbgapnotify	Declares a gap notification callback, to be called when a MIP solve reaches a predefined target, set using the miprelgapnotify, mipabsgapnotify, mipabsgapnotifyobj, and/or mipabsgapnotifybound controls.
problem.addcbinfnode	Declares a user infeasible node callback function, called after the current node has been found to be infeasible during the Branch and Bound search.
problem.addcbintsol	Declares a user integer solution callback function, called every time an integer solution is found by heuristics or during the Branch and Bound search.
problem.addcblplog	Declares a simplex log callback function which is called after every LPLOG iterations of the simplex algorithm.
problem.addcbmessage	Declares an output callback function, called every time a text line relating to the given prob is output by the Optimizer.
problem.addcbmiplog	Declares a MIP log callback function, called each time the MIP log is printed.
problem.addcbmipthread	Declares a MIP thread callback function, called every time a MIP worker problem is created by the parallel MIP code.
problem.addcbnewnode	Declares a callback function that will be called every time a new node is created during the branch and bound search.
problem.addcbnodecutoff	Declares a user node cutoff callback function, called every time a node is cut off as a result of an improved integer solution being found during the branch and bound search.
problem.addcbnodelpsolved	Declares a node LP solved callback function, called during the branch and bound search, after the LP relaxation has been solved for the current node, but before any internal cuts and heuristics have been applied.
problem.addcboptnode	Declares an optimal node callback function, called during the branch and bound search, after the LP relaxation has been solved for the current node, and after any internal cuts and heuristics have been applied, but before the Optimizer checks if the current node should be branched.
problem.addcbpreintsol	Declares a user integer solution callback function, called when an integer solution is found by heuristics or during the branch and bound search, but before it is accepted by the Optimizer.
problem.addcbprenode	Declares a preprocess node callback function, called before the LP relaxation of a node has been optimized, so the solution at the node will not be available.
problem.addcbpresolve	Declares a callback to be called after presolve has been performed.
problem.addcbusersolnotify	Declares a callback function to be called each time a solution added by problem.addmipsol has been processed.
problem.addcoefs	Add non-linear coefficients to the SLP problem
problem.addcols	Add columns to the problem after passing it to the Optimizer using the input routines.
problem.addConstraint	Adds one or more constraints to the problem.
problem.addcuts	Adds cuts directly to the matrix at the current node.
problem.adddfs	Add a set of distribution factors
problem.addgencons	Adds one or more general constraints to the problem.
problem.addIndicator	Adds one or more indicator constraints to the problem.
problem.addManagedCuts	Adds cuts to the Optimizer's internal cut pool from within the cutround callback set by problem.addcbcutround. [Callback, Cuts]
problem.addmipsol	Adds a new feasible, infeasible or partial MIP solution for the problem to the Optimizer.
problem.addnames	Associates names with rows, columns, sets, piecewise linear constraints, general constraints or objectives.
problem.addobj	Appends an objective function with the given coefficients to a multi-objective problem.
problem.addObjective	Adds one or more objective functions to the problem.
problem.addpwlcons	Adds one or more piecewise linear constraints to the problem.
problem.addqmatrix	Adds a new quadratic matrix into a row defined by triplets.
problem.addrows	Adds rows and their coefficient to the problem.
problem.addSets	Allows sets to be added to the problem after passing it to the Optimizer using the input routines. [MIP Entities, Problem Creation]
problem.addSOS	Creates a special ordered set (SOS) constraint within the problem.
problem.addtolsets	Add sets of standard tolerance values to an SLP problem
problem.addVariable	Creates a variable within the problem.
problem.addVariables	Creates a dictionary or NumPy array of variables and adds them to the problem.
problem.addvars	Add SLP variables defined as matrix columns to an SLP problem
problem.basisstability	Returns various measures for the stability of the current basis, including the basis condition number.
problem.bndsa	Returns upper and lower sensitivity ranges for specified variables' lower and upper bounds.
problem.btran	Post-multiplies a (row) vector provided by the user by the inverse of the current basis.
problem.calcobjective	Returns the objective value of a given solution.
problem.calcobjn	Returns the value of a given objective.
problem.calcreducedcosts	Returns the reduced cost values for a given (row) dual solution.
problem.calcslacks	Calculates the row slack values for a given solution.
problem.calcsolinfo	Returns the required property of a solution, like maximum infeasibility of a given primal and duals solution.
problem.cascade	Re-calculate consistent values for SLP variables based on the current values of the remaining variables
problem.cascadeorder	Establish a re-calculation sequence for SLP variables with determining rows.
problem.chgbounds	Changes the bounds on columns in the problem.
problem.chgcascadenlimit	Set a variable specific cascade iteration limit
problem.chgcoef	Changes a single coefficient in the problem.
problem.chgcoltype	Changes the type of a column in the problem.
problem.chgdeltatype	Changes the type of the delta assigned to a nonlinear variable
problem.chgdf	Set or change a distribution factor
problem.chgglblimit	Changes semi-continuous or semi-integer lower bounds, or upper limits on partial integers.
problem.chgmcoef	Change multiple coefficients in the problem.
problem.chgmqobj	Change multiple quadratic coefficients in the objective function.
problem.chgobj	Change the objective function coefficients.
problem.chgobjn	Modifies one or more coefficients of an objective function in a multi-objective problem.
problem.chgobjsense	Changes the problem's objective function objsense to minimize or maximize.
problem.chgqobj	Change a single quadratic coefficient in the objective function corresponding to the variable pair (objqcol1,objqcol2) of the Hessian matrix.
problem.chgqrowcoeff	Changes a single quadratic coefficient in a row.
problem.chgrhs	Changes righthand side values of the problem.
problem.chgrhsrange	Change the range for one or more rows of the problem.
problem.chgrowstatus	Change the status setting of a constraint
problem.chgrowtype	Changes the type of a row in the problem.
problem.chgrowwt	Set or change the initial penalty error weight for a row
problem.chgtolset	Add or change a set of convergence tolerances used for SLP variables
problem.chgvar	Define a column as an SLP variable or change the characteristics and values of an existing SLP variable
problem.clearRowFlags	Clears extra information attached to a range of rows. [Problem Modification]
problem.construct	Create the full augmented SLP matrix and data structures, ready for optimization
problem.copy	Obtains a copy of a problem.
problem.copycallbacks	Copies callback functions defined for one problem to another.
problem.copycontrols	Copies controls defined for one problem to another.
problem.crossoverlpsol	Provides a basic optimal solution for a given solution of an LP problem.
problem.delcoefs	Delete coefficients from the current problem
problem.delCols	Delete columns from a matrix. [Problem Creation]
problem.delConstraint	Delete one or more constraints from the problem.
problem.delcpcuts	Deletes cuts from the cut pool.
problem.delcuts	Deletes cuts from the matrix at the current node.
problem.delgencons	Delete general constraints from a problem.
problem.delindicators	Delete indicator constraints.
problem.delobj	Removes an objective function from a multi-objective problem.
problem.delpwlcons	Delete piecewise linear constraints from a problem.
problem.delqmatrix	Deletes the quadratic part of a row or of the objective function.
problem.delRows	Delete rows from a matrix. [Problem Creation]
problem.delSets	Delete sets from a problem. [MIP Entities, Problem Creation]
problem.delSOS	Delete one or more SOSs from the problem.
problem.deltolsets	Delete tolerance sets from the current problem
problem.delVariable	Delete one or more variables from the problem.
problem.delvars	Convert SLP variables to normal columns.
problem.dumpcontrols	Displays the list of controls and their current value for those controls that have been set to a non default value.
problem.estimaterowdualranges	Performs a dual side range sensitivity analysis, i.e., calculates estimates for the possible ranges for dual values.
problem.evaluatecoef	Evaluate a coefficient using the current values of the variables
problem.evaluateformula	Evaluate a formula using the current values of the variables
problem.fixmipentities	Fixes all the MIP entities to the values of the last found MIP solution.
problem.fixpenalties	Fixe the values of the error vectors
problem.ftran	Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix.
problem.getAttrib	Retrieves one or more attributes of a problem.
problem.getattribinfo	Accesses the id number and the type information of an attribute given its name.
problem.getbasis	Returns the current basis into the user's data arrays.
problem.getbasisval	Returns the current basis status for a specific col or row.
problem.getCallbackDuals	Obtains the dual values from the solution associated with the current callback.
problem.getCallbackPresolveDuals	Returns the dual values from the solution to the presolved problem associated with the current callback.
problem.getCallbackPresolveRedCosts	Returns the reduced costs from the solution to the presolved problem associated with the current callback.
problem.getCallbackPresolveSlacks	Returns the slack values from the solution to the presolved problem associated with the current callback.
problem.getCallbackPresolveSolution	Returns the solution to the presolved problem associated with the current callback.
problem.getCallbackRedCosts	Obtains the reduced costs from the solution associated with the current callback.
problem.getCallbackSlacks	Obtains the slack values from the solution associated with the current callback.
problem.getCallbackSolution	Obtains the solution associated with the current callback.
problem.getcoef	Returns a single coefficient in the constraint matrix.
problem.getcoefformula	Retrieve a single nonlinear matrix coefficient as a formula split into tokens
problem.getcoefs	Retrieve the list of positions of the nonlinear coefficients in the problem
problem.getcolinfo	Get current column information.
problem.getcols	Returns the nonzeros in the constraint matrix for the columns in a given range.
problem.getcoltype	Returns the column types for the columns in a given range.
problem.getConstraint	Returns one or more constraint of a problem corresponding to one or more indices passed as arguments.
problem.getControl	Retrieves one or more controls of a problem.
problem.getcontrolinfo	Accesses the id number and the type information of a control given its name.
problem.getcpcutlist	Returns a list of cut indices from the cut pool.
problem.getcpcuts	Returns cuts from the cut pool.
problem.getcutlist	Retrieves a list of cuts for the cuts active at the current node.
problem.getcutmap	Returns in which rows a list of cutind are currently loaded into the Optimizer.
problem.getcutslack	Used to calculate the slack value of a cut with respect to the current LP relaxation solution.
problem.getdf	Get a distribution factor
problem.getdirs	Returns the directives that have been loaded into a problem.
problem.getdualray	Retrieves a dual ray (dual unbounded direction) for the current problem, if the problem is found to be infeasible.
problem.getDuals	Obtains the dual values associated with the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getgencons	Returns the general constraints y = f(x1, ..., xn, c1, ..., cm) in a given range.
problem.getiisdata	Returns information for an Irreducible Infeasible Set: size, variables (row and column vectors) and conflicting sides of the variables, duals and reduced costs.
problem.getIndex	Returns the numerical index for a specified row, column, or set of the optimizer.
problem.getIndexFromName	Returns the index for a specified row or column name.
problem.getindicators	Returns the indicator constraint condition (indicator variable and complement flag) associated to the rows in a given range.
problem.getinfeas	Returns a list of infeasible primal and dual variables.
problem.getlastbarsol	Obtains the last barrier solution values following optimization that used the barrier solver.
problem.getlasterror	Returns the error message corresponding to the last error triggered by a library function.
problem.getlb	Returns the lower bounds on the columns in a given range.
problem.getlpsol	Obtains the LP solution values following optimization.
problem.getmessagestatus	Returns the current suppression status of a message: nonzero if the message is not suppressed; 0 otherwise.
problem.getmipentities	Retrieves MIP entity information about a problem.
problem.getmqobj	Returns the nonzeros in the quadratic objective coefficients' matrix for the columns in a given range.
problem.getnamelist	Returns the names for the rows, columns, sets, piecewise linear constraints, general constraints or objectives in a given range.
problem.getobj	Returns the objective function coefficients for the columns in a given range.
problem.getobjn	Returns the coefficients of a given objective function for the columns in a given range.
problem.getOutputEnabled	Returns True if Optimizer messages will be written to the Python output stream, False otherwise.
problem.getpivotorder	Returns the pivot order of the basic variables.
problem.getpivots	Returns a list of potential leaving variables if a specified variable enters the basis.
problem.getpresolvebasis	Returns the current basis from memory into the user's data areas.
problem.getpresolvemap	Returns the mapping of the row and column numbers from the presolve problem back to the original problem.
problem.getpresolvesol	Returns the solution for the presolved problem from memory.
problem.getprimalray	Retrieves a primal ray (primal unbounded direction) for the current problem, if the problem is found to be unbounded.
problem.getpwlcons	Returns the piecewise linear constraints y = f(x) in a given range.
problem.getqobj	Returns a single quadratic objective function coefficient corresponding to the variable pair (objqcol1, objqcol2) of the Hessian matrix.
problem.getqrowcoeff	Returns a single quadratic constraint coefficient corresponding to the variable pair (rowqcol1, rowqcol2) of the Hessian of a given constraint.
problem.getqrowqmatrix	Returns the nonzeros in a quadratic constraint coefficients matrix for the columns in a given range.
problem.getqrowqmatrixtriplets	Returns the nonzeros in a quadratic constraint coefficients matrix as triplets (index pairs with coefficients).
problem.getqrows	Returns a list of row objects that have quadratic coefficients.
problem.getRedCosts	Obtains the reduced costs associated with the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getrhs	Returns the right hand side elements for the rows in a given range.
problem.getrhsrange	Returns the right hand side range values for the rows in a given range.
problem.getRowFlags	Retrieve if a range of rows have been set up as special rows. [Problem Information]
problem.getrowinfo	Get current row information.
problem.getrows	Returns the nonzeros in the constraint matrix for the rows in a given range.
problem.getrowstatus	Retrieve the status setting of a constraint
problem.getrowtype	Returns the row types for the rows in a given range.
problem.getrowwt	Get the initial penalty error weight for a row
problem.getScale	Returns the the current scaling of the matrix. [Numerics]
problem.getscaledinfeas	Returns a list of scaled infeasible primal and dual variables for the original problem.
problem.getSlacks	Obtains the slack values associated with the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getSolution	Obtains the incumbent solution during or after optimization with problem.optimize, problem.mipoptimize, problem.lpoptimize or problem.nlpoptimize.
problem.getSOS	Returns one or more SOSs of a problem corresponding to one or more indices passed as arguments.
problem.gettolset	Retrieve the values of a set of convergence tolerances for an SLP problem
problem.getub	Returns the upper bounds on the columns in a given range.
problem.getunbvec	Returns the index vector which causes the primal simplex or dual simplex algorithm to determine that a problem is primal or dual unbounded respectively.
problem.getvar	Retrieve information about an SLP variable
problem.getVariable	Returns one or more variables of a problem corresponding to one or more indices passed as arguments.
problem.hasdualray	Returns true if a dual ray (dual unbounded direction) exists for the current problem, if the problem is found to be infeasible.
problem.hasprimalray	Returns true if a primal ray (primal unbounded direction) exists for the current problem, if the problem is found to be unbounded.
problem.iisall	Performs an automated search for independent Irreducible Infeasible Sets (IIS) in an infeasible problem.
problem.iisclear	Resets the search for Irreducible Infeasible Sets (IIS).
problem.iisfirst	Initiates a search for an Irreducible Infeasible Set (IIS) in an infeasible problem.
problem.iisisolations	Performs the isolation identification procedure for an Irreducible Infeasible Set (IIS).
problem.iisnext	Continues the search for further Irreducible Infeasible Sets (IIS).
problem.iisstatus	Returns statistics on the Irreducible Infeasible Sets (IIS) found so far.
problem.iiswrite	Writes an LP/MPS/CSV file containing a given Irreducible Infeasible Set (IIS).
problem.interrupt	Interrupts the Optimizer algorithms.
problem.loadbasis	Loads a basis as specified by the user.
problem.loadbranchdirs	Loads directives into the current problem to specify which MIP entities the Optimizer should continue to branch on when a node solution is integer feasible.
problem.loadcoefs	Load non-linear coefficients into the SLP problem
problem.loadcuts	Loads cuts from the cut pool into the matrix.
problem.loaddelayedrows	Specifies that a set of rows in the problem will be treated as delayed rows during a tree search.
problem.loaddfs	Load a set of distribution factors
problem.loaddirs	Loads directives into the problem.
problem.loadlpsol	Loads an LP solution for the problem into the Optimizer.
problem.loadmipsol	Loads a MIP solution for the problem into the Optimizer.
problem.loadmodelcuts	Specifies that a set of rows in the problem will be treated as model cuts.
problem.loadpresolvebasis	Loads a presolved basis from the user's areas.
problem.loadpresolvedirs	Loads directives into the presolved matrix.
problem.loadproblem	Load an optimization problem, possibly with quadratic objective and/or constraints, and integer variables.
problem.loadsecurevecs	Allows the user to mark rows and columns in order to prevent the presolve removing these rows and columns from the problem.
problem.loadtolsets	Load sets of standard tolerance values into an SLP problem
problem.loadvars	Load SLP variables defined as matrix columns into an SLP problem
problem.lpoptimize	Begins a search for the optimal continuous (LP) solution.
problem.mipoptimize	Begins a tree search for the optimal MIP solution.
problem.msaddcustompreset	A combined version of msaddjob and msaddpreset.
problem.msaddjob	Adds a multistart job to the multistart pool
problem.msaddpreset	Loads a preset of jobs into the multistart job pool.
problem.msclear	Removes all scheduled jobs from the multistart job pool
problem.name	Returns the name of the problem as a Python string.
problem.nlpAddFormulas	Add non-linear formulas to the SLP problem. [Problem Modification]
problem.nlpchgformula	Add or replace a single matrix formula using a parsed or unparsed formula
problem.nlpchgformulastr	Add or replace a single matrix formula using a character string for the formula.
problem.nlpDelFormulas	Delete nonlinear formulas from the current problem [Problem Modification]
problem.nlpgetformula	Retrieve a single matrix formula split into tokens
problem.nlpGetFormulaRows	Retrieve the list of positions of the nonlinear formulas in the problem [Problem Information]
problem.nlpgetformulastr	Retrieve a single matrix formula in a character string
problem.nlpLoadFormulas	Load non-linear formulas into the SLP problem [Problem Information]
problem.nlpoptimize	Solves an SLP problem
problem.nlpsetinitval	Set the initial value of a nonlinear variable
problem.objsa	Returns upper and lower sensitivity ranges for specified objective function coefficients.
problem.optimize	Begins a search for the optimal solution of the problem.
problem.pivot	Performs a simplex pivot by bringing variable enter into the basis and removing leave. [Linear Algebra, Simplex]
problem.postsolve	Postsolve the current problem when it is in a presolved state.
problem.postSolveSol	Postsolves a primal solution formulated in the presolved space into the corresponding solution formulated in the original space. The problem itself is unchanged. [Presolve, Solution]
problem.presolve	Perform a nonlinear presolve on the problem
problem.presolverow	Presolves a row formulated in terms of the original variables such that it can be added to a presolved problem.
problem.printevalinfo	Print a summary of any evaluation errors that may have occurred during solving a problem
problem.printIIS	Prints a given Irreducible Infeasible Set (IIS) in the log. [Infeasibility, Logging]
problem.printmemory	Print the dimensions and memory allocations for a problem
problem.read	Read an optimization problem into a Python problem object created prior to the call.
problem.readbasis	Instructs the Optimizer to read in a previously saved basis from a file.
problem.readbinsol	Reads a solution from a binary solution file.
problem.readdirs	Reads a directives file to help direct the tree search.
problem.readslxsol	Reads an ASCII solution file .slx created by the problem.writeslxsol function.
problem.refinemipsol	Runs the MIP solution refiner.
problem.reinitialize	Reset the SLP problem to match a just augmented system
problem.removecbafterobjective	Removes a user after objective callback function previously added by addcbafterobjective.
problem.removecbbariteration	Removes a barrier iteration callback function previously added by addcbbariteration.
problem.removecbbarlog	Removes a newton barrier log callback function previously added by addcbbarlog.
problem.removecbbeforeobjective	Removes a user before objective callback function previously added by addcbbeforeobjective.
problem.removecbchecktime	Removes a callback function previously added by problem.addcbchecktime.
problem.removecbchgbranchobject	Removes a callback function previously added by addcbchgbranchobject.
problem.removecbcutlog	Removes a cut log callback function previously added by addcbcutlog.
problem.removecbcutround	Removes a cut round callback function previously added by addcbcutround.
problem.removecbdestroymt	Removes a slave thread destruction callback function previously added by addcbdestroymt.
problem.removecbgapnotify	Removes a callback function previously added by problem.addcbgapnotify.
problem.removecbinfnode	Removes a user infeasible node callback function previously added by addcbinfnode.
problem.removecbintsol	Removes an integer solution callback function previously added by addcbintsol.
problem.removecblplog	Removes a simplex log callback function previously added by addcblplog.
problem.removecbmessage	Removes a message callback function previously added by addcbmessage.
problem.removecbmiplog	Removes a MIP log callback function previously added by addcbmiplog.
problem.removecbmipthread	Removes a callback function previously added by addcbmipthread.
problem.removecbnewnode	Removes a new-node callback function previously added by addcbnewnode.
problem.removecbnodecutoff	Removes a node-cutoff callback function previously added by addcbnodecutoff.
problem.removecbnodelpsolved	Removes a node lp solved callback function previously added by addcbnodelpsolved.
problem.removecboptnode	Removes a node-optimal callback function previously added by addcboptnode.
problem.removecbpreintsol	Removes a pre-integer solution callback function previously added by addcbpreintsol.
problem.removecbprenode	Removes a preprocess node callback function previously added by addcbprenode.
problem.removecbpresolve	Removes a presolve callback function previously added by addcbpresolve.
problem.removecbusersolnotify	Removes a user solution notification callback previously added by problem.addcbusersolnotify.
problem.repairinfeas	Provides a simplified interface for problem.repairweightedinfeas.
problem.repairweightedinfeas	Attempts to identify a 'solution' that violates a selected set of constraints and bounds minimally, while satisfying all other constraints and bounds.
problem.repairweightedinfeasbounds	An extended version of problem.repairweightedinfeas that allows for bounding the level of relaxation allowed.
problem.reset	Clears all information regarding an optimization problem and returns it to the same status as it would be after creation.
problem.restore	Restores the Optimizer's data structures from a file created by problem.save.
problem.rhssa	Returns upper and lower sensitivity ranges for specified right hand side (RHS) function coefficients.
problem.save	Saves the current data structures, i.e., matrices, control settings and problem attribute settings to file and terminates the run so that optimization can be resumed later.
problem.scale	Re-scales the current problem.
problem.scaling	Analyze the current matrix for largest/smallest coefficients and ratios
problem.setcbcascadeend	Set a user callback to be called at the end of the cascading process, after the last variable has been cascaded
problem.setcbcascadestart	Set a user callback to be called at the start of the cascading process, before any variables have been cascaded
problem.setcbcascadevar	Set a user callback to be called after each column has been cascaded
problem.setcbcascadevarfail	Set a user callback to be called after cascading a column was not successful
problem.setcbcoefevalerror	Set a user callback to be called when an evaluation of a coefficient fails during the solve
problem.setcbconstruct	Set a user callback to be called during the Xpress SLP augmentation process
problem.setcbdestroy	Set a user callback to be called when an SLP problem is about to be destroyed
problem.setcbdrcol	Set a user callback used to override the update of variables with small determining column
problem.setcbintsol	Set a user callback to be called during MISLP when an integer solution is obtained
problem.setcbiterend	Set a user callback to be called at the end of each SLP iteration
problem.setcbiterstart	Set a user callback to be called at the start of each SLP iteration
problem.setcbitervar	Set a user callback to be called after each column has been tested for convergence
problem.setcbmessage	Set a user callback to be called whenever Xpress Nonlinear outputs a line of text
problem.setcbmsjobend	Set a user callback to be called every time a new multistart job finishes.
problem.setcbmsjobstart	Set a user callback to be called every time a new multistart job is created, and the pre-loaded settings are applied
problem.setcbmswinner	Set a user callback to be called every time a new multistart job is created, and the pre-loaded settings are applied
problem.setcboptnode	Set a user callback to be called during MISLP when an optimal SLP solution is obtained at a node
problem.setcbprenode	Set a user callback to be called during MISLP after the set-up of the SLP problem to be solved at a node, but before SLP optimization
problem.setcbpreupdatelinearization	Set a user callback to be called before the linearization is updated
problem.setcbslpend	Set a user callback to be called at the end of the SLP optimization
problem.setcbslpnode	Set a user callback to be called during MISLP after the SLP optimization at each node.
problem.setcbslpstart	Set a user callback to be called at the start of the SLP optimization
problem.setControl	Sets one or more controls of a problem.
problem.setcurrentiv	Transfer the current solution to initial values
problem.setdefaultcontrol	Sets one control to its default value.
problem.setdefaults	Sets all controls to their default values.
problem.setindicators	Specifies that a set of rows in the problem will be treated as indicator constraints during a tree search.
problem.setlogfile	This directs all Optimizer output to a log file.
problem.setmessagestatus	Manages suppression of messages.
problem.setObjective	Sets the objective function of the problem.
problem.setOutputEnabled	Enables or disables writing Optimizer messages to the Python output stream.
problem.setprobname	Sets the current default problem name.
problem.slpchgcoef	Add or change a single matrix coefficient using a parsed or unparsed formula
problem.slpchgcoefstr	Add or change a single matrix coefficient using a string for the formula
problem.slpgetcoefformula	Retrieve a single matrix formula split into tokens
problem.slpgetcoefstr	Retrieve a single matrix coefficient as a formula in a character string
problem.slpSetDetRow	Set the determining row of a variable [Cascading, Data Input, SLP]
problem.sparseBTran	Post-multiplies a (row) vector provided by the user by the inverse of the current matrix. Sparse version of problem.btran. [Linear Algebra, Simplex]
problem.sparseFTran	Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix. Sparse version of problem.ftran. [Linear Algebra, Simplex]
problem.storecuts	Stores cuts into the cut pool, but does not apply them to the current node.
problem.strongbranch	Performs strong branching iterations on all specified bound changes.
problem.strongbranchcb	Performs strong branching iterations on all specified bound changes.
problem.tune	Begin a tuner session for the current problem.
problem.tuneprobsetfile	Begins a tuner session for a set of problems.
problem.tunerreadmethod	Load a user defined tuner method from the given file.
problem.tunerwritemethod	Writes the current tuner method to a given file or prints it to the console.
problem.unconstruct	Reset the SLP problem and removes the augmentation structures
problem.updatelinearization	Updates the current linearization
problem.validate	Validate the feasibility of constraints in a converged solution
problem.validatekkt	Validates the first order optimality conditions also known as the Karush-Kuhn-Tucker (KKT) conditions versus the currect solution
problem.validaterow	Prints an extensive analysis on a given constraint of the SLP problem
problem.validatevector	Validate the feasibility of constraints for a given solution
problem.write	Writes the current problem to an MPS or LP file.
problem.writebasis	Writes the current basis to a file for later input into the Optimizer.
problem.writebinsol	Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer.
problem.writedirs	Writes the tree search directives from the current problem to a directives file.
problem.writeprtsol	Writes the current solution to a fixed format ASCII file, problem_name.prt.
problem.writeslxsol	Creates an ASCII solution file (.slx) using a similar format to MPS files.
problem.writesol	Writes the current solution to a CSV format ASCII file, problem_name.asc(and .hdr).

© 2001-2025 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.

Contents

Index

Glossary

Search Results

Methods of the class problem