Other algorithms may partially solve OR models (for optimisation models, these algorithms are known as heuristics and terminate with a "good" solution that is not necessarily optimal). Often, in practice, OR models may not be solved completely due to time constraints.
For example, solving a linear programme may be done using the Revised Simplex Method or an interior point method. Additionally, there may be more than one solution method for a particular OR model. Just as the formulation step depended on the OR model being used, this solution step depends on your OR model.
#Operational research examples software
The Computational Model section shows how some OR software was used to solve the problem, the Results section contains the solution and the analysis and the Conclusion section presents the solution and analysis. The Problem Description and Problem Formulation sections correspond to steps 1.
#Operational research examples update
If your solution is invalid you may need to alter or update your formulation to incorporate your new understanding of the actual problem.Īll the case studies on this TWiki (should!) follow the OR methodology. For example, after modelling and solving an OR problem, you will often want to consider the validity of your solution (often consulting with the person who provided the problem description). However, there are often "feedback loops" within this process.
Solving an Operations Research (OR) problem is not a linear process, but the process can be broken down into five general steps: