Skip to main content
Book Chapter

Linear Programming Algorithms

Springer Berlin Heidelberg, (2007), 71-97
DOI: 10.1007/978-3-540-71844-4_4
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

There are basically three types of algorithms for Linear Programming: the Simplex Algorithm (see Section 3.2), interior point algorithms, and the Ellipsoid Method.

Cite

CITATION STYLE

APA

Linear Programming Algorithms. (2007). In Combinatorial Optimization (pp. 71–97). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-71844-4_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free