CppAD: A C++ Algorithmic Differentiation Package  20171217
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
template<class Dvector, class ADvector, class FG_eval>
virtual bool CppAD::ipopt::solve_callback< Dvector, ADvector, FG_eval >::get_bounds_info ( Index  n,
Number *  x_l,
Number *  x_u,
Index  m,
Number *  g_l,
Number *  g_u 
)
inlinevirtual

Return bound information about optimization problem.

Parameters
[in]nis the dimension of the domain space for f(x) and g(x); i.e., it must be equal to nx_.
[out]x_lis a vector of size nx_. The input value of its elements does not matter. On output, it is a copy of the lower bound for $ x $; i.e., xl_.
[out]x_uis a vector of size nx_. The input value of its elements does not matter. On output, it is a copy of the upper bound for $ x $; i.e., xu_.
[in]mis the dimension of the range space for g(x). i.e., it must be equal to ng_.
[out]g_lis a vector of size ng_. The input value of its elements does not matter. On output, it is a copy of the lower bound for $ g(x) $; i.e., gl_.
[out]g_uis a vector of size ng_. The input value of its elements does not matter. On output, it is a copy of the upper bound for $ g(x) $; i.e, gu_.

Definition at line 522 of file solve_callback.hpp.