Optimalon Software Products

GIPALS32 - Linear Programming Library

GIPALS32 is a linear programming library that incorporates the power of linear programming solver and simplicity of integration to any software tools like Ms Visual C++, Ms Visual C# .Net, Ms Visual Basic, Borland Delphi and other that support a DLL import. The maximum number of constraints and variables is unlimited. 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. The user can specify the linear program using a set of exported DLL functions. Also GIPALS32 provides an import of linear programs from Mathematical Programming System (MPS) data format that is an industry standard for the description of a variety of linear programs. Key features of GIPALS32: UNLIMITED linear program size; No external components or DLL are required; Simple 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.

Keywords: linear programming library linear programming library linear program constrained optimization optimization matrix primal dual interior point constraint mps gipals32 lp actors and actresses gedcom file

GNCutter - Nesting and Guillotine Cutter

Defines how to cut rectangular pieces from glass, ceramic, metal, drywall or wood stocks with minimal waste of material. The most of cutting tasks have to be done on construction sites where you should figure out how to cut pieces in fast-paced environment. GNCutter takes complete care about cutting tasks and makes you life much easier. It generates and displays complex layouts and cutting instructions right at your jobsite in less than a second! There are two cutting methods available: Nesting and Guillotine. Guillotine method implies all cuts are made from one side of sheet completely to another side, as in case of glass or ceramic cutting. Nesting method does not impose any restrictions of how cuts are made and usually produces better results than guillotine. There are two types of stock: rectangular sheets or coils (rolls) with infinite length. GNCutter detects how many sheets or how much coil length you need to order from your supplier to cut all required pieces from. GNCutter provides you with the following Benefits: - Optimality. You can maximize stock utilization and minimize material waste during cutting, nesting, sawing or punching operations. - Mobility. GNCutter is designed to operate on your Pocket PC that means you can bring it to any place you need the nesting/stock cutting optimization done. - Speed. The calculation engine uses the robust algorithm that is capable to generate a complex layout in less than one second. - Simplicity. GNCutter has a simple and intuitive graphical user interface that does not confuse even first-time users. The main features of GNCutter: - Nesting and Guillotine stock cutting calculation methods. - Integrated graphical viewer for visual inspection of the layouts. - Unlimited number of parts for optimization. - Import parts from Excel spreadsheets. - Export layouts to AutoCAD DXF and Excel spreadsheets. - Export cutting instruction to Excel spreadsheets.

Keywords: nesting nesting software guillotine guillotine cutting cutting stock cutting stock cutting optimization gncutter optimization pda pocket pc stock sheets punching bin packing strip packing defines how cut

GIPALS - Linear Programming Environment

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 that size can reach up to 500 thousand 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. The user can specify the linear program constraints in a dense form using the grids or in a sparse form using the particular constraints editor. The dense form is suitable for small and medium linear programs with non-zeros prevail over zeros. In this form the constraints can be directly copied/pasted from/to MS Excel spreadsheets by Windows clipboard. The sparse form is designed to specify / view / edit large linear programs with tens and hundreds of thousand variables and constraints. GIPALS can import linear programs from Mathematical Programming System (MPS) data format that is an industry standard for the description of a variety of linear programs. Any linear program specified in GIPALS' user interface could be exported to MPS format. The solution of the linear programs can be saved as CSV (comma-delimited spreadsheet), Tab-delimited or HTML file. Key features of GIPALS: 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.

Keywords: linear programming linear program constrained optimization optimization large-scale matrix sparse matrix primal dual interior point predictor-corrector constraint mps gipals lp linear programming environment constrained optimization telephony features inventory management system