class Mixed_qp : public Ineq_constrained_qp

Quadratic programming with mixed linear constraints

Inheritance:


Public Methods

void add_equality_cons(Vector c, double r)
add a constraint,

c*vars == r

PRE c

Vector Mixed_qp::solve(Vector start)
eliminate appropriate variables, until we have a Ineq_constrained_qp then solve that

Inherited from Ineq_constrained_qp:

Public Methods

void add_inequality_cons(Vector c, double r)
void assert_solution(Vector sol)
Vector constraint_solve(Vector)
int dim()
Real eval(Vector v)
Vector Ineq_constrained_qp::constraint_solve(Vector start)
Vector solve(Vector start)

Documentation

Quadratic programming with mixed linear constraints. problem definition of a quadratic optimisation problem with linear inequality and equality constraints

x^T QUAD x /2 + b^T x

void add_equality_cons(Vector c, double r)
add a constraint,

c*vars == r

PRE c.dim()==dim ();

Vector Mixed_qp::solve(Vector start)
eliminate appropriate variables, until we have a Ineq_constrained_qp then solve that.

PRE cons should be ascending


This class has no child classes.

alphabetic index hierarchy of classes


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