XPRBprobsolve(String) Method |
Use lpOptimize and mipOptimize methods instead
Call Xpress-Optimizer solution algorithm. This method selects and starts the
Xpress-Optimizer solution algorithm. The characters indicating the algorithm
choice may be combined where it makes sense, e.g. "dg". If the matrix loaded
in Xpress-Optimizer does not correspond to the current problem definition it
is regenerated automatically prior to the start of the algorithm. The sense of
the optimization (default: minimization) can be changed with method setSense(int).
Before solving a problem, the objective function must be selected with setObj().
Note that if you use an incomplete global search you should finish your program
with a call to the Xpress-Optimizer method XPRSprob.PostSolve()
(see Xpress-Optimizer manual for details) in order to remove all search tree
information that has been stored. Otherwise you may not be able to re-run your program.
Namespace: BCLAssembly: xprbdn (in xprbdn.dll) Version: 47.01.01+0ba4e76731516b80760698bbaa939494dae84e49
Syntax[ObsoleteAttribute("Use lpOptimize and mipOptimize methods instead")]
public int solve(
string alg
)<ObsoleteAttribute("Use lpOptimize and mipOptimize methods instead")>
Public Function solve (
alg As String
) As IntegerParameters
- alg String
- The string choice of solution algorithm. Possible values are:
- "p" – Use primal simplex algorithm.
- "d" – Use dual simplex algorithm.
- "b" – Use Newton-Barrier algorithm.
- "l" – Only solve the (relaxed) linear problem.
- "g" – Solve the global (MIP) problem.
- "" – No parameter, use the default setting (LP only).
Return Value
Int320 on success, 1 otherwise.
Examplexbburg.cs, xbburgi.cs, xbcoco.cs, xbcoco1.cs, xbcoco2.cs, xbcoco3.cs, xbcontr1.cs, xbdelvr.cs,
xbexpl.cs, xbportf.cs and xbpurch.cs in the Introductory Examples folder.
xbcutstk.cs, xbels.cs, xbelsc.cs, xbfixbv.cs and xbrecurs.cs in the Advanced Examples folder.
xbcutex.cs, xbexpl1.cs, xbexpl1i.cs, xbexpl2.cs, xbqprl2.cs and xbexpl3.cs in teh User's Guide Examples
folder.
See Also