[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## [Help-glpk] Re: Can this problem be solved in LP without binary conditio

**From**: |
m xiaomi |

**Subject**: |
[Help-glpk] Re: Can this problem be solved in LP without binary condition? |

**Date**: |
Sat, 2 Oct 2010 09:51:26 +0800 |

Just to be clear, both the total area and the area for point are rectangular.
2010/10/2, xm <address@hidden>:
>* The problem is: Given a total area, let's say, from (0,0) to (10,10);*
>* given an area for one point(x,y) that movable, let's say 2<=x<=6,*
>* 1<=y<=6. Find the closest position of (x,y) to the boundary of the total*
>* area. In the example, the solution should be (x,1), x can be any in the*
>* constraint.*
>
>* Can this problem be solved in LP without binary condition?*
>* Thanks.*
>