Comparing study between simplex method and Lagrange method in a linear programming problem

被引：0

作者：

Alsaraireh, Ahmed Atallah ^{[1
]}

Almasarweh, Mohammad Salameh ^{[2
]}

Al Wadi, S. ^{[3
]}

Alnawaiseh, Mahmoud Barakat ^{[2
]}

机构：

[1] Univ Jordan, Dept Comp Informat Syst, Aqaba, Jordan

[2] Univ Jordan, Dept Business Adm, Aqaba, Jordan

[3] Univ Jordan, Dept Risk Management & Insurance, Aqaba, Jordan

来源：

ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2019年 / 42期

关键词：

operation research; Lagrange multiplier; simplex method;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

This study aims to discuss a different way to solve a linear programming problems. Two methods are discussed in this paper to determine a suitable method to solve these problems, and to determine which one is the easiest. We used : Simplex method and Lagrange method. Two methods were applied in general system to evaluate the result and compare between them. After that the researchers applying the numerical example to find the degree of readers satisfaction for these methods. The results of this study indicated that a two methods were a better, but the second method is easier than the first method.

引用

页码：934 / 943

页数：10

共 49 条

[21] QoS routing in communication networks: Approximation algorithms based on the primal simplex method of linear programming
Xiao, Ying
Thulasiraman, Krishnaiyan
Xue, Guoliang
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2006, 55 (07) : 815 - 829
[22] A SIMPLEX METHOD FOR COUNTABLY INFINITE LINEAR PROGRAMS
Ghate, Archis
Ryan, Christopher T.
Smith, Robert L.
[J]. SIAM JOURNAL ON OPTIMIZATION, 2021, 31 (04) : 3157 - 3183
[23] Complexity of the Gravitational Method for Linear Programming
T. L. Morin
N. Prabhu
Z. Zhang
[J]. Journal of Optimization Theory and Applications, 2001, 108 : 633 - 658
[24] Complexity of the gravitational method for linear programming
Morin, TL
Prabhu, N
Zhang, Z
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2001, 108 (03) : 633 - 658
[25] Self-Regulating Artificial-Free Linear Programming Solver Using a Jump and Simplex Method
Visuthirattanamanee, Rujira
Sinapiromsaran, Krung
Boonperm, Aua-aree
[J]. MATHEMATICS, 2020, 8 (03)
[26] THE SIMPLEX-METHOD AS A GLOBAL OPTIMIZER - A C-PROGRAMMING PERSPECTIVE
SNIEDOVICH, M
MACALALAG, E
FINDLAY, S
[J]. JOURNAL OF GLOBAL OPTIMIZATION, 1994, 4 (01) : 89 - 109
[27] On the development of simplex methods for linear multiplier-alike method
Wang, Xiaojun
Chang, Tsu-Shuan
Ouyang, Chung-Hsing
[J]. APPLIED AND COMPUTATIONAL MATHEMATICS, 2007, 6 (01) : 39 - 50
[28] Scaling linear optimization problems prior to application of the simplex method
Joseph M. Elble
Nikolaos V. Sahinidis
[J]. Computational Optimization and Applications, 2012, 52 : 345 - 371
[29] Scaling linear optimization problems prior to application of the simplex method
Elble, Joseph M.
Sahinidis, Nikolaos V.
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2012, 52 (02) : 345 - 371
[30] Solving Multiscale Linear Programs Using the Simplex Method in Quadruple Precision
Ma, Ding
Saunders, Michael A.
[J]. NUMERICAL ANALYSIS AND OPTIMIZATION, NAO-III, 2015, 134 : 223 - 235

← 1 2 3 4 5 →