recategorized by
2,466 views
2 votes
2 votes

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
recategorized by

1 Answer

Best answer
0 votes
0 votes

ans is B no feasible solution 

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

selected by
Answer:

Related questions

3 votes
3 votes
1 answer
2
go_editor asked Jul 27, 2016
2,291 views
If the primal Linear Programming problem has unbounded solution, then it's dual problem will havefeasible solutionalternative solutionno feasible solution at allno altern...
1 votes
1 votes
1 answer
3
go_editor asked Aug 11, 2016
14,487 views
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zerogeneratedegenerateinfeasibleunbounded
1 votes
1 votes
1 answer
4
go_editor asked Jul 12, 2016
4,230 views
In a Linear Programming Problem, suppose there are three basic variables and 2 non-basic variables, then the possible number of basic solutions are681012