An Algorithm for Reducing Multi-Constrained Linear and Quadratic Programming Problems to Single-Constrained Problems
Solving multi-constrained programming problems have always been problematic in the field of mathematical
programming. Large constraints always involve a lot of time, caution and space especially when tableaus are involved and
until the advent of computer program or software that can provide solutions to the problems in a little space of time but here
in this study an algorithm has been developed capable of reducing multi-constrained linear and quadratic programming
problems to single constrained programming problems. The work also includes comparison of solutions of the formulated
models with the original problems.
Keywords- New Algorithm, Linear, Quadratic, Programming, Multi-Constrained, Single-Contrained