The Gateway to Computer Science Excellence
+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

  1. A polygon
  2. Unbounded feasible region
  3. A point
  4. None of these
in Optimization by
recategorized | 1.1k views

1 Answer

+1 vote

Ans is B as feasible region away from the origin is unbounded

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.

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
52,375 questions
60,583 answers
95,403 users