riccardolocci / ds Goto Github PK

Convert basic ILP algorithm to step-by-step to show history

It is important to define the format of input files and resulting objects to be used by the algorithms

Some examples need dual implementation to be solved

The application must show a box containing a list of actions performed during the execution of the algorithm

To randomly generate a input file, a utility function is needed

Create a latex project report

When rendering the geometrical admissible space, it can be useful to render the formal model of the problem

Define basic algorithm that from input file finds the optimal solution

Choose a ILP algorithm between Branch-and-Bound and Cutting Plane and implement it

When provided by end users, input files need to be validated.

A view that allows for input selection is practical for both end user experience and testing while developing

Add an arrow that shows the direction taken by the gradient of the objective function

Algorithm does not find optimal solutions for example2 and example3

For ILP problems the feasible region is not a plane, but a set of points

The basic algorithm needs to be adapted as it could be used to navigate through all the states

Sample files and objects allow rapid debugging and useful as example for end users. It is important to have at least 4 examples.