Capacity Utilization

Description

This app is a productivity optimization tool. It calculates optimal fill up of a (1d) resource with different objects.
Generic description of problem:
Given are objects, which of each is described with its size and priority of use. Objects of the same size and priority are grouped in sets. So contains each set a number of objects. Furthermore, there is a target resource with a limited capacity. The resource should be filled with the subsets of the above objects sets. In addition, the objects set with the highest priority should be used first.
There are two main questions which the app answers:
1. What is the combination of subsets that fill the resource as completely as possible?
2. What is the combination, which uses the most objects with the highest priority?

Solution:
Solve the linear equation with n variables in restricted, positive integer space. Take into account the priority of use.

Examples of use: (Each example can involve the priority of use.)
1. The icon of this app illustrates this problem with resource weight as a size.
2. Fill a order as completely as possible with the same parts. Parts are packed in different
packing units. (This is the use case the app was developed for.)
3. Fill up a container with liquid from other containers.
4. Given a time interval and a set of tasks. Fill the time interval as completely as possible.
5. Demonstration of complexity of the linear optimization problems.
You have found another application for it. Its great. Let me know.

Future works:
- Customization some features.
- The task will be extended for multiple target resources.