UGC NET CSE | June 2016 | Part 3 | Question: 61

Question

The region of feasible solution of a linear programminig problem has a ____ property in geometry, provided the feasible solution of the problem exists

• A. concavity
• B. convexity
• C. quadratic
• D. polyhedron

Answer 1

ans will be B 

Geometric interpretation. The set of points in IRn at which any single constraint holds with equality is a hyperplane in IRn. Thus each constraint is satisfied by the points of a closed half-space of IRn, and the set of feasible solutions is the intersection of all these half-spaces, a convex polyhedron P.

refer http://www.ens-lyon.fr/DI/wp-content/uploads/2011/10/introduction-lp-duality1.pdf

file:///C:/Users/admin1/Downloads/9783540401384-c2.pdf