A container for storing several reformulations. More...
#include <minlpopt.h>

Public Member Functions | |
| Reformulation (MinlpOpt &opt_) | |
| void | reformulate () |
| dvector | get_short_vector (const dvector &x) |
| dvector | get_long_vector (const dvector &x) |
| bool | set_t_block (dvector &x, int k) |
Public Attributes | |
| Pointer< MinlpProblem > | ext_prob |
| Pointer< MinlpProblem > | ext_quad_prob |
| Pointer< MinlpProblem > | ext_convex_prob |
| vector< int > | related_t |
| To remember, which t was added for which constraint. | |
Private Member Functions | |
| void | add_var (vector< vector< Pointer< BlockMatrix > > > &A, vector< vector< Pointer< SepQcFunc > > > &s, MinlpProblem &prob, int k, int index, double lower, double upper, Pointer< char > name=NULL) |
| Adds a variable to a block of a problem. | |
| void | add_con (vector< vector< Pointer< BlockMatrix > > > &A, vector< vector< Pointer< SepQcFunc > > > &s, MinlpProblem &prob, int c, int k) |
| Adds one block of a constraint as a seperated constraint, assuming, that the last added variable is the appropiate t. | |
Private Attributes | |
| MinlpOpt & | opt |
A container for storing several reformulations.
Definition at line 54 of file minlpopt.h.
| Reformulation::Reformulation | ( | MinlpOpt & | opt_ | ) | [inline] |
Definition at line 76 of file minlpopt.h.
| void Reformulation::add_var | ( | vector< vector< Pointer< BlockMatrix > > > & | A, | |
| vector< vector< Pointer< SepQcFunc > > > & | s, | |||
| MinlpProblem & | prob, | |||
| int | k, | |||
| int | index, | |||
| double | lower, | |||
| double | upper, | |||
| Pointer< char > | name = NULL | |||
| ) | [private] |
Adds a variable to a block of a problem.
| void Reformulation::add_con | ( | vector< vector< Pointer< BlockMatrix > > > & | A, | |
| vector< vector< Pointer< SepQcFunc > > > & | s, | |||
| MinlpProblem & | prob, | |||
| int | c, | |||
| int | k | |||
| ) | [private] |
Adds one block of a constraint as a seperated constraint, assuming, that the last added variable is the appropiate t.
| void Reformulation::reformulate | ( | ) |
| bool Reformulation::set_t_block | ( | dvector & | x, | |
| int | k | |||
| ) |
MinlpOpt& Reformulation::opt [private] |
Definition at line 56 of file minlpopt.h.
Definition at line 66 of file minlpopt.h.
Definition at line 67 of file minlpopt.h.
Definition at line 68 of file minlpopt.h.
| vector<int> Reformulation::related_t |
To remember, which t was added for which constraint.
related_t should have split_prob->con.size(). related_t[c] stores the index of the t inside it's block (!), which belongs to constraint split_prob.con[c]
Definition at line 74 of file minlpopt.h.
1.6.1