Modular Optimizer for Mixed Integer Programming MOMIP Version 2.1

Ogryczak, W. & Zorychta, K. (1994). Modular Optimizer for Mixed Integer Programming MOMIP Version 2.1. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-94-035

Preview

Text WP-94-035.pdf Download (1MB) | Preview

Abstract

This Working Paper documents the Modular Optimizer for Mixed Integer Programming MOMIP version 2.1. MOMIP is an optimization solver for middle-size mixed integer programming problems, based on the 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 paper provides the complete description of the MOMIP module. Methodological background allows the user to understand the implemented algorithm and efficient use of its control parameters for various analyses. The module description provides the information necessary to make MOMIP operational within a user application program.

MOMIP is also available as a standalone executable program with built in all the necessary auxiliary modules. User's manual for the MOMIP program is included in this paper. It is additionally illustrated with a tutorial example.

Actions (login required)

View Item