The Gateway to Computer Science Excellence
+3 votes
901 views

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

  1. concavity
  2. convexity
  3. quadratic
  4. polyhedron
in Others by Veteran (105k points)
recategorized by | 901 views

1 Answer

+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

by Boss (48.8k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,556 answers
195,715 comments
101,582 users