2 votes 2 votes The feasible region represented by the constraints $x_1 - x_2 \leq 1, x_1 + x_2 \geq 3, x_1 \geq 0, x_2 \geq 0$ of the objective function Max $Z=3x_1 + 2x_2$ is A polygon Unbounded feasible region A point None of these Optimization ugcnetcse-june2012-paper3 optimization linear-programming + – go_editor asked Jul 7, 2016 • recategorized May 24, 2020 go_editor 3.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Ans is B as feasible region away from the origin is unbounded Sanjay Sharma answered Jul 7, 2016 Sanjay Sharma comment Share Follow See 1 comment See all 1 1 comment reply MonikaV commented Jun 16, 2019 reply Follow Share But region for the inequality x1−x2≤1 should be towards the origin instead of away from it as if we put (0,0) in it we get 0 which is less then 1 hence (0,0) will lie in that region. 0 votes 0 votes Please log in or register to add a comment.