IntervalReduction Class Reference

#include <boxfind.h>

Collaboration diagram for IntervalReduction:

Collaboration graph
[legend]
List of all members.

Public Types

 LOWER
 UPPER
 WHATEVER
enum  which_bound_type { LOWER, UPPER, WHATEVER }

Public Member Functions

 IntervalReduction (Pointer< MinlpProblem > prob_=NULL)
void set_problem (Pointer< MinlpProblem > prob_)
void compute (dvector &newlow, dvector &newup, const dvector &oldlow, const dvector &oldup)
void compute (dvector &newlow, dvector &newup, const dvector &oldlow, const dvector &oldup, set< pair< int, which_bound_type > > &startset)
void print_small_boxes (dvector &low, dvector &up)

Public Attributes

bool do_print
bool empty_boxes
double min_impr
int maxfunceval
set< pair< int, int > > reduced_integer
dvector reduction_by_block
 Stores for each block, how much it was reduced.
double reduction

Private Types

typedef Graph< NodeData, EdgeData,
true, true > 
DependencyGraph

Private Member Functions

void run (dvector &newlow, dvector &newup, const dvector &oldlow, const dvector &oldup, set< pair< const DependencyGraph::NodeType *, which_bound_type > > &nodeset)

Private Attributes

Pointer< MinlpProblemprob
DependencyGraph dependency_graph

Friends

ostream & operator<< (ostream &out, const EdgeData &ed)

Classes

class  EdgeData
class  NodeData

Detailed Description

Definition at line 143 of file boxfind.h.


Member Typedef Documentation

typedef Graph<NodeData,EdgeData,true,true> IntervalReduction::DependencyGraph [private]

Definition at line 181 of file boxfind.h.


Member Enumeration Documentation

enum IntervalReduction::which_bound_type

Enumerator:
LOWER 
UPPER 
WHATEVER 

Definition at line 145 of file boxfind.h.


Constructor & Destructor Documentation

IntervalReduction::IntervalReduction ( Pointer< MinlpProblem prob_ = NULL  ) 


Member Function Documentation

void IntervalReduction::run ( dvector newlow,
dvector newup,
const dvector oldlow,
const dvector oldup,
set< pair< const DependencyGraph::NodeType *, which_bound_type > > &  nodeset 
) [private]

void IntervalReduction::set_problem ( Pointer< MinlpProblem prob_  ) 

void IntervalReduction::compute ( dvector newlow,
dvector newup,
const dvector oldlow,
const dvector oldup 
)

void IntervalReduction::compute ( dvector newlow,
dvector newup,
const dvector oldlow,
const dvector oldup,
set< pair< int, which_bound_type > > &  startset 
)

void IntervalReduction::print_small_boxes ( dvector low,
dvector up 
)


Friends And Related Function Documentation

ostream& operator<< ( ostream &  out,
const EdgeData ed 
) [friend]


Member Data Documentation

Pointer<MinlpProblem> IntervalReduction::prob [private]

Definition at line 179 of file boxfind.h.

DependencyGraph IntervalReduction::dependency_graph [private]

Definition at line 182 of file boxfind.h.

bool IntervalReduction::do_print

Definition at line 187 of file boxfind.h.

bool IntervalReduction::empty_boxes

Definition at line 188 of file boxfind.h.

double IntervalReduction::min_impr

Definition at line 189 of file boxfind.h.

int IntervalReduction::maxfunceval

Definition at line 190 of file boxfind.h.

set<pair<int, int> > IntervalReduction::reduced_integer

Definition at line 191 of file boxfind.h.

dvector IntervalReduction::reduction_by_block

Stores for each block, how much it was reduced.

Definition at line 195 of file boxfind.h.

double IntervalReduction::reduction

Definition at line 196 of file boxfind.h.


The documentation for this class was generated from the following file:
Generated on Wed Oct 22 03:12:55 2008 for LaGO by  doxygen 1.4.7