Linear Programming - Standard Form

Standard form is the usual and most intuitive form of describing a linear programming problem. It consists of the following three parts:

  • A linear function to be maximized
e.g.
  • Problem constraints of the following form
e.g.
\begin{matrix} a_{11} x_1 + a_{12} x_2 &\leq b_1 \\ a_{21} x_1 + a_{22} x_2 &\leq b_2 \\ a_{31} x_1 + a_{32} x_2 &\leq b_3 \\
\end{matrix}
  • Non-negative variables
e.g.
\begin{matrix} x_1 \geq 0 \\ x_2 \geq 0
\end{matrix}

The problem is usually expressed in matrix form, and then becomes:

Other forms, such as minimization problems, problems with constraints on alternative forms, as well as problems involving negative variables can always be rewritten into an equivalent problem in standard form.

Read more about this topic:  Linear Programming

Famous quotes containing the words standard and/or form:

    “When Freedom, from her mountain height,
    Unfurled her standard to the air,
    She tore the azure robe of night,
    And set the stars of glory there;”
    —Joseph Rodman Drake (1795–1820)

    “Every idea is endowed of itself with immortal life, like a human being. All created form, even that which is created by man, is immortal. For form is independent of matter: molecules do not constitute form.”
    —Charles Baudelaire (1821–1867)