You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: lectures/lp_intro.md
+6-6Lines changed: 6 additions & 6 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -28,11 +28,11 @@ If a primal problem involves **maximization**, the dual problem involves **minim
28
28
29
29
If a primal problem involves **minimization**, the dual problem involves **maximization**.
30
30
31
-
We provide a standard form of a linear program and methods to transform other forms of linear programming problems into a standard form.
31
+
We provide a standard form of a linear program and methods to transform other forms of linear programming problems into a standard form.
32
32
33
-
We tell how to solve a linear programming prolem using **Scipy**.
33
+
We tell how to solve a linear programming problem using [SciPy](https://scipy.org/).
34
34
35
-
We describe the important concept of complementary slackness and how it relates to the dual problem.
35
+
We describe the important concept of complementary slackness and how it relates to the dual problem.
36
36
37
37
Let's start with some standard imports.
38
38
@@ -436,9 +436,9 @@ Inside it, Python first transforms the problem into standard form.
436
436
437
437
To do that, for each inequality constraint it generates one slack variable.
438
438
439
-
Here the vector of slack variables is a two-dimensional numpy array that equals $b_{ub} - A_{ub}x$.
439
+
Here the vector of slack variables is a two-dimensional NumPy array that equals $b_{ub} - A_{ub}x$.
440
440
441
-
See [official documentation](https://docs.scipy.org/doc/scipy/reference/generated/scipy.optimize.linprog.html#scipy.optimize.linprog) for more details.
441
+
See the [official documentation](https://docs.scipy.org/doc/scipy/reference/generated/scipy.optimize.linprog.html#scipy.optimize.linprog) for more details.
442
442
443
443
```{note}
444
444
This problem is to maximize the objective, so that we need to put a minus sign in front of parameter vector c.
@@ -801,4 +801,4 @@ As for numerical results,
801
801
802
802
3. $p_6 = -0.16$, which means one dollar of the loan amount at the beginning of the third year is worth $\$ 0.16$. Since $|p_6|$ is higher than the interest rate 6\%, the mutual fund should borrow as much as possible at the beginning of the third year. Recall that the optimal solution to the primal problem is $x_4 = -20,000$ which means the mutual fund borrows money from the bank as much as it can.
803
803
804
-
4. $p_7 = 0.0015$, which means one dollar of the amount of the corporate bond that the mutual fund can buy is worth $\$ 0.0015$.
804
+
4. $p_7 = 0.0015$, which means one dollar of the amount of the corporate bond that the mutual fund can buy is worth $\$ 0.0015$.
0 commit comments