Linear Programming. Methods and Applications : Implementing the simplex method

Implementing the simplex method
Linear Programming. Methods and Applications

Author : Jean-François SCHEID

Publication date: October 10, 2015 | Lire en français

Add to my library

5. Implementing the simplex method

Consider a linear program in the standard form (5), i.e. of the form

\begin{array}{l} \max_{x \in ℝ^{n}} [F (x) = c^{T} x] \\ { \end{array}

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!

Ongoing reading
Implementing the simplex method

(1) - BILLIONNET (A.) - Optimisation discrète – De la modélisation à la résolution par des logiciels de programmation mathématique. - Dunod (2007).
(2) - BREZINSKI (C.) - Initiation à la programmation linéaire et à l'algorithme du simplexe. - Ellipse, Paris (2006).

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!

Article included in this offer

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources