recategorized by
5,447 views
3 votes
3 votes

In any simplex table, if corresponding to any negative $\Delta$ j, all elements of the column are negative or zero, the solution under the test is

  1. degenerate solution
  2. unbounded solution
  3. alternative solution
  4. non-existing solution
recategorized by

1 Answer

0 votes
0 votes

ans will be option B) unbounded solution .

An unbounded solution of a linear programming problem is a situation where objective function is infinite. A linear programming problem is said to have unbounded solution if its solution can be made infinitely large without violating any of its constraints in the problem. Since there is no real applied problem which has infinite return, hence an unbounded solution always represents a problem that has been incorrectly formulated. Under the Simplex Method, an unbounded solution is indicated when there are no positive values of Replacement(or exchange ) Ratio i.e. Replacement ratio values are either infinite(when denominator has zero value) or negative(denominator is negative). In this case there is no outgoing variable.

Answer:

Related questions

2 votes
2 votes
1 answer
1
go_editor asked Jul 7, 2016
2,933 views
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$ isA polygonU...
2 votes
2 votes
3 answers
2
go_editor asked Jul 7, 2016
6,398 views
The optimal solution of the following assignment problem using Hungarian method is$\begin{array}{|l|l|l|l|} \hline \text{ } & \text{I} & \text{II} & \text{III} & \text{IV...
1 votes
1 votes
1 answer
3
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
3 votes
3 votes
1 answer
4
go_editor asked Aug 21, 2016
1,632 views
The region of feasible solution of a linear programminig problem has a ____ property in geometry, provided the feasible solution of the problem existsconcavityconvexityqu...