edited by
1,778 views
1 votes
1 votes

Consider the following statements:

  1. Revised simplex method requires lesser computations than the simplex methods
  2. Revised simplex method automatically generates the inverse of the current basis matrix
  3. Less number of entries are needed in each table of the revised simplex method than usual simplex method

Which of these statements is true?

  1. i and ii only
  2. i and iii only
  3. ii and iii only
  4. i, ii, and iii
edited by

1 Answer

1 votes
1 votes

Revised simplex method is an improvement over simplex method. Revised simplex method is computationally more efficient and accurate.Benefit of revised simplex method is  comprehended in case of large LP problems. In simplex method the entire simplex tableau is updated while a small part of it is used. The revised simplex method uses exactly the same steps as those in simplex method. The only difference occurs in the details of computing the entering variables and departing variable

No automatic alt text available.

so Ans is D 

Answer:

Related questions

1 votes
1 votes
2 answers
1
go_editor asked Aug 21, 2016
3,502 views
The following transportation problem :$\begin{array}{|l|l|l|l|l|} \hline & \text{A} & \text{B} & \text{C} & \text{Supply} \\\hline \text{I} & \text{50} & \text{30} & \tex...
3 votes
3 votes
1 answer
2
go_editor asked Aug 21, 2016
1,633 views
The region of feasible solution of a linear programminig problem has a ____ property in geometry, provided the feasible solution of the problem existsconcavityconvexityqu...
1 votes
1 votes
1 answer
3
makhdoom ghaya asked Aug 2, 2016
7,557 views
If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution isOptimumInfeasible Unbounded Degenerate
2 votes
2 votes
3 answers
4
go_editor asked Jul 7, 2016
6,400 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...