3 votes 3 votes The region of feasible solution of a linear programminig problem has a ____ property in geometry, provided the feasible solution of the problem exists concavity convexity quadratic polyhedron Others ugcnetcse-june2016-paper3 optimization linear-programming + – go_editor asked Aug 21, 2016 • recategorized Nov 6, 2017 by Devshree Dubey go_editor 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes 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 Sanjay Sharma answered Aug 21, 2016 Sanjay Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.