Part (a) gives constraints that
w must satisfy. These are the constraints in the linear program. Argue that you can choose
c to be anything you want because
any weights satisfying the constraints will work.
Quote:
Originally Posted by mileschen
I have no idea about how to formulate the task of finding a separating w for separable data as a linear program. Could you probably tell me the first step of solving it?
