| 来源类型 | Monograph (IIASA Working Paper)
|
| 规范类型 | 论文
|
| Modular Optimizer for Mixed Integer Programming MOMIP Version 1.1. |
| Ogryczak W; Zorychta K
|
| 发表日期 | 1993
|
| 出版者 | IIASA, Laxenburg, Austria: WP-93-055
|
| 出版年 | 1993
|
| 语种 | 英语
|
| 摘要 | This Working Paper documents the Modular Optimizer for Mixed Integer Programming (MOMIP). MOMIP is an optimization solver for middle-size mixed integer programming problems, based on a modified branch-and-bound algorithm. It is designed as part of a wider linear programming modular library being developed within the IIASA CSA project on "Methodology and Techniques of Decision Analysis". The library is a collection of independent modules, implemented as C++ classes, providing all the necessary functions of data input, data transfer, problem solution, and results output. The Input/Output module provides data structure to store a problem and its solution in a standardized form as well as standard input and output functions. All the solver modules take the problem data from the Input/Output module and return the solutions to this module. Thus, for straightforward use, one can configure a simple optimization system using only the Input/Output module and an appropriate solver module. More complex analysis may require use of more than one solver module. Moreover, for complex analysis of real-life problems, it may be more convenient to incorporate the library modules into an application program. This will allow the user to proceed with direct feeding of the problem data generated in the program and direct withdrawal results for further analysis. |
| 主题 | Methodology of Decision Analysis (MDA)
|
| URL | http://pure.iiasa.ac.at/id/eprint/3759/
|
| 来源智库 | International Institute for Applied Systems Analysis (Austria)
|
| 资源类型 | 智库出版物
|
| 条目标识符 | http://119.78.100.153/handle/2XGU8XDN/124121
|
推荐引用方式
GB/T 7714 |
Ogryczak W,Zorychta K. Modular Optimizer for Mixed Integer Programming MOMIP Version 1.1.. 1993.
|
|
文件名：
|
WP-93-055.pdf
|
|
格式：
|
Adobe PDF
|
此文件暂不支持浏览
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
