A linear programming software for addressing constrained optimization issues in educational, financial, and industrial settings. It allows for infinite variables and restrictions in the form of linear programs.
The linear program solver uses Interior-Point method (Mehrotra predictor-corrector algorithm), making it an industry-standard for optimized solutions of large, sparse linear programs. GIPALS includes state-of-art algorithmic tools, as well as a constraints matrix, to help you order and solve your programs quickly and efficiently.
You can specify your linear program constraints in a dense or sparse form, based on the size of the optimization problem. The dense form works well for small and medium-linear programs with non-zeros that prevail over zeros. You can easily copy and paste constraints from MS Excel spreadsheets using the Windows clipboard. The sparse form, on the other hand, is ideal for larger problems with tens and even hundreds of thousands of variables and constraints.
GIPALS is designed to import linear programs from Mathematical Programming System (MPS) data format but also allows for the extraction of solutions in various formats such as CSV, Tab-delimited or HTML file formats. GIPALS provides the user with a report that is easy to read and can be shared with anyone who needs the results.
Key features of GIPALS include a user-friendly interface suitable for anyone without specialized mathematical knowledge, fast and reliable solutions backed by the Interior-Point Method, support for industry-standard linear programs, and reporting solutions in commonly used formats.
Overall, GIPALS is a must-have software program for anyone in need of efficient and effective optimization solutions. The tools provided by this software are robust and user-friendly, making it the perfect choice for anyone looking to create linear programs.
Version 3.0: N/A
Version 1.2.5: N/A
Version 1.2.3: N/A
Version 1.2.1: N/A