#include <boxfind.h>
Collaboration diagram for DualBounds:
Public Member Functions | |
DualBounds (Pointer< MinlpProblem > S_, Pointer< MinlpProblem > C_, Pointer< Param > param_, int type_=1) | |
int | update_box (int n) |
int | update_box () |
double | obj_bound () |
Private Member Functions | |
double | dual_bound (UserVector< double > &a) |
Private Attributes | |
Pointer< Param > | param |
Pointer< MinlpProblem > | S |
Pointer< MinlpProblem > | C |
Pointer< MinlpProblem > | R |
vector< Pointer< MinlpProblem > > | lag_prob |
vector< list< int > > | lin_con |
Indices of linear constraints for each block. | |
vector< bool > | lin_con2 |
Indicates for each constraint of (S) or (C), whether it is linear or not. | |
int | type |
Definition at line 114 of file boxfind.h.
DualBounds::DualBounds | ( | Pointer< MinlpProblem > | S_, | |
Pointer< MinlpProblem > | C_, | |||
Pointer< Param > | param_, | |||
int | type_ = 1 | |||
) |
double DualBounds::dual_bound | ( | UserVector< double > & | a | ) | [private] |
int DualBounds::update_box | ( | int | n | ) |
double DualBounds::obj_bound | ( | ) |
Pointer<Param> DualBounds::param [private] |
Pointer<MinlpProblem> DualBounds::S [private] |
Pointer<MinlpProblem> DualBounds::C [private] |
Pointer<MinlpProblem> DualBounds::R [private] |
vector<Pointer<MinlpProblem> > DualBounds::lag_prob [private] |
vector<list<int> > DualBounds::lin_con [private] |
vector<bool> DualBounds::lin_con2 [private] |
int DualBounds::type [private] |