We must provide each student with a bear. How to organize delivery?

### How to deal with such a problem ?

#### Is there an optimal solution ?

This is typical resources allocation problem with constrains.

All students must be served. We can translate this problem and treat our students as resources. Let X

_{i}be a number of bears per

*i*'th dorm, Y

_{j}number of bears in

*j*'th shop. Let also x

_{ij}be number of bears for

*i*'th dorm from

*j*'th shop.

Then we can describe our problem as

**maximization**problem of following function

`SUM(x`_{ij})

- where we take into consideration only such a x_{ij}where

*j*'th shop can be reached from

*i*'th dorm.

The constrains are following:

For each

*j*:

`SUM`_{i}(x_{ij})

<= Y_{j}

which means that we cannot give more bears than we have in

*j*shop.

For each

*i*:

`SUM`_{j}(x_{ij})

= X_{i}

which means that all students from

*i*'th dorm must be served.

The only problem is that for some reason this cannot be solved using OpenOffice solver on my laptop (probably not ideal openSuse configuration ;) ). So please use something more comercial :D

Sometimes working at the university also means solving quite daily life problems ;)

## No comments:

Post a Comment