| #
18e5da62 |
|
31-Aug-2012 |
czeidler <haiku@clemens-zeidler.de> |
Remove unused variable and add copy constructor.
|
| #
7583db5a |
|
24-Jan-2011 |
Clemens Zeidler <clemens.zeidler@googlemail.com> |
Add an alternative solver to lp_solve. The solver based on Ingo's active set solver but is able to handle arbitrary hard and soft constraints. The advantage to lp_solve is that the active set solver can optimize variable in respect to a quadratic objective function. This makes it possible to minimise the quadratic derivation to a desired value e.g. \Sum_i(x_i - x_{i,pref})^2 -> min.
The solver part has been refactored in this way that both solver can be used with the same layout specifications. The active set solver is default now; the performance is not as good as lp_solve, though.
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@40285 a95241bf-73f2-0310-859d-f6bbb57e9c96
|
| #
601eded9 |
|
20-Sep-2010 |
Clemens Zeidler <clemens.zeidler@googlemail.com> |
- Hide constraint header in Area file.
- Start to replace BList with BObjectList.
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@38741 a95241bf-73f2-0310-859d-f6bbb57e9c96
|
| #
43b24b87 |
|
19-Sep-2010 |
Clemens Zeidler <clemens.zeidler@googlemail.com> |
Simplify code and clean up.
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@38738 a95241bf-73f2-0310-859d-f6bbb57e9c96
|
| #
676ef01b |
|
15-Oct-2009 |
Axel Dörfler <axeld@pinc-software.de> |
* Applied patch by Hong Yul Yang to update linprog.
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@33609 a95241bf-73f2-0310-859d-f6bbb57e9c96
|
| #
5bced18e |
|
10-Mar-2008 |
Ingo Weinhold <ingo_weinhold@gmx.de> |
ALM/linprog patch by Christof Lutteroth:
* 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
|
| #
03069455 |
|
24-Feb-2008 |
Ingo Weinhold <ingo_weinhold@gmx.de> |
Patch by Christof Lutteroth:
* copyright headers for the files of the libraries linprog and alm
* new class Summand for representing summands in a linear constraint
* merged class SoftConstraint into class Constraint; Constraint now
supports both soft and hard constraint functionality
* new AddConstraint methods in class LinearSpec for directly setting
constraints with 1 to 4 summands
* code cleanups by using aforementioned AddConstraint methods
* a new very simple test application for alm
* some style corrections
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@24108 a95241bf-73f2-0310-859d-f6bbb57e9c96
|
| #
18e5da6297639dd15fea0b021d22d394a4ab1852 |
|
31-Aug-2012 |
czeidler <haiku@clemens-zeidler.de> |
Remove unused variable and add copy constructor.
|
| #
7583db5a1ec81636829331e5fc7cae81ca7a7ba7 |
|
24-Jan-2011 |
Clemens Zeidler <clemens.zeidler@googlemail.com> |
Add an alternative solver to lp_solve. The solver based on Ingo's active set solver but is able to handle arbitrary hard and soft constraints. The advantage to lp_solve is that the active set solver can optimize variable in respect to a quadratic objective function. This makes it possible to minimise the quadratic derivation to a desired value e.g. \Sum_i(x_i - x_{i,pref})^2 -> min.
The solver part has been refactored in this way that both solver can be used with the same layout specifications. The active set solver is default now; the performance is not as good as lp_solve, though.
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@40285 a95241bf-73f2-0310-859d-f6bbb57e9c96
|
| #
601eded950be7b7abf8fe5ce8c5b0064f631e10d |
|
20-Sep-2010 |
Clemens Zeidler <clemens.zeidler@googlemail.com> |
- Hide constraint header in Area file.
- Start to replace BList with BObjectList.
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@38741 a95241bf-73f2-0310-859d-f6bbb57e9c96
|
| #
43b24b87de3aaf7504084891b1b9ad43fc4711b2 |
|
19-Sep-2010 |
Clemens Zeidler <clemens.zeidler@googlemail.com> |
Simplify code and clean up.
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@38738 a95241bf-73f2-0310-859d-f6bbb57e9c96
|
| #
676ef01ba74e966b1ce7f4117372bbc5f1290cc4 |
|
15-Oct-2009 |
Axel Dörfler <axeld@pinc-software.de> |
* Applied patch by Hong Yul Yang to update linprog.
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@33609 a95241bf-73f2-0310-859d-f6bbb57e9c96
|
| #
5bced18eab0b1318f3293c1c5c5b1a9d52fa3770 |
|
10-Mar-2008 |
Ingo Weinhold <ingo_weinhold@gmx.de> |
ALM/linprog patch by Christof Lutteroth:
* 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
|
| #
0306945545b0fc20ec4da7cff2e99ac39f48d726 |
|
24-Feb-2008 |
Ingo Weinhold <ingo_weinhold@gmx.de> |
Patch by Christof Lutteroth:
* copyright headers for the files of the libraries linprog and alm
* new class Summand for representing summands in a linear constraint
* merged class SoftConstraint into class Constraint; Constraint now
supports both soft and hard constraint functionality
* new AddConstraint methods in class LinearSpec for directly setting
constraints with 1 to 4 summands
* code cleanups by using aforementioned AddConstraint methods
* a new very simple test application for alm
* some style corrections
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@24108 a95241bf-73f2-0310-859d-f6bbb57e9c96
|