Which is NOT a concept in Karmarkar's method? a.project of a ...

[Mr.Thesaxman]

Which is NOT a concept in Karmarkar's method?
  a.project of a vector onto the set of x satisfying Ax=0.
  b.revised simplex method
  c.centering transformation
  d.potential function

Question 2

The advantage of using the simplex algorithm uith upper bounds over the revised simplex method is:
  a.the simplex algorithm with upper bounds checks more bfs than the revised simplex method.
  b.B^-1 for the simplex algorithm with upper bounds is not dependent on the number of upper bound constraints.
  c.B^-1 for the simplex algorithm with upper bounds is larger than B^-1 for the revised simplex method.
  d.the simplex algorithm with upper bounds provides a better optimal solution.

[apple]

Answer to Question 1

correct: b

Answer to Question 2

correct: b

[Mr.Thesaxman]

Both answers were spot on, thank you once again

[apple]

Great! Please up vote