Hi to all,
This is my first post. Actually I have a problem.
It goes like this,
a1 + b1*c > 0
a2 + b2*c > 0
a3 + b3*c >= 0
this may continue with more such constraints. I know the values of a1, a2, . . . and the b1,b2, . . . Then there is no other restriction on the value 'c', like lower or upper bounds. I need to find the vector 'c'. The point is 'c' here is a vector and not a scalar. If it is a scalar, a simple comparison program can give the window of its value.

I was looking at the simplex algorithm in NR but i wasnt able to structure the problem like maximization. Can anyone suggest a solution.

Regards