# Operations Research - lesson 2
#### Federico Malucelli
###### 26 Sept 2017
## Problems modeling

---

algorithm:
- sort the indices by $\frac{c_i}{a_i}$
- $remaining_budget \leftarrow b$
- i<-1
- repeat
    * $y_1 \leftarrow min {1, \frac{remaining budget}{a_i}}$
    * $remaining_budget \leftarrow remaining_budget - a_i*y_i$
    * $i \leftarrow i+1$
- until $i=n+1$ or remaining_budget = 0