A simple one, but my skills are even simpler...

[Guest]

Hello everyone!

There are a pair of inequalities that I need to solve.

1., kw + (gs * (gp - 1) * 0.98) > 0
2., kl + (gs * -1) > 0

kw, kl, gp are fixed values, and I need the LOWEST value of gs, where both 1., and 2., conditions are met, that is, the left side of both inequalities is greater than zero.

I've written an algorithm for this that iterates gs and looks for the smallest value, but it's paaaainfully slow... I wonder if this could be solved by a simple equation ordering and thus replacing iteration with a single step?

Thanks for every help!
Sz