Continuous linear programming methods
Optimization in integers

Add to my library

AF1251 V1 Article

Continuous linear programming methods
Optimization in integers

Author : Michel MINOUX

Publication date: April 10, 2008 | Lire en français

Add to my library Add to my library

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

3. Continuous linear programming methods

This section briefly reviews the two main approaches used in practice to solve continuous linear programs:

  • the simplex method [13][14];

  • interior point methods [30].

3.1 Simplex algorithm

The simplex method [13][14] is a classic. Here, we simply recall it in its primitive, "revised" form, rather than in its primitive form (the "table" method). Indeed, it's the revised form that is used in all high-performance software (e.g. COIN, CPLEX, XPRESS-MP, see [Doc....

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?

Article included in this offer

"Mathematics"

( 168 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact us
Contact our team FAQ