Operations Research

This Operations Research application offers a comprehensive suite of tools for solving various optimization and network-related problems. It supports Linear Programming models with up to 10 decision variables and 10 constraints using the two-phase simplex method. For transportation problems, it employs the stepping stone algorithm and handles models with up to 8 sources and 8 destinations. Assignment problems are solved using the Hungarian algorithm, also accommodating models of size up to 8x8.

In addition, the application addresses classic network problems—such as Maximum Flow, Shortest Path, Longest Path, and Minimum Spanning Tree—for networks containing up to 15 nodes. For project management, it supports PERT models with up to 30 activities and CPM models with a maximum of 15 activities. Furthermore, it allows calculations for the 8 fundamental queuing theory models.

This tool was developed by Maurício Pereira dos Santos, a retired former professor at the State University of Rio de Janeiro (UERJ), Brazil. For further information, you may contact him via email at [email protected].