.png){kind=icon}
Return
Computational aspects of linear programming Simplex method
.png){kind=icon}
PRE
AI
DOI：10.1016/S0965-9978(00)00022-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the Simplex method is re-examined from the computational view points. Efficient numerical implementation for the Simplex procedure is suggested. Special features of artificial variables, and variables with unrestriction in signs are exploited to reduce the computational efforts, and computer memory requirement. The developed Simplex code has been tested on several examples, and its performance has been compared with existing Simplex codes. (C) 2000 Elsevier Science Ltd. All rights reserved.
Keywords:
simplex method
basic variables
non-basic variables
linear programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
3.3K
Citations:
1.2W
Organization
No organization information available
Cited Papers
No cited papers available