Advertisement

Methodological Background of the Dynamic Interactive Network Analysis System (DINAS)

  • W. Ogryczak
  • K. Studzinski
  • K. Zorychta
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 337)

Abstract

This paper describes the methodological background of research performed at Warsaw University under the contracted study: “Theory, Software and Testing Examples for Decision Support Systems” supervised by the International Institute for Applied Systems Analysis (Ogryczak et al., 1987). The main goal of this work is development and implementation of the Dynamic Interactive Network Analysis System (DINAS) which enables the solution of various multiobjective transshipment problems with facility location using IBM PC/XT 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).

Keywords

Mixed Integer Linear Program Implicit Representation Aspiration Level Cost Coefficient Potential Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Glover, F., Klingman, D. (1981). The simplex SON method for LP/embedded network problems. Mathematical Programming Study, 15, pp. 148–176.CrossRefGoogle Scholar
  2. Glover, F., Klingman, D. (1985). Basis exchange characterization for the simplex SON algorithm for LP/embedded networks. Mathematical Programming Study, 24, pp. 141–157.CrossRefGoogle Scholar
  3. Grauer, M., Lewandowski, A., Wierzbicki, A. (1984). DIDASS — theory, implementation and experiences. In: Grauer, M., Wierzbicki, A. P.(eds), Interactive Decision Analysis. Springer, Berlin.Google Scholar
  4. Ogryczak, W., Studzinski, K., Zorychta, K. (1987). A solver for the transshipment problem with facility location. In: Lewandowski, A. and Wierzbicki, A. (eds.), Theory, Software and Testing Examples for Decision Support Systems. IIASA, Laxenburg.Google Scholar
  5. Orchard-Hays, W. (1968). Advanced Linear-Programming Techniques. McGraw-Hill, New York.Google Scholar
  6. Schrage, L. (1975). Implicit representation of variable upper bounds in linear programming. Mathematical Programming Study, 4, pp. 118–132.CrossRefGoogle Scholar
  7. Todd, M. J. (1982). An implementation of the simplex method for linear programming problems with variable upper bounds. Mathematical Programming, 23, pp. 34–49.CrossRefGoogle Scholar
  8. Wierzbicki, A. P. (1982). A mathematical basis for satisficing decision making. Mathematical Modelling, 3, pp. 391–405.CrossRefGoogle Scholar
  9. Wierzbicki, A. P. (1986). On the completeness and constructiveness of parametric characterizations to vector optimization problems. OR Spektrum, 8, pp. 73–87.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • W. Ogryczak
    • 1
  • K. Studzinski
    • 1
  • K. Zorychta
    • 1
  1. 1.Institute of InformaticsWarsaw UniversityWarsawPoland

Personalised recommendations