This is a linear programming problem. The way you formulate the
problem depends on the capabilities of the linear programming software
you have.
Basically, you want to
minimize c
by finding x(1) to x(n) such that
|x(i)-x(j)| <= c for all i and j
r1(i) <= x(i) <= r2(i) for all i
Dave
On Oct 5, 9:22 am, monty 1987 <1986mo...@gmail.com> wrote:
> We have to locate n points on the x-axis
> For each point xi
> the x co-ordinate of it lies between a range
> [r1i,r2i]
> Now we have to decide the location of points such that
> minimum { distance between any two points } is maximum.
>
> Any answer is welcomed.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
