next up previous contents index
suivant: Simplex algorithm: simplex_reduce monter: The CAS functions précédent: Subspace generated by the   Table des matières   Index


Linear Programmation

Linear programming problems are maximization problem of a linear functional under linear equality or inequality constraints. The most simple case can be solved directly by the so-called simplex algorithm. Most cases requires to solve an auxiliary linear programming problem to find an initial vertex for the simplex algorithm.



Sous-sections

giac documentation written by Renée De Graeve and Bernard Parisse