2. General forms of a linear program

2.1 Mixed canonical form

This is a linear programming problem, also known as a linear program, written in the following form:

\begin{array}{l} \max_{(x_{1}, \dots, x_{n})} [F (x_{1}, \dots, x_{n}) = c_{1} x_{1} + \dots + c_{n} x_{n} = \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
General forms of a linear program

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

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

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!