Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions lectures/lp_intro.md
Original file line number Diff line number Diff line change
Expand Up @@ -487,9 +487,9 @@ The optimal plan tells the factory to produce $2.5$ units of Product 1 and $5$

We are using the `linprog` function as a *black box*.

Inside it, Python first transforms the problem into standard form.
Internally, after a presolve step, SciPy transforms the problem into a standard form before applying the selected solver.

To do that, for each inequality constraint it generates one slack variable.
In this transformation, one slack variable is added for each inequality constraint.

Here the vector of slack variables is a two-dimensional NumPy array that equals $b_{ub} - A_{ub}x$.

Expand Down