Simplex Method for Goal Programming Problems

Authors

  • M. Aishwarya Murugesan Department of Mathematics, Sengamala Thayaar Education Trust Women's College, Mannargudi, India
  • P. Keerthana Pannerselvam Department of Mathematics, Sengamala Thayaar Education Trust Women's College, Mannargudi, India
  • K. Indhumathi Kennedy Department of Mathematics, Sengamala Thayaar Education Trust Women's College, Mannargudi, India
  • R. Bharathi Department of Mathematics, Sengamala Thayaar Education Trust Women's College, Mannargudi, India

Keywords:

decision variables, deviational variables, key decision, initial basic feasible solution, key column, key row, labour constraint, material constraints, goals

Abstract

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.

Downloads

Download data is not yet available.

Downloads

Published

02-06-2022

Issue

Vol. 5 No. 5 (2022)

Section

Articles

License

Copyright (c) 2022 M. Aishwarya Murugesan, P. Keerthana Pannerselvam, K. Indhumathi Kennedy, R. Bharathi

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
M. A. Murugesan, P. K. Pannerselvam, K. I. Kennedy, and R. Bharathi, “Simplex Method for Goal Programming Problems”, IJRESM, vol. 5, no. 5, pp. 252–254, Jun. 2022, Accessed: Nov. 21, 2024. [Online]. Available: https://journal.ijresm.com/index.php/ijresm/article/view/2118