Skip to main content
Book

Linear Optimization and Extensions

  • Padberg M
(1999), 49-86
N/ACitations
Citations of this article
52Readers
Mendeley users who have this article in their library.

Abstract

We are now ready to state an iterative procedure for the resolution of the linear programming problem (LP) in standard form with descriptive “input data” m, n, A, b and c.

Cite

CITATION STYLE

APA

Padberg, M. (1999). Linear Optimization and Extensions. Simplex Algorithms (pp. 49–86). Retrieved from https://doi.org/10.1007/978-3-662-12273-0_5

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