This class represents the set of active (binding) constraints which can be active while the QLP algorithm is in a feasible point
This class represents the set of active (binding) constraints which can be active while the QLP algorithm is in a feasible point. The active constraints are numbered. If the constraints are of the formA^T*x >= b
then the binding constraints are those where the >= is equality.
void add_constraint(int j)
void exchange(int in, int out)
Vector get_lagrange(Vector v)
void OK()
Vector Active_constraints::find_active_optimum(Vector g)
This program documentation comes from lilypond-1.0.0.tar.gz. It was generated by <janneke@gnu.org> on Fri Jul 31 15:42:17 CEST 1998