What the hint of Problem 3.6(b)

[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?

[magdon]

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.

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?

[mileschen]

Yes, I could understand this. The difficulty for me is to find the min and separate the optimization variable w. For Ein, it is hard to separate w in order to find c.

[magdon]

I don't see why you need to do "separate w to find c". If you satisfy the constraints, you have Ein=0 which is the minimum. So in this part, all you really need to do is satisfy the constraints, so you can literally choose c to be anything you want.

Originally Posted by mileschen

Yes, I could understand this. The difficulty for me is to find the min and separate the optimization variable w. For Ein, it is hard to separate w in order to find c.