Solving Goal Programming by Alternative Simplex Method

Authors

DOI:

https://doi.org/10.26713/cma.v14i5.2289

Keywords:

Goal programming problem, Optimal solution, Alternative simplex method

Abstract

It is found that the simplex algorithm is immensely used and proficient algorithm ever invented and shown extremely accurate in the formulation of optimization problems. In this paper, an alternative simplex method with some modifications has been used to solve Goal programming problem. This method is a new approach which solve goal programming problem easily and gives improved solution in comparatively less iterations.

Downloads

Download data is not yet available.

Author Biography

Girish M. Dhote, Department of Mechanical Engineering, Yeshwantrao Chavan College of Engineering, Nagpur 441110, Maharastra, India

-

References

A.H. Ansari, Easy simplex (AHA simplex) algorithm, Journal of Applied Mathematics and Physics 7(1) (2019), 23 – 30, DOI: 10.4236/jamp.2019.71003.

R. Birla, V.K. Agarwal, I.A. Khan and V.N. Mishra, An alternative approach for solving bilevel programming problems, American Journal of Operations Research 7(3) (2017), 239 – 247, DOI: 10.4236/ajor.2017.73016.

A. Charnes and W.W. Cooper, Goal programming and multiple objective optimizations: Part 1, European Journal of Operational Research 1(1) (1977), 39 – 54, DOI: 10.1016/S0377-2217(77)81007-2.

K.P. Ghadle and T.S. Pawar, Game theory problems by an alternative simplex method, International Journal of Research in Engineering and Technology 3(5) (2014), 900 – 905, DOI: 10.15623/IJRET.2014.0305163.

M. Goli and S.H. Nasseri, Extension of duality results and a dual simplex method for linear programming problems with intuitionistic fuzzy variables, Fuzzy Information and Engineering 12(3) (2020), 392 – 411, DOI: 10.1080/16168658.2021.1908818.

A.C. Iwuji and C.K. Acha, A mixed-integer lexicographic goal programming model for achieving estimated targets in multi-product systems, Data Research 2(1) (2018), 33 – 42, DOI: 10.31058/j.data.2018.21003.

H. Vieira, Jr. and M.P.E. Lins, An improved initial basis for the Simplex algorithm, Journal of Computers & Operations Research 32(8) (2005), 1983 – 1993, DOI: 10.1016/j.cor.2004.01.002.

N.W. Khobragade, N.V. Vaidya and N.K. Lamba, Approximation algorithm for optimal solution to the linear programming problem, International Journal of Mathematics in Operational Research 6(2) (2014), 139 – 154, DOI: 10.1504/IJMOR.2014.059528.

Q.-M. Liu and F.-G. Shi, Stratified simplex method for solving fuzzy multi-objective linear programming problem, Journal of Intelligent & Fuzzy Systems 29(6) (2015), 2357 – 2364, DOI: 10.3233/IFS-151934.

K.G. Lokhande, P.N. Khobragade and N.W. Khobragade, Alternative approach to simplex method for the solution of linear programming problem, International Journal of Engineering and Innovative Technology 4(6) (2014), 123 – 128.

H. Nabli, An overview on simplex algorithm, Applied Mathematics and Computation 210(2) (2009), 479 – 489, DOI: 10.1016/j.amc.2009.01.013.

S. Narayanamoorthy and S. Kalyani, The intelligence of dual simplex method to solve linear fractional fuzzy transportation problem, Computational Intelligence and Neuroscience 2015 (2015), Article ID 103618, 7 pages, DOI: 10.1155/2015/103618.

K. Wise and D.E. Perushek, Goal programming as a solution technique for the acquisition problem, Library & Information Science Research 22(2) (2000), 165 – 183, DOI: 10.1016/S0740-8188(99)00052-3.

Downloads

Published

16-04-2024
CITATION

How to Cite

Dhote, M. G., Dhote, G. M., & Meshram, A. (2024). Solving Goal Programming by Alternative Simplex Method. Communications in Mathematics and Applications, 14(5), 1507–1514. https://doi.org/10.26713/cma.v14i5.2289

Issue

Vol. 14 No. 5 (2023)

Section

Research Article

License

Creative Commons Licence 4.0 by  

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.