GIPALS General Interior-Point Algorithm Linear Solver

GIPALS is linear programming environment that incorporates large-scale linear programs solver and easy, intuitive graphical user interface to direct specify or import and solve any type of constrained optimization problems arising in various industrial, financial and educational areas. Constrained optimization problems are stated as linear programs with unlimited number of decision variables and constraints. The linear program solver is based on Interior-Point method (Mehrotra predictor-corrector algorithm) and optimized for large sparse linear programs by implementing the state-of-art algorithm to order the constraints matrix. Key features of GIPALS are simple and natural way to specify a linear program without any special mathematical knowledge; robust interior-point method for fast and reliable solution; support the industrial standard format of linear programs; report the solutions in widely used formats including spreadsheets and HTML.