The Gateway to Computer Science Excellence
+2 votes
945 views

The following Linear Programming problem has:

$\text{Max} \quad Z=x_1+x_2$

Subject to $\quad x_1-x_2 \geq 0$

$\quad \quad \quad 3x_1 - x_2 \leq -3$

$\text{and} \quad x_1 , x_2 \geq 0 $

  1. Feasible solution
  2. No feasible solution
  3. Unbounded solution
  4. Single point as solution
in Others by Veteran (105k points)
retagged by | 945 views

1 Answer

0 votes
Best answer

ans is B no feasible solution 

draw lines for two inequalities nothing is common in shaded area so infeasible solution

by Boss (48.8k points)
selected by

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,597 answers
195,837 comments
102,133 users