This project was undertaken to find an optimal number and type mix of UNIX servers to run a series of applications. Given a set of servers to choose from, a mathematical programming optimization model was developed to determine the lowest server cost while maintaining an expected service level. A full solution was developed however the requirements exceeded the capabilities of the solver that was used. The model was simplified until a solution could be determined. The results obtained were from a reduced data set and were not suitable for the full solution. The full model should be solvable using a more advanced solver
