1. Home
  2. Fundamental sciences
  3. Mathematics
  4. Optimization in integers

  5. Continuous linear programming methods

Article | REF: AF1251 V1

Optimization in integers

Author: Michel MINOUX

Publication date: April 10, 2008

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

Already subscribed? Log in!

Français

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...

You do not have access to this resource.

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? Log in!

The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Mathematics

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Continuous linear programming methods
Outline