Re: [ojAlgo-user] Problem resolvable with ojAlgo?

[Anders P. <an...@op...>]

ojAlgo can handle LP and QP problems. In addition to that there is a MIP solver (master algorithm with the LP or QP solvers as slaves) that sometimes work.

/Anders


On 9 apr 2010, at 12.22, kr...@Ma... wrote:

> Hello list members,
> 
> i'd like to know whether this minimization problem is resolvable with
> ojAlgo. I don't know at all how to get started with it.
> 
> I have a set of points P in 3d-space and a special point Q which is a
> reference point for the minimization problem: The goal is to find a
> hyperplane H so that the sum of distances from H to all points in P is
> minimal. Constraint: For every p element of P distance(p, Q) must be <=
> distance(H, Q).
> To illustrate the problem I plotted an example in 2d-space:
> http://www.savyon.de/share/minimization.png
> 
> 
> Many thanks in advance,
> 
> Timo
> 
> ------------------------------------------------------------------------------
> Download Intel&#174; Parallel Studio Eval
> Try the new software tools for yourself. Speed compiling, find bugs
> proactively, and fine-tune applications for parallel performance.
> See why Intel Parallel Studio got high marks during beta.
> http://p.sf.net/sfu/intel-sw-dev
> _______________________________________________
> ojAlgo-user mailing list
> ojA...@li...
> https://lists.sourceforge.net/lists/listinfo/ojalgo-user
> 
>