libs/linprog/ActiveSetSolver.cpp

393 static bool is_soft_inequality(Constraint* constraint)
395 	if (constraint->PenaltyNeg() <= 0. && constraint->PenaltyPos() <= 0.)
397 	if (constraint->Op() != kEQ)
410 			Constraint* constraint = allConstraints.ItemAt(c);
411 			if (!is_soft_inequality(constraint))
418 				kEQ, 0, constraint->PenaltyNeg(), constraint->PenaltyPos());
422 			if (constraint->Op() == kGE)
425 			Constraint* modifiedConstraint = new Constraint(constraint);
443 				// this also deletes the constraint
477 	// setup constraint matrix and add slack variables if necessary
480 		Constraint* constraint = allConstraints.ItemAt(c);
481 		if (is_soft(constraint))
483 		SummandList* leftSide = constraint->LeftSide();
484 		system.B(rowIndex) = constraint->RightSide();
491 		if (constraint->Op() == kLE) {
494 		} else if (constraint->Op() == kGE) {
587 ActiveSetSolver::ConstraintAdded(Constraint* constraint)
594 ActiveSetSolver::ConstraintRemoved(Constraint* constraint)
601 ActiveSetSolver::LeftSideChanged(Constraint* constraint)
608 ActiveSetSolver::RightSideChanged(Constraint* constraint)
615 ActiveSetSolver::OperatorChanged(Constraint* constraint)
622 ActiveSetSolver::PenaltiesChanged(Constraint* constraint)
667 		Constraint* constraint = allConstraints.ItemAt(i);
668 		// soft eq an ineq constraint?
669 		if (constraint->PenaltyNeg() <= 0. && constraint->PenaltyPos() <= 0.)
672 		if (RemoveConstraint(constraint, false, false) == true)
673 			list.AddItem(constraint);
682 		Constraint* constraint = list.ItemAt(i);
684 		if (AddConstraint(constraint, false) == false)
685 			delete constraint;