Abstract
We propose two recently developed iterative algorithms for solving large scale linear programming problems: the first one is based on the gravitation centers method, which in its turn widely uses Monte Carlo statistical test method, and the second one is realized on the basis of the constant step gradient method. Though the developed iterative algorithms are approximate, it is rather worthwhile in most cases to apply them when solving large scale linear problems, as they are characterized by positive properties, such as simplicity of the algoritm and the program, high-speed performance, and besides the appropriate software is free of such an unpleasant, specific for the simplex method event as a loop. We present some computational results. We assess the both developed algorithms with respect to a high-speed performance criterion and compare their high-speed performance with the one of the simplex method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
