Ingo Weinhold
5bced18eab
* Got rid of class ObjFunctionSummand. Both the constraint summands and the objective function summands are now stored using class Summand. * Some method names are more BeOS compliant now: SetX instead of ChangeX. * linprog test code now uses new AddConstraint methods. * CalculateMinSize and CalculateMaxSize did not free the memory they allocated. * Removed inappropriate setter and getter methods. * Memory allocated in class Constraint is freed now. * Other small changes. git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@24351 a95241bf-73f2-0310-859d-f6bbb57e9c96
68 lines
1.9 KiB
C++
68 lines
1.9 KiB
C++
/*
|
|
* Copyright 2007-2008, Christof Lutteroth, [email protected]
|
|
* Copyright 2007-2008, James Kim, [email protected]
|
|
* Distributed under the terms of the MIT License.
|
|
*/
|
|
|
|
#include "PenaltyFunction.h"
|
|
#include "Constraint.h"
|
|
#include "Summand.h"
|
|
#include "OperatorType.h"
|
|
#include "Variable.h"
|
|
#include "LinearSpec.h"
|
|
|
|
|
|
/**
|
|
* Constructor.
|
|
*/
|
|
PenaltyFunction::PenaltyFunction(LinearSpec* ls, Variable* var, BList* xs, BList* gs)
|
|
{
|
|
int32 sizeXs = xs->CountItems();
|
|
int32 sizeGs = gs->CountItems();
|
|
if (var->LS() != ls)
|
|
printf("The variable must belong to the same linear specification as the penalty function.");
|
|
if (sizeXs + 1 != sizeGs)
|
|
printf("The number of sampling points must be exactly one less than the number of gradients.");
|
|
for (int32 i = 1; i < sizeGs; i++) {
|
|
if (*(double*)(gs->ItemAt(i - 1)) > *(double*)(gs->ItemAt(i)))
|
|
printf("Penalty function must be concave.");
|
|
}
|
|
|
|
fVar = var;
|
|
fXs = xs;
|
|
fGs = gs;
|
|
fConstraints = new BList(sizeGs + 1);
|
|
fObjFunctionSummands = new BList(sizeGs);
|
|
|
|
fConstraints->AddItem(ls->AddConstraint(1.0, var, OperatorType(EQ),
|
|
*(double*)(xs->ItemAt(0)), -*(double*)(gs->ItemAt(0)),
|
|
*(double*)(gs->ItemAt(1))));
|
|
|
|
for (int32 i = 1; i < sizeGs; i++) {
|
|
Variable* dPos = ls->AddVariable();
|
|
|
|
fConstraints->AddItem(ls->AddConstraint(1.0, var, -1.0, dPos, OperatorType(LE),
|
|
*(double*)(xs->ItemAt(i))));
|
|
|
|
Summand* objSummand = new Summand(*(double*)(gs->ItemAt(i + 1)) - *(double*)(gs->ItemAt(i)), dPos);
|
|
ls->ObjFunction()->AddItem(objSummand);
|
|
fObjFunctionSummands->AddItem(objSummand);
|
|
}
|
|
ls->UpdateObjFunction();
|
|
}
|
|
|
|
|
|
/**
|
|
* Destructor.
|
|
* Removes all constraints and summands from the penalty function.
|
|
*/
|
|
PenaltyFunction::~PenaltyFunction()
|
|
{
|
|
for (int32 i = 0; i < fConstraints->CountItems(); i++)
|
|
delete (Constraint*)fConstraints->ItemAt(i);
|
|
|
|
for (int32 i = 0; i < fObjFunctionSummands->CountItems(); i++)
|
|
delete (Summand*)fObjFunctionSummands->ItemAt(i);
|
|
}
|
|
|