Linear programming problems can be solved by _________

Linear programming problems can be solved by _________ Correct Answer Revised simplex method

Linear programming problems can be conveniently solved by the revised simplex method and the simplex algorithm for solving the general linear programming problem is an iterative procedure which yields an exact optima solution in a finite number of steps.

Related Questions

In many problems the path to goal is irrelevant, this class of problems can be solved using ____________