B
- barrier
![](../../icons/localidx.gif)
- barrier optimizer
- algorithm
![](../../icons/localidx.gif)
- algorithms and infeasibility
![](../../icons/localidx.gif)
- barrier display parameter
![](../../icons/localidx.gif)
- centering corrections
![](../../icons/localidx.gif)
- column nonzeros parameter
,
![](../../icons/localidx.gif)
- corrections limit
![](../../icons/localidx.gif)
- growth parameter
![](../../icons/localidx.gif)
- infeasibility analysis
![](../../icons/localidx.gif)
- linear
to
![](../../icons/localidx.gif)
- log file
![](../../icons/localidx.gif)
- numerical difficulties and
![](../../icons/localidx.gif)
- out-of-core barrier
![](../../icons/localidx.gif)
- parallel
![](../../icons/localidx.gif)
- performance tuning
![](../../icons/localidx.gif)
- preprocessing
![](../../icons/localidx.gif)
- primal-dual
![](../../icons/localidx.gif)
- quadratic
to
![](../../icons/localidx.gif)
- row-ordering algorithms
![](../../icons/localidx.gif)
- simplex optimizer and
![](../../icons/localidx.gif)
- solution quality
![](../../icons/localidx.gif)
- solving LP problems
![](../../icons/localidx.gif)
- starting-point heuristics
![](../../icons/localidx.gif)
- unbounded optimal face and
![](../../icons/localidx.gif)
- unbounded problems
![](../../icons/localidx.gif)
- uses
![](../../icons/localidx.gif)
- working storage allocation
![](../../icons/localidx.gif)
- BarThreads
![](../../icons/localidx.gif)
BAS
file format
,
,
![](../../icons/localidx.gif)
- basis
![](../../icons/localidx.gif)
- accessing information
![](../../icons/localidx.gif)
- condition number
,
![](../../icons/localidx.gif)
- crossover algorithms
![](../../icons/localidx.gif)
- current
![](../../icons/localidx.gif)
- file formats to save
,
![](../../icons/localidx.gif)
- previous optimal
![](../../icons/localidx.gif)
- removing objects from
![](../../icons/localidx.gif)
- saving best so far
![](../../icons/localidx.gif)
- unstable optimal
![](../../icons/localidx.gif)
- see also advanced basis
- Best Bound
![](../../icons/localidx.gif)
- Best Estimate
![](../../icons/localidx.gif)
- bibliography
![](../../icons/localidx.gif)
- BIN file format
![](../../icons/localidx.gif)
- Boolean or semi-continuous variables
- single LP
![](../../icons/localidx.gif)
boolVar
![](../../icons/localidx.gif)
boolVarArray
![](../../icons/localidx.gif)
- bound
- violation
![](../../icons/localidx.gif)
Bounded
- return status
![](../../icons/localidx.gif)
- branch & cut
![](../../icons/localidx.gif)
- algorithm
![](../../icons/localidx.gif)
- parallel processing
![](../../icons/localidx.gif)
- parameters
![](../../icons/localidx.gif)
- solves MIP models
![](../../icons/localidx.gif)
- tree
![](../../icons/localidx.gif)
- branch & cut algorithm
- memory problems and
![](../../icons/localidx.gif)
- priority order
![](../../icons/localidx.gif)
- special ordered sets (SOS)
![](../../icons/localidx.gif)
- storing tree nodes
![](../../icons/localidx.gif)
- tree subproblems
![](../../icons/localidx.gif)
- branching directions
![](../../icons/localidx.gif)
BtTol
![](../../icons/localidx.gif)