Simplex Method for Goal Programming Problems
Keywords:decision variables, deviational variables, key decision, initial basic feasible solution, key column, key row, labour constraint, material constraints, goals
In this paper, the definition of simplex technique in goal programming issues and idea of simplex technique and a few of its properties and applications area unit mentioned here, definition and algorithms of simplex technique for goal programming issues also are outlined and verified by appropriate examples and issues. Its associate approach used for finding a multi objective improvement downside. The process results for comparatively little issues show that the simplex technique produces an equivalent variety of iterations as different ways. Simplex technique may be accustomed solve issues with quite 2 real variables.
How to Cite
Copyright (c) 2022 M. Aishwarya Murugesan, P. Keerthana Pannerselvam, K. Indhumathi Kennedy, R. Bharathi
This work is licensed under a Creative Commons Attribution 4.0 International License.