|
| BonminProblem (OSInstance *osinstance_, OSOption *osoption_) |
| the BonminProblemclass constructor More...
|
|
virtual | ~BonminProblem () |
| the BonminProblem class destructor More...
|
|
virtual bool | get_scaling_parameters (Ipopt::Number &obj_scaling, bool &use_x_scaling, Ipopt::Index n, Ipopt::Number *x_scaling, bool &use_g_scaling, Ipopt::Index m, Ipopt::Number *g_scaling) |
|
virtual const SosInfo * | sosConstraints () const |
|
virtual const BranchingInfo * | branchingInfo () const |
|
void | printSolutionAtEndOfAlgorithm () |
|
|
now for some pure Bonmin methods
|
virtual bool | get_variables_types (Ipopt::Index n, VariableType *var_types) |
| Pass the type of the variables (INTEGER, BINARY, CONTINUOUS) to the optimizer. More...
|
|
virtual bool | get_variables_linearity (Ipopt::Index n, Ipopt::TNLP::LinearityType *var_types) |
| Pass info about linear and nonlinear variables. More...
|
|
virtual bool | get_constraints_linearity (Ipopt::Index m, Ipopt::TNLP::LinearityType *const_types) |
| Pass the type of the constraints (LINEAR, NON_LINEAR) to the optimizer. More...
|
|
|
This group of function implement the various elements needed to define and solve a TNLP.
They are the same as those in a standard Ipopt NLP problem
|
virtual bool | get_nlp_info (Ipopt::Index &n, Ipopt::Index &m, Ipopt::Index &nnz_jac_g, Ipopt::Index &nnz_h_lag, Ipopt::TNLP::IndexStyleEnum &index_style) |
| Method to pass the main dimensions of the problem to Ipopt. More...
|
|
virtual bool | get_bounds_info (Ipopt::Index n, Ipopt::Number *x_l, Ipopt::Number *x_u, Ipopt::Index m, Ipopt::Number *g_l, Ipopt::Number *g_u) |
| Bonmin specific methods for defining the nlp problem. More...
|
|
virtual bool | get_starting_point (Ipopt::Index n, bool init_x, Ipopt::Number *x, bool init_z, Ipopt::Number *z_L, Ipopt::Number *z_U, Ipopt::Index m, bool init_lambda, Ipopt::Number *lambda) |
| Method to return the starting point for the algorithm. More...
|
|
virtual bool | eval_f (Ipopt::Index n, const Ipopt::Number *x, bool new_x, Ipopt::Number &obj_value) |
| Method to return the objective value. More...
|
|
virtual bool | eval_grad_f (Ipopt::Index n, const Ipopt::Number *x, bool new_x, Ipopt::Number *grad_f) |
| Method to return the gradient of the objective. More...
|
|
virtual bool | eval_g (Ipopt::Index n, const Ipopt::Number *x, bool new_x, Ipopt::Index m, Ipopt::Number *g) |
| Method to return the constraint residuals. More...
|
|
virtual bool | eval_jac_g (Ipopt::Index n, const Ipopt::Number *x, bool new_x, Ipopt::Index m, Ipopt::Index nele_jac, Ipopt::Index *iRow, Ipopt::Index *jCol, Ipopt::Number *values) |
| Method to return: 1) The structure of the jacobian (if "values" is NULL) 2) The values of the jacobian (if "values" is not NULL) More...
|
|
virtual bool | eval_h (Ipopt::Index n, const Ipopt::Number *x, bool new_x, Ipopt::Number obj_factor, Ipopt::Index m, const Ipopt::Number *lambda, bool new_lambda, Ipopt::Index nele_hess, Ipopt::Index *iRow, Ipopt::Index *jCol, Ipopt::Number *values) |
| Method to return: 1) The structure of the hessian of the lagrangian (if "values" is NULL) 2) The values of the hessian of the lagrangian (if "values" is not NULL) More...
|
|
|
virtual void | finalize_solution (Bonmin::TMINLP::SolverReturn status_, Ipopt::Index n, const Ipopt::Number *x, Ipopt::Number obj_value) |
| Method called by Ipopt at the end of optimization. More...
|
|
Definition at line 53 of file OSBonminSolver.h.