## In a linear programming problem, the constraints on the decision variables x and y are π₯ − 3π¦ ≥ 0, π¦ ≥ 0, 0 ≤ π₯ ≤ 3. The feasible region

## (a) is not in the first quadrant

## (b) is bounded in the first quadrant

## (c) is unbounded in the first quadrant

## (d) does not exist

##
###
Advertisement

###
Advertisement

### Advertisement

### Advertisement