- #1
lockedup
- 70
- 0
This semester while taking Linear Programming (Linear Optimization Models), we talked about using a linear program to separate two sets of points A and B. The general program is:
Max d
s.t.
yA ≥ axA+b+d
yB ≤ axB+b-d
It can be expanded into finding a polynomial that passes between the two sets.
I'm wondering if anyone has tried other functions. My book says you can as long you leave the function alone and just work with the coefficients. I'm trying to work with trig functions (cos(πx) mostly because the period is 1) and exponential functions but I'm not getting very far. Has anyone seen or tried anything like this?
Max d
s.t.
yA ≥ axA+b+d
yB ≤ axB+b-d
It can be expanded into finding a polynomial that passes between the two sets.
I'm wondering if anyone has tried other functions. My book says you can as long you leave the function alone and just work with the coefficients. I'm trying to work with trig functions (cos(πx) mostly because the period is 1) and exponential functions but I'm not getting very far. Has anyone seen or tried anything like this?