interior point methods is really hard for me to follow. Doesthis method search the optimal from inside of the feasible regionpolyhedron, where as the simplex algorithm search the surfacevertex? What is the time complexity of the interior point method?Is it more efficient than the simplex algorithm?
On the other hand, why don’t we use gradient descent or Newton’smethod for the linear programming problem?
Expert Answer
An answer will be send to you shortly. . . . .