Program for step-by-step resolution of tasks by the simplex method

The program to solve the tasks of linear programming with the simple method of formulating a detailed HTML-view with the stages of solving. It is realised by the algorithms of the classic simplex method of Danzig, the double simplex method, the M-Task, the Homory method, the wing method and the boundaries. The task condition is introduced in text form, the necessary data structures are formed with the help of a developed text analyzer.
#delphi #Lazarus #Freepascal #pascal #matematics #optimization