Initializing help system before first use

mipoptimize

Purpose
This function begins a tree search for the optimal MIP solution.
The direction of optimization is given by OBJSENSE. The status of the problem when the function completes can be checked using MIPSTATUS.
Synopsis
mipoptimize(prob, flags = "")
Arguments
prob 
The current problem.
flags 
Flags to pass to mipoptimize (MIPOPTIMIZE), which specifies how to solve the initial continuous problem where the MIP entities are relaxed. If the argument includes:
b
the initial continuous relaxation will be solved using the Newton barrier method (or the hybrid gradient method if BARALG is set to 4);
p
the initial continuous relaxation will be solved using the primal simplex algorithm;
d
the initial continuous relaxation will be solved using the dual simplex algorithm;
n
the network part of the initial continuous relaxation will be identified and solved using the network simplex algorithm;
l
stop after having solved the initial continous relaxation.
Return value
The input argument prob.
Further information
Please refer to the C documentation for more details.

© 2001-2024 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.