Skip to content

Commit bb673ec

Browse files
committed
remove warnings
1 parent ad63d61 commit bb673ec

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

lectures/lp_intro.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -478,7 +478,7 @@ Once we solve the problem, we can check whether the solver was successful in sol
478478
```{code-cell} ipython3
479479
# Solve the problem
480480
# we put a negative sign on the objective as linprog does minimization
481-
res_ex1 = linprog(-c_ex1, A_ub=A_ex1, b_ub=b_ex1, method='revised simplex')
481+
res_ex1 = linprog(-c_ex1, A_ub=A_ex1, b_ub=b_ex1)
482482
483483
if res_ex1.success:
484484
# We use negative sign to get the optimal value (maximized value)
@@ -570,7 +570,7 @@ Let's solve the problem and check the status using `success` attribute.
570570
```{code-cell} ipython3
571571
# Solve the problem
572572
res_ex2 = linprog(-c_ex2, A_eq=A_ex2, b_eq=b_ex2,
573-
bounds=bounds_ex2, method='revised simplex')
573+
bounds=bounds_ex2)
574574
575575
if res_ex2.success:
576576
# We use negative sign to get the optimal value (maximized value)

0 commit comments

Comments
 (0)