, including all inherited members.
| get_cut(const dvector &x, int c, int block_nr, double val=INFINITY) | LinearizedConCutGenerator | |
| get_cuts(list< pair< LinearizationCut, pair< int, bool > > > &cuts, const MINLPData::ObjCon &objcon, int objcon_nr, const dvector &x, const dvector &lower, const dvector &upper, bool violated_polyest_only=false) | LinearizedConCutGenerator | |
| get_cuts(list< pair< LinearizationCut, pair< int, bool > > > &cuts, const MINLPData::Constraint &objcon, int objcon_nr, const dvector &x, const dvector &lower, const dvector &upper, bool violated_polyest_only=false) | LinearizedConCutGenerator | |
| get_cuts(list< pair< LinearizationCut, pair< int, bool > > > &cuts, const dvector &x, const dvector &lower, const dvector &upper, bool violated_polyest_only=false) | LinearizedConCutGenerator | |
| LinearizedConCutGenerator(Pointer< MinlpProblem > prob_, Pointer< MINLPData > minlpdata_=NULL, Pointer< Reformulation > reform_=NULL) | LinearizedConCutGenerator | |
| max_violation | LinearizedConCutGenerator | |
| minlpdata | LinearizedConCutGenerator | [private] |
| prob | LinearizedConCutGenerator | [private] |
| reform | LinearizedConCutGenerator | [private] |
| set_MINLPData(Pointer< MINLPData > minlpdata_) | LinearizedConCutGenerator | [inline] |
| set_problem(Pointer< MinlpProblem > prob_) | LinearizedConCutGenerator | [inline] |
| set_reform(Pointer< Reformulation > reform_) | LinearizedConCutGenerator | |
| tol | LinearizedConCutGenerator | [private, static] |
| update_cut(LinearizationCut &cut, unsigned int block_nr, const dvector &lower, const dvector &upper) | LinearizedConCutGenerator | |
