Modular Optimizer for Mixed Integer Programming MOMIP Version 1.1

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. 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 all the information necessary to make MOMIP operational. It is additionally illustrated with a tutorial example and a sample program. Modeling recommendations are also provided, explaining how to built mixed integer models in order to speedup the solution process. These may be interesting, not only for the MOMIP users, but also for users of any mixed integer programming software

DINAS - Dynamic Interactive Network Analysis System, v.3.0

This paper describes the methodological background and user manual of the Dynamic Interactive Network Analysis System (DINAS) which enables the solution of various multiobjective transshipment problems with facility location using IBM-PC XT/AT microcomputers. DINAS utilizes an extension of the classical reference point approach to handling multiple objectives. In this approach the decision-maker forms his requirements in terms of aspiration and reservation levels, i.e., he specifies acceptable and required values for given objectives. A special TRANSLOC solver was developed to provide DINAS with solutions to single-objective problems. It is based on the branch and bound scheme with a pioneering implementation of the simplex special ordered network (SON) algorithm with implicit representation of the simple and variable upper bounds (VUB & SUB). DINAS is prepared as a menu-driven and easy in usage system armed with a special network editor which reduces to minimum effort associated with input a real-life problem. Version 3.0 is highly compatible with the previous one. Differences between these versions are small, resulting from the introduction of some new features into the system

Dynamic Interactive Network Analysis System - DINAS Version 2.1 (1988). User's Manual

This paper is one of the series of 11 Working Papers presenting the software for interactive decision support and software tools for developing decision support systems. These products constitute the outcome of the contracted study agreement between the System and Decision Sciences Program at IIASA and several Polish scientific institutions. The theoretical part of these results is presented in the IIASA Working Paper WP-88-071 entitled "Theory, Software and Testing Examples in Decision Support Systems". This volume contains the theoretical and methodological backgrounds of the software systems developed within the project. This paper describes the methodological background and user manual of the Dynamic Interactive Network Analysis System (DINAS) which enables the solution of various multiobjective transshipment problems with facility location. DINAS utilizes an extension of the classical reference point approach to handling multiple objectives. A special TRANSLOC solver was developed to provide DINAS with solutions to single-objective problems. It is based on the branch and bound scheme with a new implementation of the simplex special ordered network (SON) algorithm with implicit representation of the simple and variable upper bounds (VUB & SUB). DINAS has been designed as a menu-driven and user-friendly system armed with a special network editor which reduces to minimum effort associated with defining real-life problems

Dynamic optimization on a set of permutations

Artykuł nie zawiera streszczeniaThe classical problem of optimization on the permutation set is considered. The specific approach of the author is based on representing permutations as integer nonnegative solutions of the equation 2x0.+ 2x1 +...+2xn=2n-1 the objective function is assumed to be in the form f(x)= ∑i=0n-1fi(xi,xi+1), which allows the use of dynamic programming. MR0525712 &nbsp

Record-Breaking Ramming with DN 1400 Stoneware Pipes, Awarded the Expert 2014 Statuette

Chcąc spełnić wymagania polskiego i europejskiego prawa, nakładającego na gminy obowiązek wyposażenia wszystkich aglomeracji do 2015 r. w systemy kanalizacji zbiorczej i oczyszczalnie ścieków, Gmina Mikołów przystąpiła do realizacji zadania Zapewnienie prawidłowej gospodarki wodno-ściekowej miasta Mikołów.In order to meet the requirements of Polish and European law, obligating the municipalities to equip all cities with collective sewer systems and waste water treatment plants by 201 5, the municipality of Mikołow proceeded to the accomplishment of the task to ensure proper water and wastewater management in Mikołów city