Add to ORKGIn this study, calculations necessary to solve the large scale linear programming problems in two operating systems, Linux and Windows 7 (Win), are compared using two different methods. Relying on the interior-point methods, linear-programming interior point solvers (LIPSOL) software was used for the first method and relying on an augmented Lagrangian method-based algorithm, the second method used the generalized derivative. The performed calculations for various problems show the produced random in the Linux operating system (OS) andWin OS indicate the efficiency of the performed calculations in the Linux OS in terms of the accuracy and using of the optimum memory
Call number: LD2668 .R4 CMSC 1987 C57Master of ScienceComputing and Information Science
Multiple correction was introduced by Gondzio (5) to accelerate the convergence of iterates generate...
Experience with solving a 12,753,313 variable linear program is described. This problem is the linea...
this paper, we describe our implementation of a primal-dual infeasible-interior-point algorithm for ...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX173443 / BLDSC - British Library D...
This thesis deals with practical problems when solving tasks of linear programming using mathematica...
The computational aspects of the simplex algorithm are investigated, and high performance computing ...
AbstractWe review the influence of the advent of high-performance computing on the solution of linea...
There has been limited success with parallel implementations of both the simplex method and interior...
In this paper we describe a unified algorithmic framework for the interior point method (IPM) of sol...
Linear programming is heavily used in microeconomics and company management, such as planning, produ...
The current project is a renewal of the PI`s previous projects supported by the Department of Energy...
This study reports on how different microcomputer systems performed in the solution of two linear pr...
Linear Programming (LP) is a powerful decision making tool extensively used in various economic and ...
As high performance Linux clusters enter mainstream supercomputing, it is impor-tant to understand h...
Call number: LD2668 .R4 CMSC 1987 C57Master of ScienceComputing and Information Science
Multiple correction was introduced by Gondzio (5) to accelerate the convergence of iterates generate...
Experience with solving a 12,753,313 variable linear program is described. This problem is the linea...
this paper, we describe our implementation of a primal-dual infeasible-interior-point algorithm for ...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX173443 / BLDSC - British Library D...
This thesis deals with practical problems when solving tasks of linear programming using mathematica...
The computational aspects of the simplex algorithm are investigated, and high performance computing ...
AbstractWe review the influence of the advent of high-performance computing on the solution of linea...
There has been limited success with parallel implementations of both the simplex method and interior...
In this paper we describe a unified algorithmic framework for the interior point method (IPM) of sol...
Linear programming is heavily used in microeconomics and company management, such as planning, produ...
The current project is a renewal of the PI`s previous projects supported by the Department of Energy...
This study reports on how different microcomputer systems performed in the solution of two linear pr...
Linear Programming (LP) is a powerful decision making tool extensively used in various economic and ...
As high performance Linux clusters enter mainstream supercomputing, it is impor-tant to understand h...
Call number: LD2668 .R4 CMSC 1987 C57Master of ScienceComputing and Information Science
Multiple correction was introduced by Gondzio (5) to accelerate the convergence of iterates generate...
Experience with solving a 12,753,313 variable linear program is described. This problem is the linea...