Skip to content

Commit 705f38c

Browse files
committed
remove warnings
1 parent ad63d61 commit 705f38c

File tree

2 files changed

+7
-7
lines changed

2 files changed

+7
-7
lines changed

lectures/cobweb.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -448,7 +448,7 @@ TODO check / fix exercises
448448
## Exercises
449449

450450
```{exercise-start}
451-
:label: ex1
451+
:label: cobweb_ex1
452452
```
453453
Using the default Market model and naive expectations, plot a time series simulation of supply (rather than the price).
454454

@@ -457,7 +457,7 @@ Show, in particular, that supply also cycles.
457457
```{exercise-end}
458458
```
459459

460-
```{solution-start} ex1
460+
```{solution-start} cobweb_ex1
461461
:class: dropdown
462462
```
463463

@@ -498,7 +498,7 @@ ts_plot_supply(m, 5, 15)
498498
```
499499

500500
```{exercise-start}
501-
:label: ex2
501+
:label: cobweb_ex2
502502
```
503503
**Backward looking average expectations**
504504

@@ -519,7 +519,7 @@ Simulate and plot the price dynamics for $\alpha \in \{0.1, 0.3, 0.5, 0.8\}$ whe
519519
```{exercise-end}
520520
```
521521

522-
```{solution-start} ex2
522+
```{solution-start} cobweb_ex2
523523
:class: dropdown
524524
```
525525

lectures/lp_intro.md

Lines changed: 3 additions & 3 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)
@@ -692,7 +692,7 @@ Find the number of units of $A$ and product $B$ that he should manufacture in or
692692
```
693693
694694
695-
```{solution-start} lp_intro_ex1
695+
```{solution-start} lp_intro_ex2
696696
:class: dropdown
697697
```
698698

0 commit comments

Comments
 (0)