Hi a friend's just asked how you find ANY point inside a printed shape without testing mountains of points.
I suggested the simplex method with a dummy objective function but all the trivial examples I've seen consist of (in themselves) unconstrained straight lines that interfere only at suitably appropriate points .e.g to form a nice convenient triangle.
I've attached a diagram of the "feasible" region and as you can see if you continued some of the implied lines forming the edges you'd slice the region to shreds.
My question is how would you represent the truncations of the lines in your system of inequalities.
BTW Assume you're talking to a layman...'cos you ARE! <smile>.
Thank you in anticipation for any forthcoming help.
Dean