Comparison between the simplex algorithm and interior point method
2015-01-30 21:32
316 查看
The success of primal-dual algorithm and its variants, as well as IPM in general,
comes (or at least was triggered) from its superiority with respect to simplex
algorithm. The primal-dual algorithm has a set of advantages with respect to simplex
algorithm, but also disadvantages that fortunately can be handled within the
algorithm. Some of the advantages and disadvantages are enumerated below.
Advantages of primal-dual algorithm:
• The algorithm does not has any problems with degeneracies and the number of
iterations is not related to the number of vertices in the feasible region.
• For large LP problems the algorithm uses significantly fewer iterations than
simplex algorithm.
• Most implementations of the algorithm usually solve a LP problem in less than
100 iterations even though the problem may contain millions of variables.
Disadvantages of primal-dual algorithm:
• The algorithm cannot detect a possible infeasible or unbounded status of the
problem, and in some sense the primal-dual algorithm is not complete.
Fortunately, this problem can be handled using homogenous model [4,7].
• Each iteration of the primal-dual algorithm is computationally much more
expensive than one iteration of the simplex algorithm. However, the total work
performed to solve a LP problem is a product of the number of iterations and the
work performed in each iteration. For a large LP problem (say more than 100
variables) the primal-dual algorithms outperforms the simplex algorithm, and the
bigger the problem size is this is the more pronounced.
comes (or at least was triggered) from its superiority with respect to simplex
algorithm. The primal-dual algorithm has a set of advantages with respect to simplex
algorithm, but also disadvantages that fortunately can be handled within the
algorithm. Some of the advantages and disadvantages are enumerated below.
Advantages of primal-dual algorithm:
• The algorithm does not has any problems with degeneracies and the number of
iterations is not related to the number of vertices in the feasible region.
• For large LP problems the algorithm uses significantly fewer iterations than
simplex algorithm.
• Most implementations of the algorithm usually solve a LP problem in less than
100 iterations even though the problem may contain millions of variables.
Disadvantages of primal-dual algorithm:
• The algorithm cannot detect a possible infeasible or unbounded status of the
problem, and in some sense the primal-dual algorithm is not complete.
Fortunately, this problem can be handled using homogenous model [4,7].
• Each iteration of the primal-dual algorithm is computationally much more
expensive than one iteration of the simplex algorithm. However, the total work
performed to solve a LP problem is a product of the number of iterations and the
work performed in each iteration. For a large LP problem (say more than 100
variables) the primal-dual algorithms outperforms the simplex algorithm, and the
bigger the problem size is this is the more pronounced.
相关文章推荐
- What is the difference between a Generative and Discriminative Algorithm?
- What is the difference between @staticmethod and @classmethod in Python?
- What is the difference between Array.Clone and Array.Copy Method
- what is the different between function and method in python
- The comparison of the toString() method and the valueOf(...) method of the String class
- The difference between major and minor version in sharepoint
- What is the difference between tag and branch-id?
- The Difference Between RegisterStartupScript and RegisterClientScriptBlock
- the difference between ClientID and ID of web control
- What is the difference between User Control and Custom Control?
- What is the relationship between the From, Contact, Via and Record-Route/Route headers?
- The difference of overriding between C# and Java
- The balance between the number of specs and the rate of coverage
- The differences between BLOB and TEXT
- The differen between Server Timers, Windows Timers, and Thread Timers
- Browser, Schmouser(the diverge between JScript and JavaScript)
- Switching between the Microsoft VM and the Sun JVM
- The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix
- The difference between Failure and Success