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.addAfterObjectiveCallback	Declares a callback which will be called after each objective in a multi-objective problem is solved. [Callback, Multiobjective]
problem.addBarIterationCallback	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. This callback function will be called in addition to any callbacks already added by problem.addBarIterationCallback. This functionality is not available for the hybrid gradient method. [Barrier, Callback]
problem.addBarlogCallback	Declares a barrier log callback function, called at each iteration during the interior point algorithm. This callback function will be called in addition to any barrier log callbacks already added by problem.addBarlogCallback. This functionality is not available for the hybrid gradient method. [Barrier, Callback]
problem.addBeforeObjectiveCallback	Declares a callback which will be called before each objective in a multi-objective problem is solved. [Callback, Multiobjective]
problem.addChangeBranchObjectCallback	Declares a callback function that will be called after the selection of a MIP entity to branch on. [Branching, Callback]
problem.addCheckTimeCallback	Declares a callback function which is called every time the Optimizer checks if the time limit has been reached. This callback function will be called in addition to any callbacks already added by problem.addCheckTimeCallback. [Callback, Limits]
problem.addCols	Adds columns to the optimizer matrix. [Problem Creation]
problem.addComputeRestartCallback	Declares a callback to be called when a solve executed in compute mode needs to be restarted. [Callback, Compute Interface]
problem.addConstraint	Adds one or more constraints to the problem.
problem.addCutlogCallback	Declares a cut log callback function, called each time the cut log is printed. [Callback, Logging]
problem.addCutRoundCallback	Declares a callback function that is called when the Optimizer could separate cutting planes during the branch and bound search. [Callback, Cuts]
problem.addCuts	Adds cuts directly to the matrix at the current node. [Cuts]
problem.addGapNotifyCallback	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. [Callback, Limits]
problem.addGenCons	Adds one or more general constraints to the problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.addIndicator	Adds one or more indicator constraints to the problem.
problem.addInfnodeCallback	Declares a user infeasible node callback function, called after the current node has been found to be infeasible during the Branch and Bound search. [Branch and Bound Search, Callback]
problem.addIntsolCallback	Declares a user integer solution callback function, called every time an integer solution is found by heuristics or during the Branch and Bound search. This callback function will be called in addition to any callbacks already added by problem.addIntsolCallback. [Callback, Solution]
problem.addLplogCallback	Declares a simplex log callback function which is called after every LPLOG iterations of the simplex algorithm. This callback function will be called in addition to any callbacks already added by problem.addLplogCallback. [Callback, LP]
problem.addManagedCuts	Adds cuts to the Optimizer's internal cut pool from within the cutround callback set by problem.addCutRoundCallback. [Callback, Cuts]
problem.addMessageCallback	Declares an output callback function, called every time a text line relating to the given problem is output by the Optimizer. [Callback, Logging]
problem.addMiplogCallback	Declares a MIP log callback function, called each time the MIP log is printed. This callback function will be called in addition to any callbacks already added by problem.addMiplogCallback. [Callback, Logging]
problem.addMipSol	Adds a new feasible, infeasible or partial MIP solution for the problem to the Optimizer. [Solution]
problem.addMipThreadCallback	Declares a MIP thread callback function, called every time a MIP worker problem is created by the parallel MIP code. This callback function will be called in addition to any callbacks already added by problem.addMipThreadCallback. [Callback, Parallel]
problem.addMipThreadDestroyCallback	Declares a destroy MIP thread callback function, called every time a MIP thread is destroyed by the parallel MIP code. This callback function will be called in addition to any callbacks already added by problem.addMipThreadDestroyCallback. [Callback, Parallel]
problem.addMsJobEndCallback	Add a user callback to be called every time a new multistart job finishes. Can be used to overwrite the default solution ranking function [Callback, Multistart]
problem.addMsJobStartCallback	Add a user callback to be called every time a new multistart job is created, and the pre-loaded settings are applied [Callback, Multistart]
problem.addMsWinnerCallback	Add a user callback to be called every time a multistart winner has been declared [Callback, Multistart]
problem.addNames	When a model is loaded, the rows, columns, sets, piecewise linear and general constraints of the model may not have names associated with them. [Problem Creation]
problem.addNewnodeCallback	Declares a callback function that will be called every time a new node is created during the branch and bound search. This callback function will be called in addition to any callbacks already added by problem.addNewnodeCallback. [Branch and Bound Search, Callback]
problem.addNlpCoefEvalErrorCallback	Add a user callback to be called when an evaluation of a coefficient fails during the solve [Callback, Numerics]
problem.addNodecutoffCallback	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. This callback function will be called in addition to any callbacks already added by problem.addNodecutoffCallback. [Branch and Bound Search, Callback]
problem.addNodeLPSolvedCallback	Declares a 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. This callback function will be called in addition to any callbacks already added by problem.addNodeLPSolvedCallback. [Branch and Bound Search, Callback]
problem.addObj	Appends an objective function with the given coefficients to a multi-objective problem. The weight and priority of the objective are set to the given values. [Multiobjective, Problem Creation]
problem.addObjective	Adds one or more objective functions to the problem.
problem.addOptnodeCallback	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. This callback function will be called in addition to any callbacks already added by problem.addOptnodeCallback. [Branch and Bound Search, Callback]
problem.addPreIntsolCallback	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. [Callback, Solution]
problem.addPrenodeCallback	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. This callback function will be called in addition to any callbacks already added by problem.addPrenodeCallback. [Branch and Bound Search, Callback]
problem.addPresolveCallback	Declares a callback to be called after presolve has been performed. [Callback, Presolve]
problem.addPwlCons	Adds one or more piecewise linear constraints to the problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.addQMatrix	Adds a new quadratic matrix into a row defined by triplets. [Problem Creation, Quadratic]
problem.addRows	Adds rows to the optimizer matrix. [Problem Creation]
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.addSlpCascadeEndCallback	Add a user callback to be called at the end of the cascading process, after the last variable has been cascaded [Callback, Cascading, SLP]
problem.addSlpCascadeStartCallback	Add a user callback to be called at the start of the cascading process, before any variables have been cascaded [Callback, Cascading, SLP]
problem.addSlpCascadeVarCallback	Add a user callback to be called after each column has been cascaded [Callback, Cascading, SLP]
problem.addSlpCascadeVarFailCallback	Add a user callback to be called after cascading a column was not successful [Callback, Cascading, SLP]
problem.addSlpConstructCallback	Add a user callback to be called during the Xpress-SLP augmentation process [Callback, SLP]
problem.addSlpDrColCallback	Add a user callback used to override the update of variables with small determining column [Callback, Cascading, SLP]
problem.addSlpIntSolCallback	Add a user callback to be called during MISLP when an integer solution is obtained [Callback, MISLP]
problem.addSlpIterEndCallback	Add a user callback to be called at the end of each SLP iteration [Callback, SLP]
problem.addSlpIterStartCallback	Add a user callback to be called at the start of each SLP iteration [Callback, SLP]
problem.addSlpIterVarCallback	Add a user callback to be called after each column has been tested for convergence [Callback, SLP, SLP-convergence]
problem.addSlpPreUpdateLinearizationCallback	Add a user callback to be called before the linearization is updated [Callback, SLP]
problem.addSOS	Creates a special ordered set (SOS) constraint within the problem.
problem.addUserSolNotifyCallback	Declares a callback function to be called each time a solution added by problem.addMipSol has been processed. This callback function will be called in addition to any callbacks already added by problem.addUserSolNotifyCallback. [Callback, Solution]
problem.addVariable	Creates a variable within the problem.
problem.addVariables	Creates a dictionary or array of variables and adds them to the problem.
problem.basisStability	Calculates various measures for the stability of the current basis, including the basis condition number. [Linear Algebra, LP]
problem.bndSA	Returns upper and lower sensitivity ranges for specified variables' lower and upper bounds. [LP, Sensitivity Analysis]
problem.BTran	Post-multiplies a (row) vector provided by the user by the inverse of the current basis. [Linear Algebra, LP]
problem.calcObjective	Calculates the objective value of a given solution. [Solution]
problem.calcObjN	Calculates the objective value of the given objective function in a multi-objective problem. [Multiobjective, Solution]
problem.calcReducedCosts	Calculates the reduced cost values for a given (row) dual solution. [Linear Algebra, Solution]
problem.calcSlacks	Calculates the row slack values for a given solution. [Solution]
problem.calcSolInfo	Calculates the required property of a solution, like maximum infeasibility of a given primal and dual solution. [Solution]
problem.chgBounds	Used to change the bounds on columns in the matrix. [Problem Modification]
problem.chgCoef	Used to change a single coefficient in the matrix. [Problem Modification]
problem.chgColType	Used to change the type of a specified set of columns in the matrix. [MIP Entities, Problem Modification]
problem.chgGlbLimit	Used to change semi-continuous or semi-integer lower bounds, or upper limits on partial integers. [MIP Entities, Problem Modification]
problem.chgMCoef	Used to change multiple coefficients in the matrix. [Problem Modification]
problem.chgMQObj	Used to change multiple quadratic coefficients in the objective function. If any of the coefficients does not exist already, new coefficients will be added to the objective function. [Problem Modification, Quadratic]
problem.chgObj	Used to change the objective function coefficients. [Problem Modification]
problem.chgObjN	Modifies one or more coefficients of an objective function in a multi-objective problem. [Multiobjective, Problem Modification]
problem.chgObjSense	Changes the problem's objective function sense to minimize or maximize. [Problem Modification]
problem.chgQObj	Used to change a single quadratic coefficient in the objective function corresponding to the variable pair (objqcol1,objqcol2) of the Hessian matrix. [Problem Modification, Quadratic]
problem.chgQRowCoeff	Changes a single quadratic coefficient in a row. [Problem Modification, Quadratic]
problem.chgRHS	Used to change righthand side values of the problem. [Problem Modification]
problem.chgRHSRange	Used to change the range for a row of the problem matrix. [Problem Modification]
problem.chgRowType	Used to change the type of a row in the matrix. [Problem Modification]
problem.clearIIS	Resets the search for Irreducible Infeasible Sets (IIS). [Infeasibility]
problem.clearRowFlags	Clears extra information attached to a range of rows. [Problem Modification]
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. [Barrier, LP]
problem.delCols	Delete columns from a matrix. [Problem Creation]
problem.delConstraint	Delete one or more constraints from the problem.
problem.delCPCuts	During the branch and bound search, cuts are stored in the cut pool to be applied at descendant nodes. [Cuts]
problem.delCuts	Deletes cuts from the matrix at the current node. [Cuts]
problem.delGenCons	Delete general constraints from a problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.delIndicators	Delete indicator constraints. [MIP Entities, Problem Creation]
problem.delObj	Removes an objective function from the problem. [Problem Creation]
problem.delPwlCons	Delete piecewise linear constraints from a problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.delQMatrix	Deletes the quadratic part of a row or of the objective function. [Problem Creation, Quadratic]
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.delVariable	Delete one or more variables from the problem.
problem.dumpControls	Displays the list of controls and their current value for those controls that have been set to a non default value. [Controls and Attributes]
problem.estimateRowDualRanges	Performs a dual side range sensitivity analysis, i.e. [LP, Sensitivity Analysis]
problem.firstIIS	Initiates a search for an Irreducible Infeasible Set (IIS) in an infeasible problem. [Infeasibility]
problem.fixMIPEntities	Fixes all the MIP entities to the values of the last found MIP solution. [MIP Entities, Problem Modification]
problem.FTran	Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix. [Linear Algebra, LP]
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. [Controls and Attributes]
problem.getBasis	Returns the current basis into the user's data arrays. [Linear Algebra, LP]
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. [Callback, Solution]
problem.getCallbackPresolveRedCosts	Returns the reduced costs from the solution to the presolved problem associated with the current callback. [Callback, Solution]
problem.getCallbackPresolveSlacks	Returns the slack values from the solution to the presolved problem associated with the current callback. [Callback, Solution]
problem.getCallbackPresolveSolution	Returns the solution to the presolved problem associated with the current callback. [Callback, Solution]
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 Information]
problem.getCols	Returns the nonzeros in the constraint matrix for the columns in a given range. [Problem Information]
problem.getColType	Returns the column types for the columns in a given range. [MIP Entities, Problem Information]
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. [Controls and Attributes]
problem.getCPCutList	Returns a list of cut indices from the cut pool. [Cuts]
problem.getCPCuts	Returns cuts from the cut pool. [Cuts]
problem.getCutList	Retrieves a list of cut pointers for the cuts active at the current node. [Cuts]
problem.getCutMap	Used to return in which rows a list of cuts are currently loaded into the Optimizer. This is useful for example to retrieve the duals associated with active cuts. [Cuts]
problem.getCutSlack	Used to calculate the slack value of a cut with respect to the current LP relaxation solution. [Cuts]
problem.getDirs	Used to return the directives that have been loaded into a matrix. [Branching, Problem Information]
problem.getDualRay	Retrieves a dual ray (dual unbounded direction) for the current problem, if the problem is found to be infeasible. [LP, Solution]
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. [Piecewise Linear and General Constraints, Problem Information]
problem.getIISData	Returns information for an Irreducible Infeasible Set: size, variables and constraints (row and column vectors), and conflicting sides of the variables. For pure linear problems there is also information on duals, reduced costs and isolations. [Infeasibility]
problem.getIndex	Returns the index for a specified row or column name. [Problem Information]
problem.getIndicators	Returns the indicator constraint condition (indicator variable and complement flag) associated to the rows in a given range. [Problem Information]
problem.getInfeas	Returns a list of infeasible primal and dual variables. [LP, Solution]
problem.getLastBarSol	Used to obtain the last barrier solution values following optimization that used the barrier solver. [Barrier, Solution]
problem.getLB	Returns the lower bounds for the columns in a given range. [Problem Information]
problem.getLpSol	Used to obtain the LP solution values following optimization. [LP, Solution]
problem.getMessageStatus	Retrieves the current suppression status of a message. [Misc]
problem.getMIPEntities	Retrieves integr and entity information about a problem. It must be called before problem.mipOptimize if the presolve option is used. [MIP Entities, Problem Information]
problem.getMQObj	Returns the nonzeros in the quadratic objective coefficients matrix for the columns in a given range. [Problem Information, Quadratic]
problem.getNameList	Returns the names for the rows, columns, sets, piecewise linear constraints, general constraints or objectives in a given range. [Names Manager]
problem.getObj	Returns the objective function coefficients for the columns in a given range. [Problem Information]
problem.getObjN	For a given objective function, returns the objective coefficients for the columns in a given range. [Multiobjective, Problem Information]
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. [LP, Simplex]
problem.getPivots	Returns a list of potential leaving variables if a specified variable enters the basis. [LP, Simplex]
problem.getPresolveBasis	Returns the current basis from memory into the user's data areas. [LP, Simplex]
problem.getPresolveMap	Returns the mapping of the row and column numbers from the presolve problem back to the original problem. [Presolve, Problem Information]
problem.getPresolveSol	Returns the solution for the presolved problem from memory. [Presolve, Solution]
problem.getPrimalRay	Retrieves a primal ray (primal unbounded direction) for the current problem, if the problem is found to be unbounded. [LP, Solution]
problem.getProbName	Returns the current problem name. [Problem Information]
problem.getPwlCons	Returns the piecewise linear constraints y = f(x) in a given range. [Piecewise Linear and General Constraints, Problem Information]
problem.getQObj	Returns a single quadratic objective function coefficient corresponding to the variable pair (objqcol1, objqcol2) of the Hessian matrix. [Problem Information, Quadratic]
problem.getQRowCoeff	Returns a single quadratic constraint coefficient corresponding to the variable pair (rowqcol1, rowqcol2) of the Hessian of a given constraint. [Problem Information, Quadratic]
problem.getQRowQMatrix	Returns the nonzeros in a quadratic constraint coefficients matrix for the columns in a given range. [Problem Information, Quadratic]
problem.getQRowQMatrixTriplets	Returns the nonzeros in a quadratic constraint coefficients matrix as triplets (index pairs with coefficients). [Problem Information, Quadratic]
problem.getQRows	Returns the list indices of the rows that have quadratic coefficients. [Problem Information, Quadratic]
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 Information]
problem.getRHSRange	Returns the right hand side range values for the rows in a given range. [Problem Information]
problem.getRowFlags	Retrieve if a range of rows have been set up as special rows. [Problem Information]
problem.getRows	Returns the nonzeros in the constraint matrix for the rows in a given range. [Problem Information]
problem.getRowType	Returns the row types for the rows in a given range. [Problem Information]
problem.getScale	Returns the the current scaling of the matrix. [Numerics]
problem.getScaledInfeas	Returns a list primal and dual variables that are infeasible for the scaled original problem. If the problem is currently presolved, it is postsolved before the function returns. [LP, Numerics]
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.getUB	Returns the upper bounds for the columns in a given range. [Problem Information]
problem.getUnbVec	Returns the index vector which causes the primal simplex or dual simplex algorithm to determine that a matrix is primal or dual unbounded respectively. [LP, Solution]
problem.getVariable	Returns one or more variables of a problem corresponding to one or more indices passed as arguments.
problem.IISAll	Performs an automated search for independent Irreducible Infeasible Sets (IIS) in an infeasible problem. [Infeasibility]
problem.IISIsolations	Performs the isolation identification procedure for an Irreducible Infeasible Set (IIS). This function applies only to linear problems. [Infeasibility]
problem.IISStatus	Returns statistics on the Irreducible Infeasible Sets (IIS) found so far by problem.firstIIS, problem.nextIIS or problem.IISAll. [Infeasibility]
problem.interrupt	Interrupts the Optimizer algorithms. [Solution Process]
problem.loadBasis	Loads a basis from the user's areas. [Data Input, LP]
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. [Branching, Data Input]
problem.loadCuts	Loads cuts from the cut pool into the matrix. [Cuts, Data Input]
problem.loadDelayedRows	Specifies that a set of rows in the matrix will be treated as delayed rows during a tree search. [Cuts, Problem Input]
problem.loadDirs	Loads directives into the matrix. [Data Input]
problem.loadLP	Enables the user to pass a matrix directly to the Optimizer, rather than reading the matrix from a file. [LP, Problem Input]
problem.loadLPSol	Loads an LP solution for the problem into the Optimizer. [Data Input, LP, Solution]
problem.loadMIP	Used to load a MIP problem into the Optimizer data structures. [MIP Entities, Problem Input]
problem.loadMipSol	Loads a starting MIP solution for the problem into the Optimizer. [Data Input, MIP Entities, Solution]
problem.loadMIQCQP	Used to load a mixed integer quadratic problem with quadratic constraints into the Optimizer data structure. [Problem Input, Quadratic]
problem.loadMIQP	Used to load a MIQP problem, hence a MIP with quadratic objective coefficients, into the Optimizer data structures. [Problem Input, Quadratic]
problem.loadModelCuts	Specifies that a set of rows in the matrix will be treated as model cuts. [Cuts, Data Input]
problem.loadPresolveBasis	Loads a presolved basis from the user's areas. [Data Input, LP]
problem.loadPresolveDirs	Loads directives into the presolved matrix. [Branching, Data Input]
problem.loadQCQP	Used to load a quadratic problem with quadratic side constraints into the Optimizer data structure. [Problem Input, Quadratic]
problem.loadQP	Used to load a quadratic problem into the Optimizer data structure. [Problem Input, Quadratic]
problem.loadSecureVecs	Allows the user to mark rows and columns in order to prevent the presolve removing these rows and columns from the matrix. [Data Input, Presolve]
problem.lpOptimize	This function begins a search for the optimal continuous (LP) solution. [LP, Solution Process]
problem.mipOptimize	This function begins a tree search for the optimal MIP solution. [MIP Entities, Solution Process]
problem.msAddCustomPreset	A combined version of problem.msAddJob and problem.msAddPreset. [Data Input, Multistart]
problem.msAddJob	Adds a multistart job to the multistart pool [Data Input, Multistart]
problem.msAddPreset	Loads a preset of jobs into the multistart job pool. [Data Input, Multistart]
problem.msClear	Removes all scheduled jobs from the multistart job pool [Multistart]
problem.nextIIS	Continues the search for further Irreducible Infeasible Sets (IIS), or calls problem.firstIIS if no IIS has been identified yet. [Infeasibility]
problem.nlpAddFormulas	Add non-linear formulas to the SLP problem. [Problem Modification]
problem.nlpCalcSlacks	Calculate the slack values for the provided solution in the non-linear problem [Solution]
problem.nlpChgFormula	Add or replace a single matrix formula using a parsed or unparsed formula [Problem Modification]
problem.nlpChgFormulaStr	Add or replace a single matrix formula using a character string for the formula. [Problem Modification]
problem.nlpCurrentIV	Transfer the current solution to initial values [Data Input]
problem.nlpDelFormulas	Delete nonlinear formulas from the current problem [Problem Modification]
problem.nlpEvaluateFormula	Evaluate a formula using the current values of the variables [Solution]
problem.nlpGetFormula	Retrieve a single matrix formula as a formula split into tokens. [Problem Information]
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 Information]
problem.nlpLoadFormulas	Load non-linear formulas into the SLP problem [Problem Information]
problem.nlpOptimize	Maximize or minimize an SLP problem [Solution Process]
problem.nlpPostsolveProb	Restores the problem to its pre-solve state [Presolve]
problem.nlpPrintEvalInfo	Print a summary of any evaluation errors that may have occurred during solving a problem [Logging]
problem.nlpSetInitVal	Set the initial value of a variable [Data Input]
problem.nlpValidate	Validate the feasibility of constraints in a converged solution [Solution]
problem.nlpValidateKKT	Validates the first order optimality conditions also known as the Karush-Kuhn-Tucker (KKT) conditions versus the currect solution [Solution]
problem.nlpValidateRow	Prints an extensive analysis on a given constraint of the SLP problem [Solution]
problem.nlpValidateVector	Validate the feasibility of constraints for a given solution [Solution]
problem.objSA	Returns upper and lower sensitivity ranges for specified objective function coefficients. [LP, Sensitivity Analysis]
problem.optimize	This function begins a search for the optimal solution of the problem. [Solution Process]
problem.pivot	Performs a simplex pivot by bringing variable enter into the basis and removing leave. [Linear Algebra, Simplex]
problem.postSolve	Postsolve the current matrix when it is in a presolved state. [Presolve, Solution Process]
problem.postSolveSol	Postsolves a primal solution formulated in the presolved space into the corresponding solution formulated in the input space. The problem itself is unchanged. [Presolve, Solution]
problem.presolveRow	Presolves a row formulated in terms of the original variables such that it can be added to a presolved matrix. [Misc, Presolve]
problem.presolveSol	Presolves a primal solution formulated in the input space into the corresponding solution formulated in the presolved space. The problem itself is unchanged. [Presolve, Solution]
problem.printIIS	Prints a given Irreducible Infeasible Set (IIS) in the log. [Infeasibility, Logging]
problem.readBasis	Instructs the Optimizer to read in a previously saved basis from a file. [File IO, LP]
problem.readBinSol	Reads a solution from a binary solution file. [File IO, Solution]
problem.readDirs	Reads a directives file to help direct the tree search. [Branching, File IO]
problem.readProb	Reads an (X)MPS or LP format matrix from file. [File IO, Problem Creation]
problem.readSlxSol	Reads an ASCII solution file .slx created by the problem.writeSlxSol function. [File IO, Solution]
problem.removeAfterObjectiveCallback	Removes a callback function previously added by problem.addAfterObjectiveCallback. [Callback, Multiobjective]
problem.removeBarIterationCallback	Removes a barrier iteration callback function previously added by problem.addBarIterationCallback. The specified callback function will no longer be called after it has been removed. [Barrier, Callback]
problem.removeBarlogCallback	Removes a Newton barrier log callback function previously added by problem.addBarlogCallback. The specified callback function will no longer be called after it has been removed. [Barrier, Callback]
problem.removeBeforeObjectiveCallback	Removes a callback function previously added by problem.addBeforeObjectiveCallback. [Callback, Multiobjective]
problem.removeChangeBranchObjectCallback	Removes a callback function previously added by problem.addChangeBranchObjectCallback. [Branching, Callback]
problem.removeCheckTimeCallback	Removes a callback function previously added by problem.addCheckTimeCallback. [Callback, Limits]
problem.removeComputeRestartCallback	Removes a computerestart callback function previously added by problem.addComputeRestartCallback. The specified callback function will no longer be called after it has been removed. [Callback, Compute Interface]
problem.removeCutlogCallback	Removes a cut log callback function previously added by problem.addCutlogCallback. [Callback, Logging]
problem.removeCutRoundCallback	Removes a cut round callback function previously added by problem.addCutRoundCallback. [Callback, Cuts]
problem.removeGapNotifyCallback	Removes a callback function previously added by problem.addGapNotifyCallback. [Callback, Limits]
problem.removeInfnodeCallback	Removes a user infeasible node callback function previously added by problem.addInfnodeCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removeIntsolCallback	Removes an integer solution callback function previously added by problem.addIntsolCallback. The specified callback function will no longer be called after it has been removed. [Callback, Solution]
problem.removeLplogCallback	Removes a simplex log callback function previously added by problem.addLplogCallback. The specified callback function will no longer be called after it has been removed. [Callback, Logging]
problem.removeMessageCallback	Removes a message callback function previously added by problem.addMessageCallback. [Callback, Logging]
problem.removeMiplogCallback	Removes a MIP log callback function previously added by problem.addMiplogCallback. The specified callback function will no longer be called after it has been removed. [Callback, Logging]
problem.removeMipThreadCallback	Removes a callback function previously added by problem.addMipThreadCallback. [Callback, Parallel]
problem.removeMipThreadDestroyCallback	Removes a child thread destruction callback function previously added by problem.addMipThreadDestroyCallback. The specified callback function will no longer be called after it has been removed. [Callback, Parallel]
problem.removeMsJobEndCallback	Removes a callback function previously added by problem.addMsJobEndCallback. [Callback, Multistart]
problem.removeMsJobStartCallback	Removes a callback function previously added by problem.addMsJobStartCallback. [Callback, Multistart]
problem.removeMsWinnerCallback	Removes a callback function previously added by problem.addMsWinnerCallback. [Callback, Multistart]
problem.removeNewnodeCallback	Removes a new-node callback function previously added by problem.addNewnodeCallback. [Branch and Bound Search, Callback]
problem.removeNlpCoefEvalErrorCallback	Removes a callback function previously added by problem.addNlpCoefEvalErrorCallback. The specified callback function will no longer be called after it has been removed. [Callback, Numerics]
problem.removeNodecutoffCallback	Removes a node-cutoff callback function previously added by problem.addNodecutoffCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removeNodeLPSolvedCallback	Removes a node callback function previously added by problem.addNodeLPSolvedCallback. [Branch and Bound Search, Callback]
problem.removeOptnodeCallback	Removes a node-optimal callback function previously added by problem.addOptnodeCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removePreIntsolCallback	Removes a pre-integer solution callback function previously added by problem.addPreIntsolCallback. The specified callback function will no longer be called after it has been removed. [Callback, Solution]
problem.removePrenodeCallback	Removes a preprocess node callback function previously added by problem.addPrenodeCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removePresolveCallback	Removes a presolve callback function previously added by problem.addPresolveCallback. [Callback, Presolve]
problem.removeSlpCascadeEndCallback	Removes a callback function previously added by problem.addSlpCascadeEndCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpCascadeStartCallback	Removes a callback function previously added by problem.addSlpCascadeStartCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpCascadeVarCallback	Removes a callback function previously added by problem.addSlpCascadeVarCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpCascadeVarFailCallback	Removes a callback function previously added by problem.addSlpCascadeVarFailCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpConstructCallback	Removes a callback function previously added by problem.addSlpConstructCallback. The specified callback function will no longer be called after it has been removed. [Callback, SLP]
problem.removeSlpDrColCallback	Removes a callback function previously added by problem.addSlpDrColCallback. [Callback, Cascading, SLP]
problem.removeSlpIntSolCallback	Removes a callback function previously added by problem.addSlpIntSolCallback. [Callback, MISLP]
problem.removeSlpIterEndCallback	Removes a callback function previously added by problem.addSlpIterEndCallback. [Callback, SLP]
problem.removeSlpIterStartCallback	Removes a callback function previously added by problem.addSlpIterStartCallback. The specified callback function will no longer be called after it has been removed. [Callback, SLP]
problem.removeSlpIterVarCallback	Removes a callback function previously added by problem.addSlpIterVarCallback. [Callback, SLP, SLP-convergence]
problem.removeSlpPreUpdateLinearizationCallback	Removes a callback function previously added by problem.addSlpPreUpdateLinearizationCallback. The specified callback function will no longer be called after it has been removed. [Callback, SLP]
problem.removeUserSolNotifyCallback	Removes a user solution notification callback previously added by problem.addUserSolNotifyCallback. The specified callback function will no longer be called after it has been removed. [Callback, Solution]
problem.repairInfeas	Provides a simplified interface for problem.repairWeightedInfeas. [Infeasibility]
problem.repairWeightedInfeas	By relaxing a set of selected constraints and bounds of an infeasible problem, it attempts to identify a 'solution' that violates the selected set of constraints and bounds minimally, while satisfying all other constraints and bounds. Among such solution candidates, it selects one that is optimal regarding the original objective function. [Infeasibility]
problem.repairWeightedInfeasBounds	An extended version of problem.repairWeightedInfeas that allows for bounding the level of relaxation allowed. [Infeasibility]
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.saveAs . Optimization may then recommence from the point at which the file was created. [File IO, Save Restore]
problem.rhsSA	Returns upper and lower sensitivity ranges for specified right hand side (RHS) function coefficients. [LP, Sensitivity Analysis]
problem.save	Alias of problem.saveAs.
problem.saveAs	Saves the current data structures to file and terminates the run [File IO, Save Restore]
problem.scale	Re-scales the current matrix. [Numerics]
problem.setControl	Sets one or more controls of a problem.
problem.setDefaultControl	Sets a single control to its default value. [Controls and Attributes]
problem.setDefaults	Sets all controls to their default values. [Controls and Attributes]
problem.setIndicators	Specifies that a set of rows in the matrix will be treated as indicator constraints during a tree search. [Problem Creation]
problem.setLogFile	This directs all Optimizer output to a log file. [File IO, Logging]
problem.setMessageStatus	Manages suppression of messages. [Misc]
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 problem name. [Problem Information]
problem.slpAddCoefs	Add non-linear coefficients to the SLP problem. [Problem Modification, SLP]
problem.slpCascadeOrder	Establish a re-calculation sequence for SLP variables with determining rows. [Data Input, SLP]
problem.slpCascadeSol	Re-calculate consistent values for SLP variables based on the current values of the remaining variables. [Cascading, SLP, Solution Process]
problem.slpChgCascadeNLimit	Set a variable specific cascade iteration limit [Data Input, SLP]
problem.slpChgCoef	Add or change a single matrix coefficient using a parsed or unparsed formula. [Problem Modification, SLP]
problem.slpChgCoefStr	Add or change a single matrix coefficient using a character string for the formula. [Problem Modification, SLP]
problem.slpChgDeltaType	Changes the type of the delta assigned to a nonlinear variable [Problem Modification, SLP]
problem.slpChgRowStatus	Change the status setting of a constraint [Bit-vector, Data Input, SLP]
problem.slpChgRowWt	Set or change the initial penalty error weight for a row [Data Input, SLP]
problem.slpConstruct	Create the full augmented SLP matrix and data structures, ready for optimization [SLP, Solution Process]
problem.slpDelCoefs	Delete coefficients from the current problem. [Problem Modification, SLP]
problem.slpEvaluateCoef	Evaluate a coefficient using the current values of the variables [Solution]
problem.slpFixPenalties	Fixe the values of the error vectors [Solution Process]
problem.slpGetCoefFormula	Retrieve a single matrix coefficient as a formula split into tokens. [Problem Information, SLP]
problem.slpGetCoefs	Retrieve the list of positions of the nonlinear coefficients in the problem. [Problem Information, SLP]
problem.slpGetCoefStr	Retrieve a single matrix coefficient as a formula in a character string. [Problem Information, SLP]
problem.slpGetColInfo	Get current column information. [SLP, Solution]
problem.slpGetRowInfo	Get current row information. [SLP, Solution]
problem.slpGetRowStatus	Retrieve the status setting of a constraint [Bit-vector, SLP, Solution]
problem.slpGetRowWT	Get the initial penalty error weight for a row [Data Information, SLP]
problem.slpLoadCoefs	Load non-linear coefficients into the SLP problem. [Problem Information, SLP]
problem.slpReInitialize	Reset the SLP problem to match a just augmented system [SLP, Solution Process]
problem.slpSetDetRow	Set the determining row of a variable [Cascading, Data Input, SLP]
problem.slpUnConstruct	Removes the augmentation and returns the problem to its pre-linearization state [SLP, Solution Process]
problem.slpUpdateLinearization	Updates the current linearization [SLP, Solution Process]
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. [Cuts]
problem.strongBranch	Performs strong branching iterations on all specified bound changes. [Branching]
problem.strongBranchCB	Performs strong branching iterations on all specified bound changes. [Branching]
problem.tune	This function begins a tuner session for the current problem. [Tuner]
problem.tuneProbSetFile	This function begins a tuner session for a set of problems. [Tuner]
problem.tunerReadMethod	This function loads a user defined tuner method from the given file. [File IO, Tuner]
problem.tunerWriteMethod	This function writes the current tuner method to a given file or prints it to the console. [File IO, Tuner]
problem.writeBasis	Writes the current basis to a file for later input into the Optimizer. [File IO, LP]
problem.writeBinSol	Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer. [File IO, Solution]
problem.writeDirs	Writes the tree search directives from the current problem to a directives file. [Branching, File IO]
problem.writeIIS	Writes an LP/MPS/CSV file containing a given Irreducible Infeasible Set (IIS). [File IO, Infeasibility]
problem.writeProb	Writes the current problem to an MPS or LP file. [File IO]
problem.writePrtSol	Writes the current solution to a fixed format ASCII file, problem_name .prt. [File IO, Solution]
problem.writeSlxSol	Creates an ASCII solution file (.slx) using a similar format to MPS files. [File IO, Solution]
problem.writeSol	Writes the current solution to a CSV format ASCII file, problem_name.asc (and .hdr). [File IO, Solution]

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

problem.addAfterObjectiveCallback	Declares a callback which will be called after each objective in a multi-objective problem is solved. [Callback, Multiobjective]
problem.addBarIterationCallback	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. This callback function will be called in addition to any callbacks already added by problem.addBarIterationCallback. This functionality is not available for the hybrid gradient method. [Barrier, Callback]
problem.addBarlogCallback	Declares a barrier log callback function, called at each iteration during the interior point algorithm. This callback function will be called in addition to any barrier log callbacks already added by problem.addBarlogCallback. This functionality is not available for the hybrid gradient method. [Barrier, Callback]
problem.addBeforeObjectiveCallback	Declares a callback which will be called before each objective in a multi-objective problem is solved. [Callback, Multiobjective]
problem.addChangeBranchObjectCallback	Declares a callback function that will be called after the selection of a MIP entity to branch on. [Branching, Callback]
problem.addCheckTimeCallback	Declares a callback function which is called every time the Optimizer checks if the time limit has been reached. This callback function will be called in addition to any callbacks already added by problem.addCheckTimeCallback. [Callback, Limits]
problem.addCols	Adds columns to the optimizer matrix. [Problem Creation]
problem.addComputeRestartCallback	Declares a callback to be called when a solve executed in compute mode needs to be restarted. [Callback, Compute Interface]
problem.addConstraint	Adds one or more constraints to the problem.
problem.addCutlogCallback	Declares a cut log callback function, called each time the cut log is printed. [Callback, Logging]
problem.addCutRoundCallback	Declares a callback function that is called when the Optimizer could separate cutting planes during the branch and bound search. [Callback, Cuts]
problem.addCuts	Adds cuts directly to the matrix at the current node. [Cuts]
problem.addGapNotifyCallback	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. [Callback, Limits]
problem.addGenCons	Adds one or more general constraints to the problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.addIndicator	Adds one or more indicator constraints to the problem.
problem.addInfnodeCallback	Declares a user infeasible node callback function, called after the current node has been found to be infeasible during the Branch and Bound search. [Branch and Bound Search, Callback]
problem.addIntsolCallback	Declares a user integer solution callback function, called every time an integer solution is found by heuristics or during the Branch and Bound search. This callback function will be called in addition to any callbacks already added by problem.addIntsolCallback. [Callback, Solution]
problem.addLplogCallback	Declares a simplex log callback function which is called after every LPLOG iterations of the simplex algorithm. This callback function will be called in addition to any callbacks already added by problem.addLplogCallback. [Callback, LP]
problem.addManagedCuts	Adds cuts to the Optimizer's internal cut pool from within the cutround callback set by problem.addCutRoundCallback. [Callback, Cuts]
problem.addMessageCallback	Declares an output callback function, called every time a text line relating to the given problem is output by the Optimizer. [Callback, Logging]
problem.addMiplogCallback	Declares a MIP log callback function, called each time the MIP log is printed. This callback function will be called in addition to any callbacks already added by problem.addMiplogCallback. [Callback, Logging]
problem.addMipSol	Adds a new feasible, infeasible or partial MIP solution for the problem to the Optimizer. [Solution]
problem.addMipThreadCallback	Declares a MIP thread callback function, called every time a MIP worker problem is created by the parallel MIP code. This callback function will be called in addition to any callbacks already added by problem.addMipThreadCallback. [Callback, Parallel]
problem.addMipThreadDestroyCallback	Declares a destroy MIP thread callback function, called every time a MIP thread is destroyed by the parallel MIP code. This callback function will be called in addition to any callbacks already added by problem.addMipThreadDestroyCallback. [Callback, Parallel]
problem.addMsJobEndCallback	Add a user callback to be called every time a new multistart job finishes. Can be used to overwrite the default solution ranking function [Callback, Multistart]
problem.addMsJobStartCallback	Add a user callback to be called every time a new multistart job is created, and the pre-loaded settings are applied [Callback, Multistart]
problem.addMsWinnerCallback	Add a user callback to be called every time a multistart winner has been declared [Callback, Multistart]
problem.addNames	When a model is loaded, the rows, columns, sets, piecewise linear and general constraints of the model may not have names associated with them. [Problem Creation]
problem.addNewnodeCallback	Declares a callback function that will be called every time a new node is created during the branch and bound search. This callback function will be called in addition to any callbacks already added by problem.addNewnodeCallback. [Branch and Bound Search, Callback]
problem.addNlpCoefEvalErrorCallback	Add a user callback to be called when an evaluation of a coefficient fails during the solve [Callback, Numerics]
problem.addNodecutoffCallback	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. This callback function will be called in addition to any callbacks already added by problem.addNodecutoffCallback. [Branch and Bound Search, Callback]
problem.addNodeLPSolvedCallback	Declares a 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. This callback function will be called in addition to any callbacks already added by problem.addNodeLPSolvedCallback. [Branch and Bound Search, Callback]
problem.addObj	Appends an objective function with the given coefficients to a multi-objective problem. The weight and priority of the objective are set to the given values. [Multiobjective, Problem Creation]
problem.addObjective	Adds one or more objective functions to the problem.
problem.addOptnodeCallback	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. This callback function will be called in addition to any callbacks already added by problem.addOptnodeCallback. [Branch and Bound Search, Callback]
problem.addPreIntsolCallback	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. [Callback, Solution]
problem.addPrenodeCallback	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. This callback function will be called in addition to any callbacks already added by problem.addPrenodeCallback. [Branch and Bound Search, Callback]
problem.addPresolveCallback	Declares a callback to be called after presolve has been performed. [Callback, Presolve]
problem.addPwlCons	Adds one or more piecewise linear constraints to the problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.addQMatrix	Adds a new quadratic matrix into a row defined by triplets. [Problem Creation, Quadratic]
problem.addRows	Adds rows to the optimizer matrix. [Problem Creation]
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.addSlpCascadeEndCallback	Add a user callback to be called at the end of the cascading process, after the last variable has been cascaded [Callback, Cascading, SLP]
problem.addSlpCascadeStartCallback	Add a user callback to be called at the start of the cascading process, before any variables have been cascaded [Callback, Cascading, SLP]
problem.addSlpCascadeVarCallback	Add a user callback to be called after each column has been cascaded [Callback, Cascading, SLP]
problem.addSlpCascadeVarFailCallback	Add a user callback to be called after cascading a column was not successful [Callback, Cascading, SLP]
problem.addSlpConstructCallback	Add a user callback to be called during the Xpress-SLP augmentation process [Callback, SLP]
problem.addSlpDrColCallback	Add a user callback used to override the update of variables with small determining column [Callback, Cascading, SLP]
problem.addSlpIntSolCallback	Add a user callback to be called during MISLP when an integer solution is obtained [Callback, MISLP]
problem.addSlpIterEndCallback	Add a user callback to be called at the end of each SLP iteration [Callback, SLP]
problem.addSlpIterStartCallback	Add a user callback to be called at the start of each SLP iteration [Callback, SLP]
problem.addSlpIterVarCallback	Add a user callback to be called after each column has been tested for convergence [Callback, SLP, SLP-convergence]
problem.addSlpPreUpdateLinearizationCallback	Add a user callback to be called before the linearization is updated [Callback, SLP]
problem.addSOS	Creates a special ordered set (SOS) constraint within the problem.
problem.addUserSolNotifyCallback	Declares a callback function to be called each time a solution added by problem.addMipSol has been processed. This callback function will be called in addition to any callbacks already added by problem.addUserSolNotifyCallback. [Callback, Solution]
problem.addVariable	Creates a variable within the problem.
problem.addVariables	Creates a dictionary or array of variables and adds them to the problem.
problem.basisStability	Calculates various measures for the stability of the current basis, including the basis condition number. [Linear Algebra, LP]
problem.bndSA	Returns upper and lower sensitivity ranges for specified variables' lower and upper bounds. [LP, Sensitivity Analysis]
problem.BTran	Post-multiplies a (row) vector provided by the user by the inverse of the current basis. [Linear Algebra, LP]
problem.calcObjective	Calculates the objective value of a given solution. [Solution]
problem.calcObjN	Calculates the objective value of the given objective function in a multi-objective problem. [Multiobjective, Solution]
problem.calcReducedCosts	Calculates the reduced cost values for a given (row) dual solution. [Linear Algebra, Solution]
problem.calcSlacks	Calculates the row slack values for a given solution. [Solution]
problem.calcSolInfo	Calculates the required property of a solution, like maximum infeasibility of a given primal and dual solution. [Solution]
problem.chgBounds	Used to change the bounds on columns in the matrix. [Problem Modification]
problem.chgCoef	Used to change a single coefficient in the matrix. [Problem Modification]
problem.chgColType	Used to change the type of a specified set of columns in the matrix. [MIP Entities, Problem Modification]
problem.chgGlbLimit	Used to change semi-continuous or semi-integer lower bounds, or upper limits on partial integers. [MIP Entities, Problem Modification]
problem.chgMCoef	Used to change multiple coefficients in the matrix. [Problem Modification]
problem.chgMQObj	Used to change multiple quadratic coefficients in the objective function. If any of the coefficients does not exist already, new coefficients will be added to the objective function. [Problem Modification, Quadratic]
problem.chgObj	Used to change the objective function coefficients. [Problem Modification]
problem.chgObjN	Modifies one or more coefficients of an objective function in a multi-objective problem. [Multiobjective, Problem Modification]
problem.chgObjSense	Changes the problem's objective function sense to minimize or maximize. [Problem Modification]
problem.chgQObj	Used to change a single quadratic coefficient in the objective function corresponding to the variable pair (objqcol1,objqcol2) of the Hessian matrix. [Problem Modification, Quadratic]
problem.chgQRowCoeff	Changes a single quadratic coefficient in a row. [Problem Modification, Quadratic]
problem.chgRHS	Used to change righthand side values of the problem. [Problem Modification]
problem.chgRHSRange	Used to change the range for a row of the problem matrix. [Problem Modification]
problem.chgRowType	Used to change the type of a row in the matrix. [Problem Modification]
problem.clearIIS	Resets the search for Irreducible Infeasible Sets (IIS). [Infeasibility]
problem.clearRowFlags	Clears extra information attached to a range of rows. [Problem Modification]
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. [Barrier, LP]
problem.delCols	Delete columns from a matrix. [Problem Creation]
problem.delConstraint	Delete one or more constraints from the problem.
problem.delCPCuts	During the branch and bound search, cuts are stored in the cut pool to be applied at descendant nodes. [Cuts]
problem.delCuts	Deletes cuts from the matrix at the current node. [Cuts]
problem.delGenCons	Delete general constraints from a problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.delIndicators	Delete indicator constraints. [MIP Entities, Problem Creation]
problem.delObj	Removes an objective function from the problem. [Problem Creation]
problem.delPwlCons	Delete piecewise linear constraints from a problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.delQMatrix	Deletes the quadratic part of a row or of the objective function. [Problem Creation, Quadratic]
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.delVariable	Delete one or more variables from the problem.
problem.dumpControls	Displays the list of controls and their current value for those controls that have been set to a non default value. [Controls and Attributes]
problem.estimateRowDualRanges	Performs a dual side range sensitivity analysis, i.e. [LP, Sensitivity Analysis]
problem.firstIIS	Initiates a search for an Irreducible Infeasible Set (IIS) in an infeasible problem. [Infeasibility]
problem.fixMIPEntities	Fixes all the MIP entities to the values of the last found MIP solution. [MIP Entities, Problem Modification]
problem.FTran	Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix. [Linear Algebra, LP]
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. [Controls and Attributes]
problem.getBasis	Returns the current basis into the user's data arrays. [Linear Algebra, LP]
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. [Callback, Solution]
problem.getCallbackPresolveRedCosts	Returns the reduced costs from the solution to the presolved problem associated with the current callback. [Callback, Solution]
problem.getCallbackPresolveSlacks	Returns the slack values from the solution to the presolved problem associated with the current callback. [Callback, Solution]
problem.getCallbackPresolveSolution	Returns the solution to the presolved problem associated with the current callback. [Callback, Solution]
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 Information]
problem.getCols	Returns the nonzeros in the constraint matrix for the columns in a given range. [Problem Information]
problem.getColType	Returns the column types for the columns in a given range. [MIP Entities, Problem Information]
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. [Controls and Attributes]
problem.getCPCutList	Returns a list of cut indices from the cut pool. [Cuts]
problem.getCPCuts	Returns cuts from the cut pool. [Cuts]
problem.getCutList	Retrieves a list of cut pointers for the cuts active at the current node. [Cuts]
problem.getCutMap	Used to return in which rows a list of cuts are currently loaded into the Optimizer. This is useful for example to retrieve the duals associated with active cuts. [Cuts]
problem.getCutSlack	Used to calculate the slack value of a cut with respect to the current LP relaxation solution. [Cuts]
problem.getDirs	Used to return the directives that have been loaded into a matrix. [Branching, Problem Information]
problem.getDualRay	Retrieves a dual ray (dual unbounded direction) for the current problem, if the problem is found to be infeasible. [LP, Solution]
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. [Piecewise Linear and General Constraints, Problem Information]
problem.getIISData	Returns information for an Irreducible Infeasible Set: size, variables and constraints (row and column vectors), and conflicting sides of the variables. For pure linear problems there is also information on duals, reduced costs and isolations. [Infeasibility]
problem.getIndex	Returns the index for a specified row or column name. [Problem Information]
problem.getIndicators	Returns the indicator constraint condition (indicator variable and complement flag) associated to the rows in a given range. [Problem Information]
problem.getInfeas	Returns a list of infeasible primal and dual variables. [LP, Solution]
problem.getLastBarSol	Used to obtain the last barrier solution values following optimization that used the barrier solver. [Barrier, Solution]
problem.getLB	Returns the lower bounds for the columns in a given range. [Problem Information]
problem.getLpSol	Used to obtain the LP solution values following optimization. [LP, Solution]
problem.getMessageStatus	Retrieves the current suppression status of a message. [Misc]
problem.getMIPEntities	Retrieves integr and entity information about a problem. It must be called before problem.mipOptimize if the presolve option is used. [MIP Entities, Problem Information]
problem.getMQObj	Returns the nonzeros in the quadratic objective coefficients matrix for the columns in a given range. [Problem Information, Quadratic]
problem.getNameList	Returns the names for the rows, columns, sets, piecewise linear constraints, general constraints or objectives in a given range. [Names Manager]
problem.getObj	Returns the objective function coefficients for the columns in a given range. [Problem Information]
problem.getObjN	For a given objective function, returns the objective coefficients for the columns in a given range. [Multiobjective, Problem Information]
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. [LP, Simplex]
problem.getPivots	Returns a list of potential leaving variables if a specified variable enters the basis. [LP, Simplex]
problem.getPresolveBasis	Returns the current basis from memory into the user's data areas. [LP, Simplex]
problem.getPresolveMap	Returns the mapping of the row and column numbers from the presolve problem back to the original problem. [Presolve, Problem Information]
problem.getPresolveSol	Returns the solution for the presolved problem from memory. [Presolve, Solution]
problem.getPrimalRay	Retrieves a primal ray (primal unbounded direction) for the current problem, if the problem is found to be unbounded. [LP, Solution]
problem.getProbName	Returns the current problem name. [Problem Information]
problem.getPwlCons	Returns the piecewise linear constraints y = f(x) in a given range. [Piecewise Linear and General Constraints, Problem Information]
problem.getQObj	Returns a single quadratic objective function coefficient corresponding to the variable pair (objqcol1, objqcol2) of the Hessian matrix. [Problem Information, Quadratic]
problem.getQRowCoeff	Returns a single quadratic constraint coefficient corresponding to the variable pair (rowqcol1, rowqcol2) of the Hessian of a given constraint. [Problem Information, Quadratic]
problem.getQRowQMatrix	Returns the nonzeros in a quadratic constraint coefficients matrix for the columns in a given range. [Problem Information, Quadratic]
problem.getQRowQMatrixTriplets	Returns the nonzeros in a quadratic constraint coefficients matrix as triplets (index pairs with coefficients). [Problem Information, Quadratic]
problem.getQRows	Returns the list indices of the rows that have quadratic coefficients. [Problem Information, Quadratic]
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 Information]
problem.getRHSRange	Returns the right hand side range values for the rows in a given range. [Problem Information]
problem.getRowFlags	Retrieve if a range of rows have been set up as special rows. [Problem Information]
problem.getRows	Returns the nonzeros in the constraint matrix for the rows in a given range. [Problem Information]
problem.getRowType	Returns the row types for the rows in a given range. [Problem Information]
problem.getScale	Returns the the current scaling of the matrix. [Numerics]
problem.getScaledInfeas	Returns a list primal and dual variables that are infeasible for the scaled original problem. If the problem is currently presolved, it is postsolved before the function returns. [LP, Numerics]
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.getUB	Returns the upper bounds for the columns in a given range. [Problem Information]
problem.getUnbVec	Returns the index vector which causes the primal simplex or dual simplex algorithm to determine that a matrix is primal or dual unbounded respectively. [LP, Solution]
problem.getVariable	Returns one or more variables of a problem corresponding to one or more indices passed as arguments.
problem.IISAll	Performs an automated search for independent Irreducible Infeasible Sets (IIS) in an infeasible problem. [Infeasibility]
problem.IISIsolations	Performs the isolation identification procedure for an Irreducible Infeasible Set (IIS). This function applies only to linear problems. [Infeasibility]
problem.IISStatus	Returns statistics on the Irreducible Infeasible Sets (IIS) found so far by problem.firstIIS, problem.nextIIS or problem.IISAll. [Infeasibility]
problem.interrupt	Interrupts the Optimizer algorithms. [Solution Process]
problem.loadBasis	Loads a basis from the user's areas. [Data Input, LP]
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. [Branching, Data Input]
problem.loadCuts	Loads cuts from the cut pool into the matrix. [Cuts, Data Input]
problem.loadDelayedRows	Specifies that a set of rows in the matrix will be treated as delayed rows during a tree search. [Cuts, Problem Input]
problem.loadDirs	Loads directives into the matrix. [Data Input]
problem.loadLP	Enables the user to pass a matrix directly to the Optimizer, rather than reading the matrix from a file. [LP, Problem Input]
problem.loadLPSol	Loads an LP solution for the problem into the Optimizer. [Data Input, LP, Solution]
problem.loadMIP	Used to load a MIP problem into the Optimizer data structures. [MIP Entities, Problem Input]
problem.loadMipSol	Loads a starting MIP solution for the problem into the Optimizer. [Data Input, MIP Entities, Solution]
problem.loadMIQCQP	Used to load a mixed integer quadratic problem with quadratic constraints into the Optimizer data structure. [Problem Input, Quadratic]
problem.loadMIQP	Used to load a MIQP problem, hence a MIP with quadratic objective coefficients, into the Optimizer data structures. [Problem Input, Quadratic]
problem.loadModelCuts	Specifies that a set of rows in the matrix will be treated as model cuts. [Cuts, Data Input]
problem.loadPresolveBasis	Loads a presolved basis from the user's areas. [Data Input, LP]
problem.loadPresolveDirs	Loads directives into the presolved matrix. [Branching, Data Input]
problem.loadQCQP	Used to load a quadratic problem with quadratic side constraints into the Optimizer data structure. [Problem Input, Quadratic]
problem.loadQP	Used to load a quadratic problem into the Optimizer data structure. [Problem Input, Quadratic]
problem.loadSecureVecs	Allows the user to mark rows and columns in order to prevent the presolve removing these rows and columns from the matrix. [Data Input, Presolve]
problem.lpOptimize	This function begins a search for the optimal continuous (LP) solution. [LP, Solution Process]
problem.mipOptimize	This function begins a tree search for the optimal MIP solution. [MIP Entities, Solution Process]
problem.msAddCustomPreset	A combined version of problem.msAddJob and problem.msAddPreset. [Data Input, Multistart]
problem.msAddJob	Adds a multistart job to the multistart pool [Data Input, Multistart]
problem.msAddPreset	Loads a preset of jobs into the multistart job pool. [Data Input, Multistart]
problem.msClear	Removes all scheduled jobs from the multistart job pool [Multistart]
problem.nextIIS	Continues the search for further Irreducible Infeasible Sets (IIS), or calls problem.firstIIS if no IIS has been identified yet. [Infeasibility]
problem.nlpAddFormulas	Add non-linear formulas to the SLP problem. [Problem Modification]
problem.nlpCalcSlacks	Calculate the slack values for the provided solution in the non-linear problem [Solution]
problem.nlpChgFormula	Add or replace a single matrix formula using a parsed or unparsed formula [Problem Modification]
problem.nlpChgFormulaStr	Add or replace a single matrix formula using a character string for the formula. [Problem Modification]
problem.nlpCurrentIV	Transfer the current solution to initial values [Data Input]
problem.nlpDelFormulas	Delete nonlinear formulas from the current problem [Problem Modification]
problem.nlpEvaluateFormula	Evaluate a formula using the current values of the variables [Solution]
problem.nlpGetFormula	Retrieve a single matrix formula as a formula split into tokens. [Problem Information]
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 Information]
problem.nlpLoadFormulas	Load non-linear formulas into the SLP problem [Problem Information]
problem.nlpOptimize	Maximize or minimize an SLP problem [Solution Process]
problem.nlpPostsolveProb	Restores the problem to its pre-solve state [Presolve]
problem.nlpPrintEvalInfo	Print a summary of any evaluation errors that may have occurred during solving a problem [Logging]
problem.nlpSetInitVal	Set the initial value of a variable [Data Input]
problem.nlpValidate	Validate the feasibility of constraints in a converged solution [Solution]
problem.nlpValidateKKT	Validates the first order optimality conditions also known as the Karush-Kuhn-Tucker (KKT) conditions versus the currect solution [Solution]
problem.nlpValidateRow	Prints an extensive analysis on a given constraint of the SLP problem [Solution]
problem.nlpValidateVector	Validate the feasibility of constraints for a given solution [Solution]
problem.objSA	Returns upper and lower sensitivity ranges for specified objective function coefficients. [LP, Sensitivity Analysis]
problem.optimize	This function begins a search for the optimal solution of the problem. [Solution Process]
problem.pivot	Performs a simplex pivot by bringing variable enter into the basis and removing leave. [Linear Algebra, Simplex]
problem.postSolve	Postsolve the current matrix when it is in a presolved state. [Presolve, Solution Process]
problem.postSolveSol	Postsolves a primal solution formulated in the presolved space into the corresponding solution formulated in the input space. The problem itself is unchanged. [Presolve, Solution]
problem.presolveRow	Presolves a row formulated in terms of the original variables such that it can be added to a presolved matrix. [Misc, Presolve]
problem.presolveSol	Presolves a primal solution formulated in the input space into the corresponding solution formulated in the presolved space. The problem itself is unchanged. [Presolve, Solution]
problem.printIIS	Prints a given Irreducible Infeasible Set (IIS) in the log. [Infeasibility, Logging]
problem.readBasis	Instructs the Optimizer to read in a previously saved basis from a file. [File IO, LP]
problem.readBinSol	Reads a solution from a binary solution file. [File IO, Solution]
problem.readDirs	Reads a directives file to help direct the tree search. [Branching, File IO]
problem.readProb	Reads an (X)MPS or LP format matrix from file. [File IO, Problem Creation]
problem.readSlxSol	Reads an ASCII solution file .slx created by the problem.writeSlxSol function. [File IO, Solution]
problem.removeAfterObjectiveCallback	Removes a callback function previously added by problem.addAfterObjectiveCallback. [Callback, Multiobjective]
problem.removeBarIterationCallback	Removes a barrier iteration callback function previously added by problem.addBarIterationCallback. The specified callback function will no longer be called after it has been removed. [Barrier, Callback]
problem.removeBarlogCallback	Removes a Newton barrier log callback function previously added by problem.addBarlogCallback. The specified callback function will no longer be called after it has been removed. [Barrier, Callback]
problem.removeBeforeObjectiveCallback	Removes a callback function previously added by problem.addBeforeObjectiveCallback. [Callback, Multiobjective]
problem.removeChangeBranchObjectCallback	Removes a callback function previously added by problem.addChangeBranchObjectCallback. [Branching, Callback]
problem.removeCheckTimeCallback	Removes a callback function previously added by problem.addCheckTimeCallback. [Callback, Limits]
problem.removeComputeRestartCallback	Removes a computerestart callback function previously added by problem.addComputeRestartCallback. The specified callback function will no longer be called after it has been removed. [Callback, Compute Interface]
problem.removeCutlogCallback	Removes a cut log callback function previously added by problem.addCutlogCallback. [Callback, Logging]
problem.removeCutRoundCallback	Removes a cut round callback function previously added by problem.addCutRoundCallback. [Callback, Cuts]
problem.removeGapNotifyCallback	Removes a callback function previously added by problem.addGapNotifyCallback. [Callback, Limits]
problem.removeInfnodeCallback	Removes a user infeasible node callback function previously added by problem.addInfnodeCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removeIntsolCallback	Removes an integer solution callback function previously added by problem.addIntsolCallback. The specified callback function will no longer be called after it has been removed. [Callback, Solution]
problem.removeLplogCallback	Removes a simplex log callback function previously added by problem.addLplogCallback. The specified callback function will no longer be called after it has been removed. [Callback, Logging]
problem.removeMessageCallback	Removes a message callback function previously added by problem.addMessageCallback. [Callback, Logging]
problem.removeMiplogCallback	Removes a MIP log callback function previously added by problem.addMiplogCallback. The specified callback function will no longer be called after it has been removed. [Callback, Logging]
problem.removeMipThreadCallback	Removes a callback function previously added by problem.addMipThreadCallback. [Callback, Parallel]
problem.removeMipThreadDestroyCallback	Removes a child thread destruction callback function previously added by problem.addMipThreadDestroyCallback. The specified callback function will no longer be called after it has been removed. [Callback, Parallel]
problem.removeMsJobEndCallback	Removes a callback function previously added by problem.addMsJobEndCallback. [Callback, Multistart]
problem.removeMsJobStartCallback	Removes a callback function previously added by problem.addMsJobStartCallback. [Callback, Multistart]
problem.removeMsWinnerCallback	Removes a callback function previously added by problem.addMsWinnerCallback. [Callback, Multistart]
problem.removeNewnodeCallback	Removes a new-node callback function previously added by problem.addNewnodeCallback. [Branch and Bound Search, Callback]
problem.removeNlpCoefEvalErrorCallback	Removes a callback function previously added by problem.addNlpCoefEvalErrorCallback. The specified callback function will no longer be called after it has been removed. [Callback, Numerics]
problem.removeNodecutoffCallback	Removes a node-cutoff callback function previously added by problem.addNodecutoffCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removeNodeLPSolvedCallback	Removes a node callback function previously added by problem.addNodeLPSolvedCallback. [Branch and Bound Search, Callback]
problem.removeOptnodeCallback	Removes a node-optimal callback function previously added by problem.addOptnodeCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removePreIntsolCallback	Removes a pre-integer solution callback function previously added by problem.addPreIntsolCallback. The specified callback function will no longer be called after it has been removed. [Callback, Solution]
problem.removePrenodeCallback	Removes a preprocess node callback function previously added by problem.addPrenodeCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removePresolveCallback	Removes a presolve callback function previously added by problem.addPresolveCallback. [Callback, Presolve]
problem.removeSlpCascadeEndCallback	Removes a callback function previously added by problem.addSlpCascadeEndCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpCascadeStartCallback	Removes a callback function previously added by problem.addSlpCascadeStartCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpCascadeVarCallback	Removes a callback function previously added by problem.addSlpCascadeVarCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpCascadeVarFailCallback	Removes a callback function previously added by problem.addSlpCascadeVarFailCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpConstructCallback	Removes a callback function previously added by problem.addSlpConstructCallback. The specified callback function will no longer be called after it has been removed. [Callback, SLP]
problem.removeSlpDrColCallback	Removes a callback function previously added by problem.addSlpDrColCallback. [Callback, Cascading, SLP]
problem.removeSlpIntSolCallback	Removes a callback function previously added by problem.addSlpIntSolCallback. [Callback, MISLP]
problem.removeSlpIterEndCallback	Removes a callback function previously added by problem.addSlpIterEndCallback. [Callback, SLP]
problem.removeSlpIterStartCallback	Removes a callback function previously added by problem.addSlpIterStartCallback. The specified callback function will no longer be called after it has been removed. [Callback, SLP]
problem.removeSlpIterVarCallback	Removes a callback function previously added by problem.addSlpIterVarCallback. [Callback, SLP, SLP-convergence]
problem.removeSlpPreUpdateLinearizationCallback	Removes a callback function previously added by problem.addSlpPreUpdateLinearizationCallback. The specified callback function will no longer be called after it has been removed. [Callback, SLP]
problem.removeUserSolNotifyCallback	Removes a user solution notification callback previously added by problem.addUserSolNotifyCallback. The specified callback function will no longer be called after it has been removed. [Callback, Solution]
problem.repairInfeas	Provides a simplified interface for problem.repairWeightedInfeas. [Infeasibility]
problem.repairWeightedInfeas	By relaxing a set of selected constraints and bounds of an infeasible problem, it attempts to identify a 'solution' that violates the selected set of constraints and bounds minimally, while satisfying all other constraints and bounds. Among such solution candidates, it selects one that is optimal regarding the original objective function. [Infeasibility]
problem.repairWeightedInfeasBounds	An extended version of problem.repairWeightedInfeas that allows for bounding the level of relaxation allowed. [Infeasibility]
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.saveAs . Optimization may then recommence from the point at which the file was created. [File IO, Save Restore]
problem.rhsSA	Returns upper and lower sensitivity ranges for specified right hand side (RHS) function coefficients. [LP, Sensitivity Analysis]
problem.save	Alias of problem.saveAs.
problem.saveAs	Saves the current data structures to file and terminates the run [File IO, Save Restore]
problem.scale	Re-scales the current matrix. [Numerics]
problem.setControl	Sets one or more controls of a problem.
problem.setDefaultControl	Sets a single control to its default value. [Controls and Attributes]
problem.setDefaults	Sets all controls to their default values. [Controls and Attributes]
problem.setIndicators	Specifies that a set of rows in the matrix will be treated as indicator constraints during a tree search. [Problem Creation]
problem.setLogFile	This directs all Optimizer output to a log file. [File IO, Logging]
problem.setMessageStatus	Manages suppression of messages. [Misc]
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 problem name. [Problem Information]
problem.slpAddCoefs	Add non-linear coefficients to the SLP problem. [Problem Modification, SLP]
problem.slpCascadeOrder	Establish a re-calculation sequence for SLP variables with determining rows. [Data Input, SLP]
problem.slpCascadeSol	Re-calculate consistent values for SLP variables based on the current values of the remaining variables. [Cascading, SLP, Solution Process]
problem.slpChgCascadeNLimit	Set a variable specific cascade iteration limit [Data Input, SLP]
problem.slpChgCoef	Add or change a single matrix coefficient using a parsed or unparsed formula. [Problem Modification, SLP]
problem.slpChgCoefStr	Add or change a single matrix coefficient using a character string for the formula. [Problem Modification, SLP]
problem.slpChgDeltaType	Changes the type of the delta assigned to a nonlinear variable [Problem Modification, SLP]
problem.slpChgRowStatus	Change the status setting of a constraint [Bit-vector, Data Input, SLP]
problem.slpChgRowWt	Set or change the initial penalty error weight for a row [Data Input, SLP]
problem.slpConstruct	Create the full augmented SLP matrix and data structures, ready for optimization [SLP, Solution Process]
problem.slpDelCoefs	Delete coefficients from the current problem. [Problem Modification, SLP]
problem.slpEvaluateCoef	Evaluate a coefficient using the current values of the variables [Solution]
problem.slpFixPenalties	Fixe the values of the error vectors [Solution Process]
problem.slpGetCoefFormula	Retrieve a single matrix coefficient as a formula split into tokens. [Problem Information, SLP]
problem.slpGetCoefs	Retrieve the list of positions of the nonlinear coefficients in the problem. [Problem Information, SLP]
problem.slpGetCoefStr	Retrieve a single matrix coefficient as a formula in a character string. [Problem Information, SLP]
problem.slpGetColInfo	Get current column information. [SLP, Solution]
problem.slpGetRowInfo	Get current row information. [SLP, Solution]
problem.slpGetRowStatus	Retrieve the status setting of a constraint [Bit-vector, SLP, Solution]
problem.slpGetRowWT	Get the initial penalty error weight for a row [Data Information, SLP]
problem.slpLoadCoefs	Load non-linear coefficients into the SLP problem. [Problem Information, SLP]
problem.slpReInitialize	Reset the SLP problem to match a just augmented system [SLP, Solution Process]
problem.slpSetDetRow	Set the determining row of a variable [Cascading, Data Input, SLP]
problem.slpUnConstruct	Removes the augmentation and returns the problem to its pre-linearization state [SLP, Solution Process]
problem.slpUpdateLinearization	Updates the current linearization [SLP, Solution Process]
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. [Cuts]
problem.strongBranch	Performs strong branching iterations on all specified bound changes. [Branching]
problem.strongBranchCB	Performs strong branching iterations on all specified bound changes. [Branching]
problem.tune	This function begins a tuner session for the current problem. [Tuner]
problem.tuneProbSetFile	This function begins a tuner session for a set of problems. [Tuner]
problem.tunerReadMethod	This function loads a user defined tuner method from the given file. [File IO, Tuner]
problem.tunerWriteMethod	This function writes the current tuner method to a given file or prints it to the console. [File IO, Tuner]
problem.writeBasis	Writes the current basis to a file for later input into the Optimizer. [File IO, LP]
problem.writeBinSol	Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer. [File IO, Solution]
problem.writeDirs	Writes the tree search directives from the current problem to a directives file. [Branching, File IO]
problem.writeIIS	Writes an LP/MPS/CSV file containing a given Irreducible Infeasible Set (IIS). [File IO, Infeasibility]
problem.writeProb	Writes the current problem to an MPS or LP file. [File IO]
problem.writePrtSol	Writes the current solution to a fixed format ASCII file, problem_name .prt. [File IO, Solution]
problem.writeSlxSol	Creates an ASCII solution file (.slx) using a similar format to MPS files. [File IO, Solution]
problem.writeSol	Writes the current solution to a CSV format ASCII file, problem_name.asc (and .hdr). [File IO, Solution]

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

problem.addAfterObjectiveCallback	Declares a callback which will be called after each objective in a multi-objective problem is solved. [Callback, Multiobjective]
problem.addBarIterationCallback	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. This callback function will be called in addition to any callbacks already added by problem.addBarIterationCallback. This functionality is not available for the hybrid gradient method. [Barrier, Callback]
problem.addBarlogCallback	Declares a barrier log callback function, called at each iteration during the interior point algorithm. This callback function will be called in addition to any barrier log callbacks already added by problem.addBarlogCallback. This functionality is not available for the hybrid gradient method. [Barrier, Callback]
problem.addBeforeObjectiveCallback	Declares a callback which will be called before each objective in a multi-objective problem is solved. [Callback, Multiobjective]
problem.addChangeBranchObjectCallback	Declares a callback function that will be called after the selection of a MIP entity to branch on. [Branching, Callback]
problem.addCheckTimeCallback	Declares a callback function which is called every time the Optimizer checks if the time limit has been reached. This callback function will be called in addition to any callbacks already added by problem.addCheckTimeCallback. [Callback, Limits]
problem.addCols	Adds columns to the optimizer matrix. [Problem Creation]
problem.addComputeRestartCallback	Declares a callback to be called when a solve executed in compute mode needs to be restarted. [Callback, Compute Interface]
problem.addConstraint	Adds one or more constraints to the problem.
problem.addCutlogCallback	Declares a cut log callback function, called each time the cut log is printed. [Callback, Logging]
problem.addCutRoundCallback	Declares a callback function that is called when the Optimizer could separate cutting planes during the branch and bound search. [Callback, Cuts]
problem.addCuts	Adds cuts directly to the matrix at the current node. [Cuts]
problem.addGapNotifyCallback	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. [Callback, Limits]
problem.addGenCons	Adds one or more general constraints to the problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.addIndicator	Adds one or more indicator constraints to the problem.
problem.addInfnodeCallback	Declares a user infeasible node callback function, called after the current node has been found to be infeasible during the Branch and Bound search. [Branch and Bound Search, Callback]
problem.addIntsolCallback	Declares a user integer solution callback function, called every time an integer solution is found by heuristics or during the Branch and Bound search. This callback function will be called in addition to any callbacks already added by problem.addIntsolCallback. [Callback, Solution]
problem.addLplogCallback	Declares a simplex log callback function which is called after every LPLOG iterations of the simplex algorithm. This callback function will be called in addition to any callbacks already added by problem.addLplogCallback. [Callback, LP]
problem.addManagedCuts	Adds cuts to the Optimizer's internal cut pool from within the cutround callback set by problem.addCutRoundCallback. [Callback, Cuts]
problem.addMessageCallback	Declares an output callback function, called every time a text line relating to the given problem is output by the Optimizer. [Callback, Logging]
problem.addMiplogCallback	Declares a MIP log callback function, called each time the MIP log is printed. This callback function will be called in addition to any callbacks already added by problem.addMiplogCallback. [Callback, Logging]
problem.addMipSol	Adds a new feasible, infeasible or partial MIP solution for the problem to the Optimizer. [Solution]
problem.addMipThreadCallback	Declares a MIP thread callback function, called every time a MIP worker problem is created by the parallel MIP code. This callback function will be called in addition to any callbacks already added by problem.addMipThreadCallback. [Callback, Parallel]
problem.addMipThreadDestroyCallback	Declares a destroy MIP thread callback function, called every time a MIP thread is destroyed by the parallel MIP code. This callback function will be called in addition to any callbacks already added by problem.addMipThreadDestroyCallback. [Callback, Parallel]
problem.addMsJobEndCallback	Add a user callback to be called every time a new multistart job finishes. Can be used to overwrite the default solution ranking function [Callback, Multistart]
problem.addMsJobStartCallback	Add a user callback to be called every time a new multistart job is created, and the pre-loaded settings are applied [Callback, Multistart]
problem.addMsWinnerCallback	Add a user callback to be called every time a multistart winner has been declared [Callback, Multistart]
problem.addNames	When a model is loaded, the rows, columns, sets, piecewise linear and general constraints of the model may not have names associated with them. [Problem Creation]
problem.addNewnodeCallback	Declares a callback function that will be called every time a new node is created during the branch and bound search. This callback function will be called in addition to any callbacks already added by problem.addNewnodeCallback. [Branch and Bound Search, Callback]
problem.addNlpCoefEvalErrorCallback	Add a user callback to be called when an evaluation of a coefficient fails during the solve [Callback, Numerics]
problem.addNodecutoffCallback	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. This callback function will be called in addition to any callbacks already added by problem.addNodecutoffCallback. [Branch and Bound Search, Callback]
problem.addNodeLPSolvedCallback	Declares a 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. This callback function will be called in addition to any callbacks already added by problem.addNodeLPSolvedCallback. [Branch and Bound Search, Callback]
problem.addObj	Appends an objective function with the given coefficients to a multi-objective problem. The weight and priority of the objective are set to the given values. [Multiobjective, Problem Creation]
problem.addObjective	Adds one or more objective functions to the problem.
problem.addOptnodeCallback	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. This callback function will be called in addition to any callbacks already added by problem.addOptnodeCallback. [Branch and Bound Search, Callback]
problem.addPreIntsolCallback	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. [Callback, Solution]
problem.addPrenodeCallback	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. This callback function will be called in addition to any callbacks already added by problem.addPrenodeCallback. [Branch and Bound Search, Callback]
problem.addPresolveCallback	Declares a callback to be called after presolve has been performed. [Callback, Presolve]
problem.addPwlCons	Adds one or more piecewise linear constraints to the problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.addQMatrix	Adds a new quadratic matrix into a row defined by triplets. [Problem Creation, Quadratic]
problem.addRows	Adds rows to the optimizer matrix. [Problem Creation]
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.addSlpCascadeEndCallback	Add a user callback to be called at the end of the cascading process, after the last variable has been cascaded [Callback, Cascading, SLP]
problem.addSlpCascadeStartCallback	Add a user callback to be called at the start of the cascading process, before any variables have been cascaded [Callback, Cascading, SLP]
problem.addSlpCascadeVarCallback	Add a user callback to be called after each column has been cascaded [Callback, Cascading, SLP]
problem.addSlpCascadeVarFailCallback	Add a user callback to be called after cascading a column was not successful [Callback, Cascading, SLP]
problem.addSlpConstructCallback	Add a user callback to be called during the Xpress-SLP augmentation process [Callback, SLP]
problem.addSlpDrColCallback	Add a user callback used to override the update of variables with small determining column [Callback, Cascading, SLP]
problem.addSlpIntSolCallback	Add a user callback to be called during MISLP when an integer solution is obtained [Callback, MISLP]
problem.addSlpIterEndCallback	Add a user callback to be called at the end of each SLP iteration [Callback, SLP]
problem.addSlpIterStartCallback	Add a user callback to be called at the start of each SLP iteration [Callback, SLP]
problem.addSlpIterVarCallback	Add a user callback to be called after each column has been tested for convergence [Callback, SLP, SLP-convergence]
problem.addSlpPreUpdateLinearizationCallback	Add a user callback to be called before the linearization is updated [Callback, SLP]
problem.addSOS	Creates a special ordered set (SOS) constraint within the problem.
problem.addUserSolNotifyCallback	Declares a callback function to be called each time a solution added by problem.addMipSol has been processed. This callback function will be called in addition to any callbacks already added by problem.addUserSolNotifyCallback. [Callback, Solution]
problem.addVariable	Creates a variable within the problem.
problem.addVariables	Creates a dictionary or array of variables and adds them to the problem.
problem.basisStability	Calculates various measures for the stability of the current basis, including the basis condition number. [Linear Algebra, LP]
problem.bndSA	Returns upper and lower sensitivity ranges for specified variables' lower and upper bounds. [LP, Sensitivity Analysis]
problem.BTran	Post-multiplies a (row) vector provided by the user by the inverse of the current basis. [Linear Algebra, LP]
problem.calcObjective	Calculates the objective value of a given solution. [Solution]
problem.calcObjN	Calculates the objective value of the given objective function in a multi-objective problem. [Multiobjective, Solution]
problem.calcReducedCosts	Calculates the reduced cost values for a given (row) dual solution. [Linear Algebra, Solution]
problem.calcSlacks	Calculates the row slack values for a given solution. [Solution]
problem.calcSolInfo	Calculates the required property of a solution, like maximum infeasibility of a given primal and dual solution. [Solution]
problem.chgBounds	Used to change the bounds on columns in the matrix. [Problem Modification]
problem.chgCoef	Used to change a single coefficient in the matrix. [Problem Modification]
problem.chgColType	Used to change the type of a specified set of columns in the matrix. [MIP Entities, Problem Modification]
problem.chgGlbLimit	Used to change semi-continuous or semi-integer lower bounds, or upper limits on partial integers. [MIP Entities, Problem Modification]
problem.chgMCoef	Used to change multiple coefficients in the matrix. [Problem Modification]
problem.chgMQObj	Used to change multiple quadratic coefficients in the objective function. If any of the coefficients does not exist already, new coefficients will be added to the objective function. [Problem Modification, Quadratic]
problem.chgObj	Used to change the objective function coefficients. [Problem Modification]
problem.chgObjN	Modifies one or more coefficients of an objective function in a multi-objective problem. [Multiobjective, Problem Modification]
problem.chgObjSense	Changes the problem's objective function sense to minimize or maximize. [Problem Modification]
problem.chgQObj	Used to change a single quadratic coefficient in the objective function corresponding to the variable pair (objqcol1,objqcol2) of the Hessian matrix. [Problem Modification, Quadratic]
problem.chgQRowCoeff	Changes a single quadratic coefficient in a row. [Problem Modification, Quadratic]
problem.chgRHS	Used to change righthand side values of the problem. [Problem Modification]
problem.chgRHSRange	Used to change the range for a row of the problem matrix. [Problem Modification]
problem.chgRowType	Used to change the type of a row in the matrix. [Problem Modification]
problem.clearIIS	Resets the search for Irreducible Infeasible Sets (IIS). [Infeasibility]
problem.clearRowFlags	Clears extra information attached to a range of rows. [Problem Modification]
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. [Barrier, LP]
problem.delCols	Delete columns from a matrix. [Problem Creation]
problem.delConstraint	Delete one or more constraints from the problem.
problem.delCPCuts	During the branch and bound search, cuts are stored in the cut pool to be applied at descendant nodes. [Cuts]
problem.delCuts	Deletes cuts from the matrix at the current node. [Cuts]
problem.delGenCons	Delete general constraints from a problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.delIndicators	Delete indicator constraints. [MIP Entities, Problem Creation]
problem.delObj	Removes an objective function from the problem. [Problem Creation]
problem.delPwlCons	Delete piecewise linear constraints from a problem. [Piecewise Linear and General Constraints, Problem Creation]
problem.delQMatrix	Deletes the quadratic part of a row or of the objective function. [Problem Creation, Quadratic]
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.delVariable	Delete one or more variables from the problem.
problem.dumpControls	Displays the list of controls and their current value for those controls that have been set to a non default value. [Controls and Attributes]
problem.estimateRowDualRanges	Performs a dual side range sensitivity analysis, i.e. [LP, Sensitivity Analysis]
problem.firstIIS	Initiates a search for an Irreducible Infeasible Set (IIS) in an infeasible problem. [Infeasibility]
problem.fixMIPEntities	Fixes all the MIP entities to the values of the last found MIP solution. [MIP Entities, Problem Modification]
problem.FTran	Pre-multiplies a (column) vector provided by the user by the inverse of the current matrix. [Linear Algebra, LP]
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. [Controls and Attributes]
problem.getBasis	Returns the current basis into the user's data arrays. [Linear Algebra, LP]
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. [Callback, Solution]
problem.getCallbackPresolveRedCosts	Returns the reduced costs from the solution to the presolved problem associated with the current callback. [Callback, Solution]
problem.getCallbackPresolveSlacks	Returns the slack values from the solution to the presolved problem associated with the current callback. [Callback, Solution]
problem.getCallbackPresolveSolution	Returns the solution to the presolved problem associated with the current callback. [Callback, Solution]
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 Information]
problem.getCols	Returns the nonzeros in the constraint matrix for the columns in a given range. [Problem Information]
problem.getColType	Returns the column types for the columns in a given range. [MIP Entities, Problem Information]
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. [Controls and Attributes]
problem.getCPCutList	Returns a list of cut indices from the cut pool. [Cuts]
problem.getCPCuts	Returns cuts from the cut pool. [Cuts]
problem.getCutList	Retrieves a list of cut pointers for the cuts active at the current node. [Cuts]
problem.getCutMap	Used to return in which rows a list of cuts are currently loaded into the Optimizer. This is useful for example to retrieve the duals associated with active cuts. [Cuts]
problem.getCutSlack	Used to calculate the slack value of a cut with respect to the current LP relaxation solution. [Cuts]
problem.getDirs	Used to return the directives that have been loaded into a matrix. [Branching, Problem Information]
problem.getDualRay	Retrieves a dual ray (dual unbounded direction) for the current problem, if the problem is found to be infeasible. [LP, Solution]
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. [Piecewise Linear and General Constraints, Problem Information]
problem.getIISData	Returns information for an Irreducible Infeasible Set: size, variables and constraints (row and column vectors), and conflicting sides of the variables. For pure linear problems there is also information on duals, reduced costs and isolations. [Infeasibility]
problem.getIndex	Returns the index for a specified row or column name. [Problem Information]
problem.getIndicators	Returns the indicator constraint condition (indicator variable and complement flag) associated to the rows in a given range. [Problem Information]
problem.getInfeas	Returns a list of infeasible primal and dual variables. [LP, Solution]
problem.getLastBarSol	Used to obtain the last barrier solution values following optimization that used the barrier solver. [Barrier, Solution]
problem.getLB	Returns the lower bounds for the columns in a given range. [Problem Information]
problem.getLpSol	Used to obtain the LP solution values following optimization. [LP, Solution]
problem.getMessageStatus	Retrieves the current suppression status of a message. [Misc]
problem.getMIPEntities	Retrieves integr and entity information about a problem. It must be called before problem.mipOptimize if the presolve option is used. [MIP Entities, Problem Information]
problem.getMQObj	Returns the nonzeros in the quadratic objective coefficients matrix for the columns in a given range. [Problem Information, Quadratic]
problem.getNameList	Returns the names for the rows, columns, sets, piecewise linear constraints, general constraints or objectives in a given range. [Names Manager]
problem.getObj	Returns the objective function coefficients for the columns in a given range. [Problem Information]
problem.getObjN	For a given objective function, returns the objective coefficients for the columns in a given range. [Multiobjective, Problem Information]
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. [LP, Simplex]
problem.getPivots	Returns a list of potential leaving variables if a specified variable enters the basis. [LP, Simplex]
problem.getPresolveBasis	Returns the current basis from memory into the user's data areas. [LP, Simplex]
problem.getPresolveMap	Returns the mapping of the row and column numbers from the presolve problem back to the original problem. [Presolve, Problem Information]
problem.getPresolveSol	Returns the solution for the presolved problem from memory. [Presolve, Solution]
problem.getPrimalRay	Retrieves a primal ray (primal unbounded direction) for the current problem, if the problem is found to be unbounded. [LP, Solution]
problem.getProbName	Returns the current problem name. [Problem Information]
problem.getPwlCons	Returns the piecewise linear constraints y = f(x) in a given range. [Piecewise Linear and General Constraints, Problem Information]
problem.getQObj	Returns a single quadratic objective function coefficient corresponding to the variable pair (objqcol1, objqcol2) of the Hessian matrix. [Problem Information, Quadratic]
problem.getQRowCoeff	Returns a single quadratic constraint coefficient corresponding to the variable pair (rowqcol1, rowqcol2) of the Hessian of a given constraint. [Problem Information, Quadratic]
problem.getQRowQMatrix	Returns the nonzeros in a quadratic constraint coefficients matrix for the columns in a given range. [Problem Information, Quadratic]
problem.getQRowQMatrixTriplets	Returns the nonzeros in a quadratic constraint coefficients matrix as triplets (index pairs with coefficients). [Problem Information, Quadratic]
problem.getQRows	Returns the list indices of the rows that have quadratic coefficients. [Problem Information, Quadratic]
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 Information]
problem.getRHSRange	Returns the right hand side range values for the rows in a given range. [Problem Information]
problem.getRowFlags	Retrieve if a range of rows have been set up as special rows. [Problem Information]
problem.getRows	Returns the nonzeros in the constraint matrix for the rows in a given range. [Problem Information]
problem.getRowType	Returns the row types for the rows in a given range. [Problem Information]
problem.getScale	Returns the the current scaling of the matrix. [Numerics]
problem.getScaledInfeas	Returns a list primal and dual variables that are infeasible for the scaled original problem. If the problem is currently presolved, it is postsolved before the function returns. [LP, Numerics]
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.getUB	Returns the upper bounds for the columns in a given range. [Problem Information]
problem.getUnbVec	Returns the index vector which causes the primal simplex or dual simplex algorithm to determine that a matrix is primal or dual unbounded respectively. [LP, Solution]
problem.getVariable	Returns one or more variables of a problem corresponding to one or more indices passed as arguments.
problem.IISAll	Performs an automated search for independent Irreducible Infeasible Sets (IIS) in an infeasible problem. [Infeasibility]
problem.IISIsolations	Performs the isolation identification procedure for an Irreducible Infeasible Set (IIS). This function applies only to linear problems. [Infeasibility]
problem.IISStatus	Returns statistics on the Irreducible Infeasible Sets (IIS) found so far by problem.firstIIS, problem.nextIIS or problem.IISAll. [Infeasibility]
problem.interrupt	Interrupts the Optimizer algorithms. [Solution Process]
problem.loadBasis	Loads a basis from the user's areas. [Data Input, LP]
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. [Branching, Data Input]
problem.loadCuts	Loads cuts from the cut pool into the matrix. [Cuts, Data Input]
problem.loadDelayedRows	Specifies that a set of rows in the matrix will be treated as delayed rows during a tree search. [Cuts, Problem Input]
problem.loadDirs	Loads directives into the matrix. [Data Input]
problem.loadLP	Enables the user to pass a matrix directly to the Optimizer, rather than reading the matrix from a file. [LP, Problem Input]
problem.loadLPSol	Loads an LP solution for the problem into the Optimizer. [Data Input, LP, Solution]
problem.loadMIP	Used to load a MIP problem into the Optimizer data structures. [MIP Entities, Problem Input]
problem.loadMipSol	Loads a starting MIP solution for the problem into the Optimizer. [Data Input, MIP Entities, Solution]
problem.loadMIQCQP	Used to load a mixed integer quadratic problem with quadratic constraints into the Optimizer data structure. [Problem Input, Quadratic]
problem.loadMIQP	Used to load a MIQP problem, hence a MIP with quadratic objective coefficients, into the Optimizer data structures. [Problem Input, Quadratic]
problem.loadModelCuts	Specifies that a set of rows in the matrix will be treated as model cuts. [Cuts, Data Input]
problem.loadPresolveBasis	Loads a presolved basis from the user's areas. [Data Input, LP]
problem.loadPresolveDirs	Loads directives into the presolved matrix. [Branching, Data Input]
problem.loadQCQP	Used to load a quadratic problem with quadratic side constraints into the Optimizer data structure. [Problem Input, Quadratic]
problem.loadQP	Used to load a quadratic problem into the Optimizer data structure. [Problem Input, Quadratic]
problem.loadSecureVecs	Allows the user to mark rows and columns in order to prevent the presolve removing these rows and columns from the matrix. [Data Input, Presolve]
problem.lpOptimize	This function begins a search for the optimal continuous (LP) solution. [LP, Solution Process]
problem.mipOptimize	This function begins a tree search for the optimal MIP solution. [MIP Entities, Solution Process]
problem.msAddCustomPreset	A combined version of problem.msAddJob and problem.msAddPreset. [Data Input, Multistart]
problem.msAddJob	Adds a multistart job to the multistart pool [Data Input, Multistart]
problem.msAddPreset	Loads a preset of jobs into the multistart job pool. [Data Input, Multistart]
problem.msClear	Removes all scheduled jobs from the multistart job pool [Multistart]
problem.nextIIS	Continues the search for further Irreducible Infeasible Sets (IIS), or calls problem.firstIIS if no IIS has been identified yet. [Infeasibility]
problem.nlpAddFormulas	Add non-linear formulas to the SLP problem. [Problem Modification]
problem.nlpCalcSlacks	Calculate the slack values for the provided solution in the non-linear problem [Solution]
problem.nlpChgFormula	Add or replace a single matrix formula using a parsed or unparsed formula [Problem Modification]
problem.nlpChgFormulaStr	Add or replace a single matrix formula using a character string for the formula. [Problem Modification]
problem.nlpCurrentIV	Transfer the current solution to initial values [Data Input]
problem.nlpDelFormulas	Delete nonlinear formulas from the current problem [Problem Modification]
problem.nlpEvaluateFormula	Evaluate a formula using the current values of the variables [Solution]
problem.nlpGetFormula	Retrieve a single matrix formula as a formula split into tokens. [Problem Information]
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 Information]
problem.nlpLoadFormulas	Load non-linear formulas into the SLP problem [Problem Information]
problem.nlpOptimize	Maximize or minimize an SLP problem [Solution Process]
problem.nlpPostsolveProb	Restores the problem to its pre-solve state [Presolve]
problem.nlpPrintEvalInfo	Print a summary of any evaluation errors that may have occurred during solving a problem [Logging]
problem.nlpSetInitVal	Set the initial value of a variable [Data Input]
problem.nlpValidate	Validate the feasibility of constraints in a converged solution [Solution]
problem.nlpValidateKKT	Validates the first order optimality conditions also known as the Karush-Kuhn-Tucker (KKT) conditions versus the currect solution [Solution]
problem.nlpValidateRow	Prints an extensive analysis on a given constraint of the SLP problem [Solution]
problem.nlpValidateVector	Validate the feasibility of constraints for a given solution [Solution]
problem.objSA	Returns upper and lower sensitivity ranges for specified objective function coefficients. [LP, Sensitivity Analysis]
problem.optimize	This function begins a search for the optimal solution of the problem. [Solution Process]
problem.pivot	Performs a simplex pivot by bringing variable enter into the basis and removing leave. [Linear Algebra, Simplex]
problem.postSolve	Postsolve the current matrix when it is in a presolved state. [Presolve, Solution Process]
problem.postSolveSol	Postsolves a primal solution formulated in the presolved space into the corresponding solution formulated in the input space. The problem itself is unchanged. [Presolve, Solution]
problem.presolveRow	Presolves a row formulated in terms of the original variables such that it can be added to a presolved matrix. [Misc, Presolve]
problem.presolveSol	Presolves a primal solution formulated in the input space into the corresponding solution formulated in the presolved space. The problem itself is unchanged. [Presolve, Solution]
problem.printIIS	Prints a given Irreducible Infeasible Set (IIS) in the log. [Infeasibility, Logging]
problem.readBasis	Instructs the Optimizer to read in a previously saved basis from a file. [File IO, LP]
problem.readBinSol	Reads a solution from a binary solution file. [File IO, Solution]
problem.readDirs	Reads a directives file to help direct the tree search. [Branching, File IO]
problem.readProb	Reads an (X)MPS or LP format matrix from file. [File IO, Problem Creation]
problem.readSlxSol	Reads an ASCII solution file .slx created by the problem.writeSlxSol function. [File IO, Solution]
problem.removeAfterObjectiveCallback	Removes a callback function previously added by problem.addAfterObjectiveCallback. [Callback, Multiobjective]
problem.removeBarIterationCallback	Removes a barrier iteration callback function previously added by problem.addBarIterationCallback. The specified callback function will no longer be called after it has been removed. [Barrier, Callback]
problem.removeBarlogCallback	Removes a Newton barrier log callback function previously added by problem.addBarlogCallback. The specified callback function will no longer be called after it has been removed. [Barrier, Callback]
problem.removeBeforeObjectiveCallback	Removes a callback function previously added by problem.addBeforeObjectiveCallback. [Callback, Multiobjective]
problem.removeChangeBranchObjectCallback	Removes a callback function previously added by problem.addChangeBranchObjectCallback. [Branching, Callback]
problem.removeCheckTimeCallback	Removes a callback function previously added by problem.addCheckTimeCallback. [Callback, Limits]
problem.removeComputeRestartCallback	Removes a computerestart callback function previously added by problem.addComputeRestartCallback. The specified callback function will no longer be called after it has been removed. [Callback, Compute Interface]
problem.removeCutlogCallback	Removes a cut log callback function previously added by problem.addCutlogCallback. [Callback, Logging]
problem.removeCutRoundCallback	Removes a cut round callback function previously added by problem.addCutRoundCallback. [Callback, Cuts]
problem.removeGapNotifyCallback	Removes a callback function previously added by problem.addGapNotifyCallback. [Callback, Limits]
problem.removeInfnodeCallback	Removes a user infeasible node callback function previously added by problem.addInfnodeCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removeIntsolCallback	Removes an integer solution callback function previously added by problem.addIntsolCallback. The specified callback function will no longer be called after it has been removed. [Callback, Solution]
problem.removeLplogCallback	Removes a simplex log callback function previously added by problem.addLplogCallback. The specified callback function will no longer be called after it has been removed. [Callback, Logging]
problem.removeMessageCallback	Removes a message callback function previously added by problem.addMessageCallback. [Callback, Logging]
problem.removeMiplogCallback	Removes a MIP log callback function previously added by problem.addMiplogCallback. The specified callback function will no longer be called after it has been removed. [Callback, Logging]
problem.removeMipThreadCallback	Removes a callback function previously added by problem.addMipThreadCallback. [Callback, Parallel]
problem.removeMipThreadDestroyCallback	Removes a child thread destruction callback function previously added by problem.addMipThreadDestroyCallback. The specified callback function will no longer be called after it has been removed. [Callback, Parallel]
problem.removeMsJobEndCallback	Removes a callback function previously added by problem.addMsJobEndCallback. [Callback, Multistart]
problem.removeMsJobStartCallback	Removes a callback function previously added by problem.addMsJobStartCallback. [Callback, Multistart]
problem.removeMsWinnerCallback	Removes a callback function previously added by problem.addMsWinnerCallback. [Callback, Multistart]
problem.removeNewnodeCallback	Removes a new-node callback function previously added by problem.addNewnodeCallback. [Branch and Bound Search, Callback]
problem.removeNlpCoefEvalErrorCallback	Removes a callback function previously added by problem.addNlpCoefEvalErrorCallback. The specified callback function will no longer be called after it has been removed. [Callback, Numerics]
problem.removeNodecutoffCallback	Removes a node-cutoff callback function previously added by problem.addNodecutoffCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removeNodeLPSolvedCallback	Removes a node callback function previously added by problem.addNodeLPSolvedCallback. [Branch and Bound Search, Callback]
problem.removeOptnodeCallback	Removes a node-optimal callback function previously added by problem.addOptnodeCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removePreIntsolCallback	Removes a pre-integer solution callback function previously added by problem.addPreIntsolCallback. The specified callback function will no longer be called after it has been removed. [Callback, Solution]
problem.removePrenodeCallback	Removes a preprocess node callback function previously added by problem.addPrenodeCallback. The specified callback function will no longer be called after it has been removed. [Branch and Bound Search, Callback]
problem.removePresolveCallback	Removes a presolve callback function previously added by problem.addPresolveCallback. [Callback, Presolve]
problem.removeSlpCascadeEndCallback	Removes a callback function previously added by problem.addSlpCascadeEndCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpCascadeStartCallback	Removes a callback function previously added by problem.addSlpCascadeStartCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpCascadeVarCallback	Removes a callback function previously added by problem.addSlpCascadeVarCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpCascadeVarFailCallback	Removes a callback function previously added by problem.addSlpCascadeVarFailCallback. The specified callback function will no longer be called after it has been removed. [Callback, Cascading, SLP]
problem.removeSlpConstructCallback	Removes a callback function previously added by problem.addSlpConstructCallback. The specified callback function will no longer be called after it has been removed. [Callback, SLP]
problem.removeSlpDrColCallback	Removes a callback function previously added by problem.addSlpDrColCallback. [Callback, Cascading, SLP]
problem.removeSlpIntSolCallback	Removes a callback function previously added by problem.addSlpIntSolCallback. [Callback, MISLP]
problem.removeSlpIterEndCallback	Removes a callback function previously added by problem.addSlpIterEndCallback. [Callback, SLP]
problem.removeSlpIterStartCallback	Removes a callback function previously added by problem.addSlpIterStartCallback. The specified callback function will no longer be called after it has been removed. [Callback, SLP]
problem.removeSlpIterVarCallback	Removes a callback function previously added by problem.addSlpIterVarCallback. [Callback, SLP, SLP-convergence]
problem.removeSlpPreUpdateLinearizationCallback	Removes a callback function previously added by problem.addSlpPreUpdateLinearizationCallback. The specified callback function will no longer be called after it has been removed. [Callback, SLP]
problem.removeUserSolNotifyCallback	Removes a user solution notification callback previously added by problem.addUserSolNotifyCallback. The specified callback function will no longer be called after it has been removed. [Callback, Solution]
problem.repairInfeas	Provides a simplified interface for problem.repairWeightedInfeas. [Infeasibility]
problem.repairWeightedInfeas	By relaxing a set of selected constraints and bounds of an infeasible problem, it attempts to identify a 'solution' that violates the selected set of constraints and bounds minimally, while satisfying all other constraints and bounds. Among such solution candidates, it selects one that is optimal regarding the original objective function. [Infeasibility]
problem.repairWeightedInfeasBounds	An extended version of problem.repairWeightedInfeas that allows for bounding the level of relaxation allowed. [Infeasibility]
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.saveAs . Optimization may then recommence from the point at which the file was created. [File IO, Save Restore]
problem.rhsSA	Returns upper and lower sensitivity ranges for specified right hand side (RHS) function coefficients. [LP, Sensitivity Analysis]
problem.save	Alias of problem.saveAs.
problem.saveAs	Saves the current data structures to file and terminates the run [File IO, Save Restore]
problem.scale	Re-scales the current matrix. [Numerics]
problem.setControl	Sets one or more controls of a problem.
problem.setDefaultControl	Sets a single control to its default value. [Controls and Attributes]
problem.setDefaults	Sets all controls to their default values. [Controls and Attributes]
problem.setIndicators	Specifies that a set of rows in the matrix will be treated as indicator constraints during a tree search. [Problem Creation]
problem.setLogFile	This directs all Optimizer output to a log file. [File IO, Logging]
problem.setMessageStatus	Manages suppression of messages. [Misc]
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 problem name. [Problem Information]
problem.slpAddCoefs	Add non-linear coefficients to the SLP problem. [Problem Modification, SLP]
problem.slpCascadeOrder	Establish a re-calculation sequence for SLP variables with determining rows. [Data Input, SLP]
problem.slpCascadeSol	Re-calculate consistent values for SLP variables based on the current values of the remaining variables. [Cascading, SLP, Solution Process]
problem.slpChgCascadeNLimit	Set a variable specific cascade iteration limit [Data Input, SLP]
problem.slpChgCoef	Add or change a single matrix coefficient using a parsed or unparsed formula. [Problem Modification, SLP]
problem.slpChgCoefStr	Add or change a single matrix coefficient using a character string for the formula. [Problem Modification, SLP]
problem.slpChgDeltaType	Changes the type of the delta assigned to a nonlinear variable [Problem Modification, SLP]
problem.slpChgRowStatus	Change the status setting of a constraint [Bit-vector, Data Input, SLP]
problem.slpChgRowWt	Set or change the initial penalty error weight for a row [Data Input, SLP]
problem.slpConstruct	Create the full augmented SLP matrix and data structures, ready for optimization [SLP, Solution Process]
problem.slpDelCoefs	Delete coefficients from the current problem. [Problem Modification, SLP]
problem.slpEvaluateCoef	Evaluate a coefficient using the current values of the variables [Solution]
problem.slpFixPenalties	Fixe the values of the error vectors [Solution Process]
problem.slpGetCoefFormula	Retrieve a single matrix coefficient as a formula split into tokens. [Problem Information, SLP]
problem.slpGetCoefs	Retrieve the list of positions of the nonlinear coefficients in the problem. [Problem Information, SLP]
problem.slpGetCoefStr	Retrieve a single matrix coefficient as a formula in a character string. [Problem Information, SLP]
problem.slpGetColInfo	Get current column information. [SLP, Solution]
problem.slpGetRowInfo	Get current row information. [SLP, Solution]
problem.slpGetRowStatus	Retrieve the status setting of a constraint [Bit-vector, SLP, Solution]
problem.slpGetRowWT	Get the initial penalty error weight for a row [Data Information, SLP]
problem.slpLoadCoefs	Load non-linear coefficients into the SLP problem. [Problem Information, SLP]
problem.slpReInitialize	Reset the SLP problem to match a just augmented system [SLP, Solution Process]
problem.slpSetDetRow	Set the determining row of a variable [Cascading, Data Input, SLP]
problem.slpUnConstruct	Removes the augmentation and returns the problem to its pre-linearization state [SLP, Solution Process]
problem.slpUpdateLinearization	Updates the current linearization [SLP, Solution Process]
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. [Cuts]
problem.strongBranch	Performs strong branching iterations on all specified bound changes. [Branching]
problem.strongBranchCB	Performs strong branching iterations on all specified bound changes. [Branching]
problem.tune	This function begins a tuner session for the current problem. [Tuner]
problem.tuneProbSetFile	This function begins a tuner session for a set of problems. [Tuner]
problem.tunerReadMethod	This function loads a user defined tuner method from the given file. [File IO, Tuner]
problem.tunerWriteMethod	This function writes the current tuner method to a given file or prints it to the console. [File IO, Tuner]
problem.writeBasis	Writes the current basis to a file for later input into the Optimizer. [File IO, LP]
problem.writeBinSol	Writes the current MIP or LP solution to a binary solution file for later input into the Optimizer. [File IO, Solution]
problem.writeDirs	Writes the tree search directives from the current problem to a directives file. [Branching, File IO]
problem.writeIIS	Writes an LP/MPS/CSV file containing a given Irreducible Infeasible Set (IIS). [File IO, Infeasibility]
problem.writeProb	Writes the current problem to an MPS or LP file. [File IO]
problem.writePrtSol	Writes the current solution to a fixed format ASCII file, problem_name .prt. [File IO, Solution]
problem.writeSlxSol	Creates an ASCII solution file (.slx) using a similar format to MPS files. [File IO, Solution]
problem.writeSol	Writes the current solution to a CSV format ASCII file, problem_name.asc (and .hdr). [File IO, Solution]

© 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