#include <cuts.h>
Collaboration diagram for IntervalGradientCutGenerator:
Public Member Functions | |
IntervalGradientCutGenerator (Pointer< MinlpProblem > prob_=NULL) | |
void | set_problem (Pointer< MinlpProblem > prob_) |
Pointer< IntervalGradientCut > | get_cuts (const dvector &x, int k, const dvector &low, const dvector &up) |
Generate interval gradient cut information according to a solution estimate and a block. | |
Pointer< IntervalGradientCut > | update_cuts (Pointer< IntervalGradientCut > cut, int k, const dvector &low, const dvector &up) |
Public Attributes | |
double | min_violation |
Private Attributes | |
Pointer< MinlpProblem > | prob |
The problem, we generate the cuts for. | |
vector< Pointer< SparsityInfo > > | sparsity |
Definition at line 115 of file cuts.h.
IntervalGradientCutGenerator::IntervalGradientCutGenerator | ( | Pointer< MinlpProblem > | prob_ = NULL |
) | [inline] |
void IntervalGradientCutGenerator::set_problem | ( | Pointer< MinlpProblem > | prob_ | ) | [inline] |
Pointer<IntervalGradientCut> IntervalGradientCutGenerator::get_cuts | ( | const dvector & | x, | |
int | k, | |||
const dvector & | low, | |||
const dvector & | up | |||
) |
Generate interval gradient cut information according to a solution estimate and a block.
x | The solution estimate. (reference point) | |
k | The block-number. | |
low | Current lower bounds. | |
up | Current upper bounds. |
Referenced by update_cuts().
Pointer<IntervalGradientCut> IntervalGradientCutGenerator::update_cuts | ( | Pointer< IntervalGradientCut > | cut, | |
int | k, | |||
const dvector & | low, | |||
const dvector & | up | |||
) | [inline] |
The problem, we generate the cuts for.
Definition at line 119 of file cuts.h.
Referenced by IntervalGradientCutGenerator(), and set_problem().
vector<Pointer<SparsityInfo> > IntervalGradientCutGenerator::sparsity [private] |
Definition at line 121 of file cuts.h.
Referenced by IntervalGradientCutGenerator(), and set_problem().