Literaturveneichnis - Springer978-3-642-51734...Literaturveneichnis Literatur Kapitell: [Bode94]...

Literaturveneichnis

Literatur Kapitell:

[Bode94] Boden, H.: Einsatz der Parallelverarbeitung zur Lösung von Problemen der Nichtlinearen Optimierung. Dissertation, Universität-GH Siegen, Juni 1994.

[Bode95] Boden, H.; Grauer, M. OpTiX-II: A software environment for the parallel solution of nonlinear optimization problems. In: Annals of Operations Research, 58: S. 129-140, 1995.

[Booc91] Booch, G. (Ed.). Object-Oriented Design With Applications. Benjamin Cummings, Menlo Park, CA, 1991.

[BGL94] Burnett, M. M.; Goldberg, A.; Lewis, T. G. (Eds.): VisualObject-Oriented Programming. Prentice Hall and Manning, Greenwich, CT, 1994.

[Cap93] Cap, C. H.: Architekturelle Entscheidungen zur Unterstützung parallelen Rechnens in Workstation Clustern und deren Realisierung in existenten Produkten. In: Proceedings of the Second Workshop on Workstations, Hagen, 1993. VDE-Verlag.

[Cram94] Cramer, E. J; Dennis, J. E.; Frank, P. D.; Lewis, R. M.; Shubin, G. R.: Problem formulation for multidisciplinary optimization. In: SIAM Journal on Optimization, 4(4):754-776, 1994.

[Esch93] Eschenauer, H. A; Geilen, J.; Wahl, H. 1.: SAPOP - An Optimization Procedure for MuIticriteria Structural Design. In: Hörnlein, H. R. E. M.; Schittkowski, K. (Eds.): Software Systems for Structural Optimization, S. 207-227. Birkhäuser Verlag, 1993.

[Göpf86] Göpfert, A; Bittner, L.; Elster, K.-H.; Nozicka, E; PiehIer, J.; Tichatschke, R: Lexikon der Optimierung. Akademie-Verlag, Berlin, 1986.

[Grau89] Grauer, M.: About the development of integrated software-systems for mathematical prograrnming. In: Streitfeldt, L.; Hauptmann, H.; Marusev, A W.; Ohse, D.; Pape, U. (Eds.): Operations Research Proceedings 1989, S. 489 - 496, Springer Verlag, Berlin, 1989.

[Hörn93] Hörnlein, H. R. E. M.; Schittkowski, K. (Eds.): Software Systems for Structural Optimization, Ausg. 110 von Internation

160 Literaturverzeichnis

[Krus88] Kruskal, C. P.; Smith, C. H.: On the notation of granularity. The Journal ojSupercomputing, 1, 1988.

[McIn92] McIntyre, D.W.: A Visual Method for Generating Iconic Programming Environments. Dissertation, Rensselaer Polytechnie Institute, Troy, N.Y., 1992.

[Mill84] Mills, G.: Optimisation in Economic Analysis. George Allen & Unwin, London, 1984.

[MPI94] MPI: A message-passing interface standard. Technischer Bericht CS-94-230, Computer Science Department, University of Tennessee, Knoxville, TN, Mai 1994.

[Mül70] Müller-Mehrbach, H.: Optimale Reihenfolgen. Springer Verlag, Berlin 1970.

[Rumb91] Rumbaugh, J.; Blaha, M.; Premerlani, W.; Eddy, E; Lorensen, W.: Object-Oriented Modeling and Design. Prentice Hall, New Jersey, 1991.

[SOF92] Situation und Perspektiven des Einsatzes der parallelen Datenverarbeitung. Landesinitiative SOFTECH NRW; Ministerium flir Wirtschaft, Mittelstand Technologie des Landes Nordrhein-Westfalen, D-4000 Düsseldorf, Haroldstr. 4, September

Literatur Kapitel 2:

[ACM81] Special issue: The psychology ofhuman-computer interaction, 1981.

[AppI87] Apple. Human Interface Guidelines, The Apple Desktop Interface. Apple Comput. Inc., Cupertino, CA, USA, 1987.

[Bail89] Bailin, S. c.: An Object-Oriented Requirements Specification Method. In: Communications ojthe ACM, 32(5):608-623, Mai 1989.

[Ba1z82] Balzert, H.: Die Entwicklung von Software-Systemen (Prinzipien, Methoden, Sprachen, Werkzeuge). BI Wissenschaftsverlag, Mannheim, Wien, Zürich, 1982.

[Bart86] Barth, P. S.: An object-oriented approach to graphical interfaces. In: ACM Transactions on Graphics, 5(2):142-172, April 1986.

[Bati85] Batini, C.; Furlani, L.; Nardelli, E.: What is a good diagram? A pragmatic approach. CH IEEE, S. 312-319, 1985.

[Bera93] Berard, E. V.: Essays On Object-Oriented Software Engineering, Ausg. 1. Prentice Hall, 1993.

Literaturverzeichnis 161

[Birt73] BirtwistIe, G.; Dahl, 0.-1.; Myrhaug, B.; Nygard, K.: Simula Begin. Studentenliteratur, Schweden, 1973.

[Booc91] Booch, G. (Ed.).: Object-Oriented Design With Applications. Benjamin Cummings, Menlo Park, CA, 1991.

[Booc94] Booch, G., (Ed.). Object-Oriented Analysis And Design With Applications. Benjamin Cummings, Menlo Park, CA, 2. Ausg., 1994.

[Bro075] Brooks, F. P. Ir.: The Mythical Man-Month (Essays on Software Engineering). Addison-WesIey, Reading, MA, 1975.

[Brüg94] Brüggemann F. 1.: About visual programming and distributed problem solving. In: Eschenauer, H. A.; Grauer, M.; Reinhardt, H.-I. (Eds.): FOMAAS 1992 - 1994: Fortschrittsbericht Status Report, Bericht Nr. TIMOI-03.04, S. 106 -125. FOMAAS, Universität - GH Siegen, 1994.

[Card85] Cardelli, L.; Wegner, P.: Understanding Types, Data Abstraction, and Polymorphism. In: ACM Computing Surveys, 17(4):471-523, Dezember 1985.

[Chan89] Chang, S.-K.; Tauber, M. 1.; Yu, B.; Yu, I.-S.: A visuallanguage compiler. In: IEEE Transaction on Software Engineering, 15(5):506-525, Mai 1989.

[Chan90] Chang, S.-K.; (Eds.): Principles ofVisual Programming Systems. Prentice Hall, New York, 1990.

[Cher90] Cherry, G.: Software-Construction by Object-Oriented Pictures. Dorset House, New York, 1990.

[Coad91a] Coad, P.; Yourdon, E.: Object-Oriented Analysis. Computing Series. Yourdon Press, Englewood Cliffs, NI, 2. Ausg., 1991.

[Coad91b] Coad, P.; Yourdon, E.: Object-Oriented Design. Computing Series. Yourdon Press, Engiewood Cliffs, NI, 1991.

[CoIb89] Colbert, E.: The object-oriented software development method: A practical approach to object-oriented development. In: Tri-Ada Proc., New York,1989.

[CoIe94] Coleman, D.; et al. Object-Oriented Development - The Fusion Method. Prentice Hall Object-Oriented Series, Engiewood Cliffs, NI, 1994.

[Cong94] Conger, S. A. (Eds.): The New Software Engineering. Wadsworth Publishing Company, Beimont, California, 1994.

[Cost90] CostagIioIa, G.; Chang, S.-K.: DR parsers: A generalization of LR parsers. In: Proceedings of the 1990 IEEE Workshop on Visual Languages, S. 174-180. IEEE Computer Soc., 1990.


[Cox91] Cox, B. J.: Object Oriented Programming - An Evolutionary Approach. Addison-Wesley, Reading, Mass., 1991.

[deCh92] de Champeaux, D.; Faure, P.: A comparative study of object-oriented analysis methods. In: Journal of Object-Oriented Programming, S. 21-33, März 1992.

[deCh93] de Champeaux, D.; Lea, D.; Faure, P: Object-Oriented System Development. Addison-Wesley, Reading, Mass., 1993.

[DeMa79] DeMarco, T.: Structured Analysis and System Specijication. Prentice Hall, 1979. Auch in: Yourdon, Inc., New York, 1978.

[Doda89] Dodani, M. H.; Hughes, C. H.; Moshell J .. M: Separation of powers. In: Byte, S. 255-262, März 1989.

[Dong93] Dongarra, J.; Pozo, P.; Walker D. W.: Lapack++: A design overview of object-oriented extensions for high performance linear algebra. Technischer Bericht, Oak Ridge National Laboratory und Univ. of Tennessee, 1993.

[Drak93] Drakos, N.: Constructing object-oriented software in interactive graphical programming environments: An anthology. Technischer Bericht http:// cbl.leeds.ac.uk/nikos/tex2html/examples/concepts/concepts.html, Computer Based Leaming Unit, Univ. of Leeds, UK, März 1993.

[Edge92] Edge, R.M: Programming in an Object-Oriented Environment. Academic Press, 1992.

[Elli9O] Ellis, M. A.; Stroustrup, B.: Annotated C++ Reference Manual. AddisonWesley,199O.

[EmbI92] Embley, D.W.; Kurtz, D.; Woodfield, N. w.: Object-Oriented System Analysis - A Model Driven Approach. Computing Series. Yourdon Press/ Prentice Hall, Englewood Cliffs, NJ, 1992.

[Fers90] Ferstel, o. K.; Sinz, E. J.: Objektmodellierung betrieblicher Informationssysteme im Semantischen Objektmodell (SOM). In: Wirtschaftsinformatik, 32(6):566-581, Juni 1990.

[Fich92] Fichman, C. H.; Kemerer, R, G.: Object-Oriented and Conventional Analysis and Design Methodologies - Comparison and Critique. In: IEEE Computer, S. 22-39, Oktober 1992.

[Foun93] Open Software Foundation. OSF/Motif Style Guide: Revision 1.2. Prentice Hall, Englewood Cliffs, NJ, 1993.

[FowI93] Fowler, M.: 00 methods: A comparative overview. In: SIGS Publications, S. 2-13, 1993.


[Gamm93] Gamm, C. V.: Design Aspekte beim Programmieren grafischer Benutzeroberflächen. SIGS Publications, S. 2-13, 1993.

[Glin90] Glinert, E. P. (Eds.): Visual Programming Environments: Applications and lssues. IEEE Computer Society Press Tutorial, Los Alamitos, CA, 1990.

[Gold83] Goldberg, A Robson, D.: Smalltalk-80: The Language and its lmplementation. Addison-Wesley, Reading, MA, 1983.

[Grou89] HOOD Working Group. HOOD Reference Manual, September 1989.

[Guth95] Guthrie, W. Portable GUI FAQ, Mai 1995.

[Halb87] Halbert, D. C.; O'Brien, P. D.: Using types and inheritance in object-oriented languages. In: Cointe, P.; Bezivin, J.; Hullot, J.-M.; Lieberman, M.; (Eds.); Proceedings ECOOP '87, LNCS 276, S. 20-31, Paris, Frankreich, Juni 15-17 1987. Springer-Verlag.

[Hare87] Harel, D.: Statecharts: A visual formalism for complex systems. In: Science 01 Computer Programming, 8:231-274,1987.

[Hath94] Hathaway, B.: Comp.object faq, Oktober 1994.

[Hela88] Helander M.: Handbook 01 Human-Computer Interaction. North-Holland, Amsterdam, 1988.

[Henr93] Henry, S.; Humphrey, M.: Object-Oriented vs. Procedural Programming Languages. In: Journal 01 Object-Oriented Programming, S. 41--49, Juni 1993.

[Hoc91] Hoc, J.-M.; Green, T. R. G.; Samurcay, R.; Gilmore, D. J. (Eds.):. Psychology 01 Programming. Academic Press, London, 1991.

[HS92] Henderson-Sellers, B.: A book 01 object-oriented knowledge. Prentice Hall, Englewood Cliffs, NJ, 1992.

[ffiM89] ffiM. Systems application architecture/commmon user access advanced interface design guide, 1989.

[IEE88] 1988 IEEE workshop on visuallanguages. Washington, D.C., 1988.

[Jaco92] Jacobson, 1.; Christerson, M.; Jonsson, P.; Overgaard, G.: Object-Oriented Software Engineering - A Use Case Driven Approach. Addison-Wesley/ACM Press, Reading, Mass., 1992.

[Joyn92] Joyner, 1.: A c++ critique, 1992.

[Juri92] Jurik, J. A; Schemenaur, R. S.: Experiences in Object Oriented Development. In: ACM, 1992.


[Kras88] Krasner, G. E.; POpe, S. T.: A cookbook for using the model-view-controller user interface pradigm in Smalltalk-80. Journal of Object-Oriented Programming, S. 26-45, Aug./Sept. 1988.

[Lee94] Lee, L.: Object-Oriented GUI Application Development. Prentice Hall Publishing, Englewood Cliffs, NJ, 1994.

[Lewi91] Lewis, J. A; Henry, S. M.; Kafura, D. G.; Schulman, R. S.: On the relationship between the object-oriented paradigm and software reuse: An empirical investigation. In: Journal of Object-Oriented Programming, S. 184-196, November 1991. publiziert als: Proceedings OOPSLA '91, ACM SIGPLAN Notices, Ausg. 26, Nr. 11.

[Lint88] Linton, M. A; Vlissides, J. M.; Calder, P. R: Applying object-oriented design to structured graphics. Technischer Bericht CSL-TR-88-364, Stanford University, August 1988.

[Lint89] Linton, M. A; Vlissides, J. M.; Calder, P. R: Composing user interfaces with InterViews. In: IEEE Transactions on Computers, 22(2):8-22,1989.

[Marc90] Marcus, A.: Designing graphical user interfaces. In: Unix World, August 1990.

[Mart92] Martin, J.; Odell, J. J.: Object-Oriented Analysis and Design. Prentice Hall, Englewood Cliffs, NJ, 1992.

[Meye87] Meyer, B.: Reusability: The case for object-oriented design. In: IEEE Transaction on Software Engineering, S. 50-64, März 1987.

[Micr90] Sun Microsystems. OPEN WOK graphical user interface application style guidelines / Sun Microsystems, Ine .. Addison-Wesley, Reading, MA, 1990.

[Micr92] Microsoft Corp. The Windows Interface. An Application Design Guide. Microsoft Press, Remond, CA, 1992.

[Mill56] Miller, G. A: The magical number seven, plus or minus two: Some limits on oUf capacity for processing information. In: Psychologieal Review, 63(2):81-97, März 1956.

[Mull95] Mullet, K.; Sano, D.: Designing Visual Interfaces: Communication Oriented Techniques. SunSoft Press, Sun Microsystems, Inc. Mountain View CA,I995.

[Myer86] Myers, B.A.: Visual programming, programming by example and program visualization: A taxonomy. In: Proeeedings of ACM CHI'86 Conference on Human Factors in Computing Systems, S. 59-66,1986.

[Ners92] Nerson, J.-M.: Applying Object-Oriented Analysis and Design. In: Communieations ofthe ACM, 35(9):63-74, September 1992.

Literaturveneichnis 165

[NeXT92] NeXT Computer, Inc. NeXTSTEP User Interface Guidelines. AddisonWesley, Redwood City, CA, 1992.

[Reen92] Reenskaug, T.; Andersen, E. P.; Berre, A J.; Hurlen, A; Landmark, A; Lehne, O. A; Nordhagen, E.; Ness-Ulseth, E.; Oftedal, G.; Skaar, A L.; Stenslet, P.: OORASS: Searnless support for the creation and maintenance of object-oriented systems. In: Journal of Object-Oriented Programming, 5, Okt. 1982.

[Rubi92] Rubin, K. S.; Goldberg, A.: Object-Behavior Analysis. In: Communications ofthe ACM, 35(9):48-62, Sept. 1992.

[Rumb91] Rumbaugh, J.; Blaha, M.; Premerlani, W; Eddy, F.; Lorensen, W: Object-Oriented Modeling and Design. Prentice Hall, New Jersey, 1991.

[Saun89] Saers, J. H.: A survey of object-oriented programming languages. In: Journal ofObject-Oriented Programming, S. 5-11, März 1989.

[Schm86] Schmucker, K. J.: MacApp an application framework. In: Byte, S. 189-193, August 1986.

[Seli94] Selic, B.; Gullekson, G.; Ward, P. T.: Real-Time Object-Oriented Modefing. John Wiley & Sons, 1994.

[Selk88] Selker, T.; Koved, L.: Elements of visual language. In: IEEE, S. 38-44, 1988.

[Shla88] Shlaer, S.; Mellor, S. J.: Object-Oriented Systems Analysis - Modelling the World in Data. Computing Series. Yourdon Press, Englewood Cliffs, NJ,1988.

[Sma95] Smart, J.: Reference Manualfor wxWindows /.6.4: a portable C++ GUI toolkit. University of Edinburgh, 1995. hup://www.aiai.ed.ac.uk/-jacs/ wxwin.htm.

[Smit77] Smith, D. C.: Pygmalion: A Computer Program to Model and Stimulate Creative Thought. Birkhäuser Verlag, 1977.

[Smit86] Smith, S. L.; Mosie, J. N.: Guidelines for Designing User Interface Software. Mitre Corp., Bedford, Ma., 1986.

[Star94] Stary, c.: Interaktive Systeme - Software-Entwicklung Software-Ergonomie. Vieweg InformatiklDV-Praxis, Braunschweig, 1994.

[Stei93] Stein, W; Schulman, R. S.: Objektorientierte Analysemethoden - ein Vergleich. In: Informatik-Spektrum, 16:317-332, 1993.

[Stro91] Stroustrup, B.: The C++ Programming Language. Addison-Wesley, 2. Ausg., 1991.


[TeH89] TeHo, E. R: Object-Oriented Programming for Artificial Intelligence: a Guide to Tools and System Design. Addison-Wesley, 1989.

[Tort90] Tortora, G.: Structure and interpretation of visual languages. In: Chang, S.-K. (Eds.), Visual Languages and Visual Programming, S. 3-30. Plenum Press, 1990. Theory ofVisual Languages.

[Vlis90] Vlissides, J. M.: Generalized Graphical Object Editing. Dissertation, Stanford University, April 1990.

[Wass90] Wasserman, AI.; Pircher, P. A; MuHer, R J.: The Object-Oriented Structured Design Notation for Software Design Representation. In: IEEE Computer, 23(3):5~3, März 1990.

[WB90] Wirfs-Brock, R; Wilkerson, B.; Wiener L.: Designing Object-Oriented Software. Prentice Hall, Englewood Cliffs, NJ, 1990.

[Wegn89] Wegner, P.: Leaming the language. In: Byte, S. 245-253, März 1989.

[Weir91] Weir, G. R. S.; Alty, 1. 1.: Human-Computer Interaction and Complex Systems. Academic Press, London, 1991.

[Wu90] Wu, T. C.: Benefits of Object-Oriented Programming in Implementing Visual Database Interface. In: Journal of Object-Oriented Programming, S. 8-16, März 1990.


[ABL95] Arabe, J.; Beguelin, A; Lowekamp, B.; Seligman, E.; Starkey, M.; Stephan, P.: Dome: Parallel Programming in a Heterogeneous Multi-User Environment. Technischer Bericht, Camegie MeHon University, 1995.

[Akl89] Akl, S. G.: The Design and Analysis of Parallel Algorithms. Prentice Hall, 1989.

[Alla95] Allan, R J .. ; Lockey, P.: Survey of Parallel Software Packages of Potential Interest in Scientific Applications. Technischer Bericht, Daresbury Laboratory, Daresbury UK, 1995.

[Andr93] Andrews, G. R.; Olsson, R A: The SR Programming Language: Concurrency in Practice. BenjaminlCummings, 1993.

[Ans89] ANSYS: Engineering Analysis System USER MANUAL Revision 4.4 A, 1989.

[Bal91] Bal, H. E.: A Comparative Study of Five Parallel Programming Languages. In: Proceedings of EurOpen'91, Tromso, Mai 1991. ftp:/1 ftp.cs.vu.n1:/pub/amoebalorca_papersleuropen91.ps.Z.


[Beg91a] Beguelin, A; Dongarra, J.; Geist, A; Manchek, R; Sunderam, V. S.: Solving computational grand challenges using a network of heterogeneous supercomputers. In: Sorensen, D. (Ed.); Proceedings of Fifth SIAM Conference on Parallel Processing, Philadelphia, PA, 1991.

[Beg91b] Beguelin, A; Dongarra, J.; Geist, A; Manchek, R; Sunderam, V. S.: Graphical developement tools for network-based concurrent supercomputers. In: Sorensen, D. (Ed.); Proceedings of Fifth SIAM Conference on Parallel Processing, Philadelphia, PA, 1991.

[Beg91c] Beguelin, A; Dongarra, J.; Geist, A; Manchek, R; Moore, K.; Wade, R: HeNCE: A users's guide (Draft). Oak Ridge National Laboratory, Nov. 1991.

[Beg92] Beguelin, A L.: Xab: a tool for monitoring PVM programs. School of Computer Science, Carnegie Mellon University, Jun. 1992.

[Bei90] Beier, H.; Bemmerl, T.; Bode, A et. al.: TOPSYS - tool for parallel systems. Technischer Bericht SFB-Bericht 342/9/90, Technische Universität München, Jan. 1990.

[Ber88] Bershad, B. N.; Zekauskas, M. J.; Sawdon, W. A; The Midway Distributed Shared Memory System. In: Proc. of the 38th IEEE Int'Z Computer Conf. (COMPCON Spring'93), S. 528-537, Feb. 1993.

[Bert89] Bertsekas, D. P.; Tsitsiklis, J. N.: Parallel and Distributed Computation: Numerical Methods. Prentice Hall, 1989.

[BleI90] Blelloch, G.: Vector Models for Data-Parallel Computing. MIT Press, 1990.

[Bode91] Boden, H.; Gehne, R, Grauer, M.: Parallel nonlinear optirnization on a multiprocessor system with distributed memory. In: Grauer, M.; Pressmar, D.B. (Eds.), Parallel Computing and MathematicaZ Optimization. Springer, 1991.


[Bode95] Boden, H.; Grauer, M.: OpTiX-II: A software environment for the parallel solution of nonlinear optirnization problems. In: Annals of Operations Research, 58:129-140,1995.

[Bodi91] Bodin, E; Beckman, P.; Gannon, D. B.; Narayana, S.; Yang, S.: Distributed pC++: Basic ideas for an object parallel language. In: Proc. Supercomputing '91, S. 273--282,1991.


[Bois94] Boisvert, R.E: The architecture of an intelligent virtual mathematical software repository system. In: Mathematics and Computers in Simulation, 36:269-279, 1994.

[Brad95] Braddy, D.; Brown, S. A.: PACT User's Guide. Technischer Bericht UCRL-MA-112087, Lawrence Liverrnore National Laboratory, 1995.

[Bro088] Brooke, A.; Kendrick, D.; Meeraus, A.: GAMS: A Users Guide. The Scientific Press, 1988.

[Carr94] Carriero, N.; Gelernter, D.; Mattson, T. G.; Sherrnann, A. H.: The Linda alternative to message-passing systems. In: Parallel Computing, 20(4): 633-655, 1994.

[Cap94] Cap, C. H.: Workstation Cluster Computation from the Perspective of the User. Technischer Bericht IF1-TR 94.06, CS Dept. University of Zürich, 1994. http://www.ifi.unizh.chlgroupslcap/ifi-94.06.ps.

[Chan92] Chang, L.-Ch.; Smith, B. T.: Classification and evaluation of parallel programming tools. Technischer Bericht CS90-22, University of New Mexico, Department of Computer Science, Albuquerque, New Mexico 87131, 1992.

[Chan93] Chandy, K. M.; Kesselman, c.: CC++: A declarative concurrent objectoriented programming notation. In: Research Directions in Concurrent Object-Oriented Programming. MIT Press, 1993.

[Che092] Cheong, E-C.: OASIS: An Agent Oriented Programming Language for Heterogeneous Distributed Environments. Dissertation. University of Michigan, 1992.

[Chie93] Chien, A. A.; Karamcheti, v.: Concert - Efficient Runtime Support for Concurrent Object-Oriented Programming Languages on Stock Hardware. In: Proceedings of SUPERCOMPUTING, 1993.

[Chiu95] Chiueh, T.-C.; Verrna, M.: A Cornpiler-Directed distributed Shared MernorySystern. In: Proc. ofthe 9thACM Int'l Conf on Supercomputing, Juli 1995.

[Com93] Corner, D.; Stevens, D. L.: Intemetworking with TCPRP, Bd. In: Client Server Programming and Applications. Prentice Hall, 1993.

[Conn92] Conn, A. R.; Gould, N.!. M.; Toint, P. L.: LANCELOT: a Fortran pakkage for large-scale nonlinear optimization (Release A), Springer Series in Computational Mathematics. Springer Verlag, Heidelberg, Berlin, New York,I992.

[CP89] Pinto, I. C.: Wissensbasierte Unterstützung bei der Lösung von Optimierungsaufgaben. Dissertation, Universität Dortmund, Fachb. Informatik, 1989.


[Cram94] Cramer, E. J; Dennis, J. E.; Frank, P. D.; Lewis, R M.; Shubin, G. R: Problem formulation for multidisciplinary optimization. In: SIAM Journal on Optimization, 4(4):754-776, 1994.

[Cull93] Culler, D. E.; Dusseau, A; Goldstein, S.; Krishnarmurthy, A; Lumetta, S. Eicken, T. von; Yelick, K.: Parallel Programming in Split-C. In: Proceedings of COMPUTING, 1993.

[Cull95] Culler, D. E.; Yellick, K.: CASTLE: Practical Software Supportfor Parallel Computing, Technischer Bericht, University of Berkeley, 1995.

[Dant66] Dantzig, G. B.: Lineare Programmierung Erweiterungen. Springer-Verlag, 1966.

[Diek91] Dieker, S.; Grillenbeck, A; Rittweger, A; Weinert, M.: Dynamische Berechnung vorgespannter rotationssymmetrischer Flüssigkeitstanks, Universität GH-Siegen, 1991.

[Dix078] Dixon, L. C. w.; Szego, G. P.: Towards Global Optimization, 2. NorthHolland, Amsterdam, 1978.

[Dong93] Dongarra, J.; Pozo, R; Walker, D.: ScaLAPACK++: An object-oriented linear algebra library for scalable systems. In: Proc. Scalable Parallel Libraries ConJ, S. 216--223. IEEE Computer Society, 1993.

[Don94] Dongen, V. van; Bonello, C; Freehill, C: Data Parallelism with High Performance C. In: Supercomputing Symposium 94, Canada's 8th Annual High Performance Computing Conference, 1994.

[Dong95] Dongarra, 1.; Walker, D.: Software libraries for linear algebra computations on high performance computers. In: SIAM Review, 1995.

[Dowd93] Dowd, K. (Eds.): High Performance Computing. O'Reilly and Associates, 1993.

[Esch89] Eschenauer, H. A; Weinert, M.: Optimale Radkonstruktionen, interner AbschluBbericht, Universität-GH Siegen, 1989

[Esch93] Eschenauer, H. A; Geilen, J.; Wahl, H. 1.: SAPOP - An Optimization Procedure for Multicriteria Structural Design. In: H.RE.M. Hömlein K. Schittkowski, (Eds.), Software Systems for Structural Optimization, S. 207-227. Birkhäuser Verlag, 1993.

[Flei89] Fleisch, B. D.; Popek, G. 1.: Mirage: A Coherent Distributed Shared Memory Design. In: Proc. of the 12th ACM Symp. on Operating Systems Principles (SOSP'89), S. 211-223, Dez. 1989.

[Flet87] Fletcher, R: Practical Methods of Optimization. John Wiley & Sons, 2. Ausg., 1987.


[Fost89] Foster, 1.; Taylor, S.: Strand: New Concepts in Parallel Programming. Prentice Hall, 1989.

[Fost92] Foster, 1.; Olson, R;. Tuecke, S. Productive parallel programrning: The PCN approach. Scientific Programming, 1(1):51--66, 1992

[Fost94] Foster, 1.; Kesselmann, C.; Olson, R;. Tuecke, S.: Nexus: An Interoperability Toolkit for Parallel and Distributed Computer Systems. Technischer Bericht ANLIMCS-TM-189, Argonne National Laboratory, Argonne, TIl., 1994.

[Fost95] Foster, I; Chandy, K. M.: Fortran M: A language for modular parallel prograrnming. J. Parallel and Distributed Computing, 25(1), 1995.

[Fost95a] Foster, I: Designing and Building Parallel Programs. Addison-Wesley, 1995.

[Frei95] FreisIeben, B.; Kielmann, T.: Approaches to Support Parallel Programrning on Workstation Clusters: A Survey. Technischer Bericht Fachbereich Elektrotechnik und Informatik, Universität GH Siegen, 1995.

[Ge195] Gelernter, D.: Generative Communication in Linda. In: ACM Transaction on Programming Languages and Systems, 7(1):80-112,1995.

[Gill81] Gill, P. E.; Murray, w.; Wright, M. H.: Practical Optimization. Academic Press, New York, London, Toronto, Sydney and San Francisco, 1981.

[Glen92] Glendinning, 1.; Hellberg, St.; Shallow, P.: Tools for parallel high performance systems - comparative evaluation. SNARC 92-01, University of Southampton, Department of Electronics and Computer Science, 1992.

[Göpf86] Göpfert, A.; Bittner, L.; Elster, K.-H.; Nozicka, E; Piehler, J.; Tichatschke, R: Lexikon der Optimierung. Akademie-Verlag, Berlin, 1986.

[Grim91] Grimshaw, A. S.: An introduction to parallel object-oriented prograrnming with Mentat. Technischer Bericht 91 07, University of Virginia,1991.

[Hain93] Haines, M.; Bohm, w.: Task Management, Vutual Shared Memory, and Multithreading in a Distributed Memory Implementation of Sisal. In: Proc. 0/ Parallel Architectures and Languages Europe (PARLE'93), S 12-23, Jun. 1993.

[Hea93] Heath, M.: Recent developments and case studies in performance visualization using ParaGraph. In: Performance Measurement and Visualization 0/ Parallel Systems, S.175-200. Elsevier Science Publishers, 1993.


[Hed93a] Heddaya, A; Sinha, H.: An Overview ofMennera: A System and Fonnalism for Non-coherent Distributd Parallel Memory. In: Proc. of the 26th Hawaii Int'l Cont on System Sciences (HICSS-26), S. 164-173, 1993.

[Hed93b] Heddaya, A; Sinha, H.: An Implementation of Mennera: A Shared Memory System that Mixes Coherence with Non-coherence. Technischer Bericht BU-CS-93-006, Computer Science Departement, Boston University, 1993.

[Herr91] Herrarte, V.; Lusk, E.: Studying parallel program behavior with upshot. Technischer Bericht ANL-91115, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Ill., 1991.

[Hörn93] Hömlein, H. R. E. M.; Schittkowski, K. (Eds.): Software Systems for Structural Optimization, Ausg. 110 von International Series of Numerical Mathematics. Birkhäuser Verlag, 1993.

[HPF93] High Perfonnance Fortran Forum: High Perfonnance Fortran language specification, Version 1.0, Technischer Bericht CRPC-TR92225, Center for Research on Parallel Computation, Rice University, Huston, Tex., 1993.

[Kale92] Kale, L. V.: A Tutorial Introduction to Chann. Parallel Prograrnming Laboratory Report 92-6, University of Illinoies, 1992.

[Kess94] Kessler, G. Shepard S.: A primer on internet and TCP/IP tools. Request for Cornments (Informational) RFC 1739, Internet Engineering Task Force, Dezember 1994.

[Konn94] Konno, K.; Nagatsuka, M.; Kobayashi, N.; Matsuoka, S.; Yonezawa, A: PARCS: An MPP-Oriented CLP Language. In: Proceedings of the First International Symposium on Parallel Symbolic Computation (PASCO'94), S. 254-263, Linz, Österreich, 1994

[Krus88) Kruskal, C. P.; Smith, C. H.: On the notation of granularity. The Journal ofSupercomputing, 1, 1988.

[Lin88] LINDO: An Optimization Modeling System, Text and Software, 1988.

[MacK90] MacKinnon, D.; McCrum, w.; Sheppard, D. (Eds.): An Introduction to Open Systems Interconnection. Computer Science Press, 1990.

[McIn95) McInnes, L. c.; Smith, B.: PETSc 2.0: A Case Study of Using MPI to Develop Numerical Software Libraries. In: Proc. ofthe 1995 MPI Developers Conference, University of Notre Dame, 1995.

[Macf93] Macfarlane, J. F.; Annstrong, R.: POET: A Parallel Object-Oriented Environment and Toolkit for Enabling High-Perfonnance Scientific Computing. Technischer Bericht, Sandia National Laboratory, Livermore, Ca., 1993.


[Minn89] Minnich, R G.; Faber, D. J.: The Mether system: distributed shared memory for SunOS 4.0. Usenix. Sommer 1989.

[Minn93] Minnich, R G.: Mether-NFS: A Modified NFS Which Supports VlrtUal Shared Memory. In: Proc. 0/ the Symp. on Experiences with Distributed and Multiprocessor Systems (SEDMS-N), S. 89-107, Sept. 1993.

[Mohi91] Mohindra, A.; Rarnachandran, U.: A survey of distributed shared memory in loosely-coupled systems. Technischer Bericht GIT-CC-91101, Georgia Institute of Technology, Atlanta, January 1991. e-mail: [email protected].

[Moir93] Moire, J. 1.; Wright, St. J.: Optimization Software Guide. SIAM, 1993.

[MPI94] MPI: A message-passing interface standard. Technischer Bericht CS-94-230, Computer Science Departrnent, University of Tennessee, Knoxville, TN, Mai 1994.

[Murr93] Murrer, S.; Feldman, J. A.; Lim, c.-c.: pSather: Layered Extensions to an Object-Oriented Language for Efficient Parallel Computation. Technischer Bericht TR-93-028, Berkeley, Ca., 1993.

[Nitz91] Nitzberg, B.; Lo, V.: Distributed Shared Memory: A Survey of Issues and Algorithms. In: IEEE Computer, 24(8):52-60,1991.

[NOC95] High Performance Computing and Communications: Foundation for America's Information Future (FY 1996 Blue Book). http:// www.hpcc.govlblue95/index.html,November 1995.

[Orfa95] Orfali, R; Harkey, D.; Edwards, J.: The Essential Distributed Objects Survival Guide. John Wiley & Sons, 1995.

[PC++95] ESPRIT Working Group EUROPA: Parallel C++. http://www.lpac.ac.ukl europa, 1995.

[Pei91] Peierls, R.; Campbell, G.; ALMS - programming tools for coupling application codes in a network environment. In: Proceedings 0/ the Heterogeneous Network-Based Concurrent Computing Workshop, Tallahassee, FL, Okt. 1991, ftp:/Iftp.scrLfsu.eduipub/parallel-workshop.91.

[Pete91] Peters, E.: Ein Beitrag zur wissensbasierten Auswahl Steuerung von Optimierverfahren. Dissertation, Universität Dortmund., Fachbereich Informatik, 1991.

[Pip93] Piper, A. J.: Generalized Parallel Programming with Divide-and-Conquer: The Beeblebrox System. Technischer Bericht CUEDIF-INFENGITR 132, Cambridge University, Engineering Department, 1993.


[PVM95] Geist, A.; Beguelin, A.; Dongarra, J.; Cheng, w.; Manchek, R; Sunderam, Y.: PVM: Parallel Virtual Machine: A Users' Guide and Tutorialfor Networked Parallel Computing. The MIT Press, Cambrigde Ma, 1995. http://www.netlib.orglpvm3/book/pvm-book.htrnl.

[Rein94] Reinefe1d, A. The ZEUS Report. Technischer Bericht TR-006-94, Paderborn Center of Parallel Computing, Paderbom, DE, 1994. http:// www.uni-paderborn.de/pcpc/publications/1994/zeusreport.ps.Z.

[Reut92] Reuter, A.: Grenzen der Parallelität. In: Informationstechnik it, 34:62-92, 1992.

[Rina92] Rinard, M. c.; Scales, D. J.; Lam, M. S.: Heterogeneous parallel programming in Jade. In: Proceedings of the Workshop on Cluster Computing, Tallahassee, FL, Dez. 1992, ftp:/Iftp.scri.fsu.edu/pub/parallelworkshop.92.

[Rose92] Rosenberry, w.; Kenney, D.; Fisher, G. (Eds.). Understanding DCE. O'Reilly and Associates, 1992. ISBN 1-56592-005-8.

[Rosi90] Rosing, M.; Schnabel, RB.; Weaver, R P.: The DINO parallel programming language. Technischer Bericht CU-CS-501-90, Computer Science Department, University of Colorado at Boulder, Boulder, Co!., 1990.

[Rohw84] Rohwer, K.: BEOS, Buckling Loads and Natural Vibrations of Eccentrically Orthotropic Shells. DFVLR-Mitteilungen 81-07/1984.

[ScaI94] Scales, D. J.; Lam, M. S.: The Design and Evaluation of a Shared Object System for Distributed Memory Machines.ln: Proc. ofthe Symp. on Operating Systems Design and Implementation (OSDI), S. 101-114, Nov. 1994.

[Schn94] Schnabel, RB.: A view ofthe !imitations, opportunities and challenges in parallel nonlinear optimization. Parallel Computing, 21:875-905, Dezember 1994.

[Schw77] Schwefel, H.-P.: Numerische Optimierung von Computer - Modellen mittels der Evolutionsstrategie. Birkhäuser Verlag, 1977.

[Skje93] Skjellum, A:. The Multicomputer Toolbox: Current and future directions. In: Proc. Scalable Parallel Libraries Conf, S. 94-103. IEEE Computer Society, 1993.

[Smit92] Smith, G.: Object-oriented Fortran tutorial. Engineering Research Center, Mississippi State Univeristy, 1992.

[Smit93] Smith, J. R: The Design and Analysis of Parallel Algorithms. Oxford University Press, 1993.


[SOF92] Situation und Perspektiven des Einsatzes der parallelen Datenverarbeitung. Landesinitiative SOFfECH NRW; Ministerium für Wirtschaft, Mittelstand Technologie des Landes Nordrhein-Westfalen, 0-4000 Düsseldorf, Haroldstr. 4, September 1992. Studie der Pallas GmbH Parsytec Computer GmbH.

[Spie88] Spielberg, K.: Entwicklungstendenzen in der Mathematischen Programmierung. IBM: Wissenschaftliches Forum '88, München, Oktober 1988.

[SteI94] Stellner, G.; Lamberts, S.; Ludwig, T.: NXLib Users Guide Version 1.1.2. Technische Universität München, 1994.

[Sun87] Sun Microsystems, Inc. XDR: External data representation standard. Request for Comments RFC 1014, Internet Engineering Task Force, Juni 1987.

[Sun88] Sun Microsystems, Inc. RPC: Remote procedure call protocol specification version 2. Request for Comments (Informational) RFC 1057, Internet Engineering Task Force, Juni 1988.

[Tur93] Turcotte, L. H.: A Survey of Software Environments for Exploiting Networked Computing Resources. Technischer Bericht, Engineering Research Center for Computational Field Simulation, Mississippi, MS, 1993.

[Vino93] Vinoski, St.: Distributed object computing with CORBA. C++ Report, 5(6):32-38, August 1993.

[Wasi89] Wasil, E.; Golden, B.; Sharda, R.: Mathematical programming software for the microcomputer: Recent advances, comparisons, and trends. In: Sharda, R.; Golden, B. L.; Wasil, E.; Balci, 0.; Stewart, W. (Eds.): Impacts 0/ Recent Computer Advances on Operations Research. Elsevier Science Pub!. Co., 1989.

[Yan93] Yan, J.; Hontalas, P.; Listgarten, S., et al.: The Automated Instrumentation and Monitoring System (AIMS) reference manual. NASA Technical Memorandum.


[Aho88] Abo, A. v.; Sethi, R.; Ullman, J. 0.: Compilerbau: Teil 1, Teil 2. Addison Wesley, Reading, MA, 1988.

[Akl89] Akl, S. G.: The Design and Analysis 0/ Parallel Algorithms. Prentice Hall, 1989.

[Bert89] Bertsekas, D. P.; Tsitsiklis, J. N.: Parallel and Distributed Computation: Numerical Methods. Prentice Hall, 1989.



[Bode95] Boden, H.; Grauer, M.: OpTiX-II: A software environment for the parallel solution of nonlinear optimization problems. In: Annals 0/ Operations Research, 58:129-140,1995.

[Bois94] Boisvert, R.F.: The architecture of an intelligent virtual mathematical software repository system. In: Mathematics and Computers in Simulation, 36:269-279, 1994.

[Carv92] Carver, N.; Lesser, V.: The evolution of blackboard control architectures. Technischer Bericht CMPSCI 92-71, Department of Computer Science, University of Massachusetts, Okt. 1992. ftp://ftp.cs.umass.edu/publlesser/ carver-92-71.ps.

[From91] Frommberger, M.; Brüggemann, F. J.; Grauer, M.: PCL - a language for parallel optimization on distributed workstations. In: Grauer, M.; Pressmar, D. B. (Eds.), Parallel computing and mathematical Optimization. Springer, 1991.

[GeI95] Gelernter, D.: Generative Communication in Linda. In: ACM Transaction on Programming Languages and Systems, 7(1):80-112,1995.

[Grau89] Grauer, M.: About the development of integrated software-systems for mathematical prograrnming. In: Streitfeldt, L.; Hauptmann, H.; Marusev, A. W.; Ohse, D.; Pape, U.(Eds.): Operations Research Proceedings 1989, S. 489 - 496, Springer Verlag, Berlin, 1989.

[HR83] Hayes-Roth, B.: The blackboard architecture: A general framework for problem solving. Technischer Bericht HPP-83-30, Stanford University, May 1983.

[Srnit93] Srnith, J. R.: The Design and Analysis 0/ Parallel Algorithms. Oxford University Press, 1993.

[Parr95] Parr, T. J.: Language Translation Using PCCTS and C++ (A Reference Guide). ftp://ftp.parr-research.comlpub/pcctslBook/reference.ps.gz, 1995. Initial Release to Internet for Review and General Bashing.



[Aza90] Azarm, S.; Li, w.c.: Optimality and Constrained Derivatives in TwoLevel Design Optimization. In: Journal 0/ Mechanical Design, 112:563-586,1990.


[GoI70] Golinski, 1.: Optimal Synthesis Problems Solved by Means of Nonlinear Prograrnming and Random Methods. In: Journal 0/ Mechanism, 5:286-309,1990.

[Rose60] Rosenbrock, H. H.: An automatie method for finding the greatest or least value of a function. In: The Computer Journal, 3:175-184,1960.

[Schw77] Schwefel, H.-P.: Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkhäuser Verlag, 1977.

[Wahl96] Wahl, H.-J.; Rottler, A.: SAPOP-Handbuch. FOMAAS, Universität - GH Siegen, 1996.

Anhang A OMT Diagramm-Notation

Notation für das Objektmodell Grundlegende Konzepte

Klasse:

! KIas!ieJnanE!

AttriIU AttriIU: I;liemyp AttriIU: Iliertyp = Il:faJltv.ert

a::: (Arg-~): Ergdrist}p

GerHalisHmg ('eItrlmJg):

!~! X

A.wtzi;iioo:

~ ...----. ! KJasse..l!RdE_l RdE_2!Klltise-2! Qwljfbierte~oo:

!l\Iarfieol! = I ~2!l\Iarfieo2! ~

~vm~ ~ GelWeins

~ Kb&;e m (ru1l aIer mflr)

-4 Kb&;e Qtimi (ru1lcd:reins)

..!:!fl\la$e Ensalermflr

~ Kb&;e ~ SjX'Zifizert

{kdmog:

~r-~-----.!

~IU:

!1\Ia<ii1e-ll-.:! Moaai~=~. ~·cnsnare~-f! ~Kb;:::iI2!

I~I

Cbjddin<.tamJen: Instanti~

((KIas!ienareD (~~~) (~EU ~I\I~! [Runiwgh, J., et 81: OIjed.mmtedMOi~and 1lS~ Prmtire-IWI, 1991]

178 Anhang A. OMT Diagramm-Notation

Notation für das OjJjektmodell Weiterführende Konzepte

~

Quaiat(lbsbakt)

"I

Qxr.tiat ist in cEr ldasse Ibstract. <hr

I: ~2 üP:rati:n

10I8tdaR1 I ~ I

~amngl'm QJeradmeu: r J{J, ' ... ,E I

i::J ~ati:j I 1GIa&1 I / I JGlae.21

~zMdmA6aldatimeu: 1_11 ~1_21

Anhang A. OMT Diagramm-Notation

Notation für das dynamische Modell Erei~ verursacht Transition zwischen Zuständen:

c ) Ereignis e>( ) Zustand- Zustand-

Anfangs- und Schlußzustand:

Ereignis mit Attribut:

Ereignis (A:(:"~ ( Zustand-)Zustand-}

Aktion auf einer Transition:

C )EreigniS/A~tipa ~ _ Zustand~ ~ Zustand-j

179

Bewachte Transition: Ausgabeereignis auf einer Transition:

Ereignis cwc!(,er) ( Zustand) Zustand-}

Aktionen und Aktivität in einem Zustand:

Zustandsname entrylEingangsaktion do: Aktivllät-A Ereignis-li Aktion-I

e~itlAusgangsaktio

Zustandsgeneralisierung (VerschaChtelung):

Ereignis llEreignis 2 Cr"Z-us-ta-nd ...... j co{r"Z-us-ta-nd ...... -}

Senden eines Ereignisses an ein anderes Objeld:

Ereignis 1 ( ZusUmd1 . ~ZUSUmd)

: Ereignis 2 'S7

1 Klasse 31

Parallele Unterdiagramme:

Ereignis 2

Aufspaltung von Steuerung: Steuerungssynchronisation: ~;:::;::::::::-::-~:-::::;;::=~

Ereignis 0

180 Anhang A. OMT Diagramm-Notation

Notation für das funktionale Modell Prozeß:

~ ~ /~

Datenspeicher oder Dateiobjekt:

Name des Dateospeicbers

Handlungsobj~kte: (als Datenquelle oder -senke)

I~~r~~~~t Zugriff auf Datenspeicherwert:

DateDSpeicher

~ ~

Zueriff und Aktualisierung eines Dafenspeicherwens:

Dateaspeicher

~ ~

Duplizierung eines Datenwerts:

~

Datenfluß zwischen Prozessen:

Datenfluß in einen Datenspeicher:

Name des ---t> Dateospeichers

Kontrollfluß:

Aktualisierung eines Datenspeicherwen

DateDSpeicher

~ ~

Kombination von Datenwerten: :>1 IIggregiertcr Uatenwert c>

d2

Aufspaltung in Datenwerte:

~ U~

Anhang B Übersicht zu WxWindows scrollbar wxIntPoint wxLogClass

XFontinfo wbMenuitem - wxMenuitem wxColour

,LwxCommandEvent wxEven,\wxKeyEvent

wxMouseEvent wxForm wxFormltem wxFormltemConstraint wxHashTable - wxTypeTree wxIntPoint

~XFontPool wxBrushList wxColourDatabase

, wxFontList wxLlst wxGDIList

wxPathList wxPenList wxStringList

wxNode wxPoint wxRealRange wxString wxSystemEventClassStruc wxSystemEventNameStruc wxTypeDef wxbApp - wxApp wxbBitmap - wxBitmap wxbBrush - wxBrush

wxObject wxbColourMap - wxColourMap

wxPoint

wxbConnection - wxConnection - wxHelpConnection wxbCursor - wxCursor

~WxPostSCriptDC wxbDC _ wxDC wxbCanvasDC - wxCanvasDC - wxbMemoryDC - wxMemoryDC

wxbMetaFileDC - wxMetaFileDC

wxbFont - wxFont

bIPCQb' IPCOb' <wxbQient - wxClient - wxHelplnstance wx ~ect - wx ~ect wxbServer _ wxServer

wxblcon - wxIcon wxbMetaFile - wxMetaFile wxbPen - wxPen wxbTimer - wxTImer

wxbWindow - wxWindo

wxbCanvas - wxCanvas wxbFrame - wxFrame

wxbButton - wxButton wxbCbeckBox - wxCbeckBox wxbChoice - wxCboice wxbListBox - wxListBox wxbMenu - wxMenu wxbMenuBar - wxMenuBar wxbMessage - wxMessage wxbRadioBox - wxRadioBox wxbSlider - wxSlider wxbText - wxText - wxbMultiText - wxMultiText

xbPanei - wxPanel- wxbDialogBox - wxDialogBox - wxEnhDialogBox wxbTextWindow - wxTextWindow

Anhang C üpTIX·m Syntaxdiagramme

opllz

~d~~~a~i~p:ti~o~n~p~M~tJrIl--------------~~EOF

declaration part

-~"'-----------------------""""7-1 vMiable definition PMt

constant definition part

constant definition part

variable definition part

tariable list

eoordinationvars

single variable h,.---------------------------,-{

single variable

IDENTIFIER

range

depends

~ description part

objective definition

constraint definition bound definition

Anhang C. OpTiX-ill Syntaxdiagrarnme 183

ob)ect.ve deJinltlon

variable

index expression

index expression

constant expression

index variable r...;-----------------r-'

constant expression

constant expression

constant

-----1 IDENTIFIER ~ scalar variable

-----1 IDENTIFIER ~

veetor variable

----l IDENTIFIER ~ matrix variable

-----1 IDENTIFIER ~ index variable

-----1 IDENTIFIER ~

184

constramt dejinll,on

constraint

bound definition

~ bounds

constant expression

variable ."'pression

scalar variable

vector variable

matrix variable

system tasb

variable expression

variable expression

Anhang C. OpTIX-m Syntaxdiagramme

constant expression

constant expression

Anhang C. OpTiX-ill Syntaxdiagramme 185

Inllrallzahon

variable expression constant expression

expression

term

factor

basis

sum

constant expression constant expression

186

functlOn name

--,,-., abs r--"'7'--

sqrt

vector product

---1 vector variable ~ vector variable ~

vector expression

---1 matrix variable ~ vector variable ~

Anhang C. OpTtX-m Syntaxdiagramme

Anhang D Algorithmen

Konfigurationsdatei poromtter

main parameter

( I parameter item T-ls-f -

additional pansmeter

pllfllmeCtr dem

INTEGER: {[\+\-]}[0-9)+

FLOAT: {[\+I-) )([1-9)[O-9)*{ .[0-9)* }I{ O} .[0-9)+){ [Ee) {[\+I-)} [0-9)+ }

IDENTIFIER:[a-zA-Z-1[0-9a-zA-Z-1

WORD: [a-zA-Z_äöüßÄÖÜ\()[O-9a-zA-Z_äöüBÄÖÜ\(:I) V 1- 1+ \, I. I' I'IA)

STRING:"[A"}+"

OxA

lgor

tlhm

o O

xPar

amln

llanc

eo

nam

e: c

har

noRe

al: i

nteg

er

Her

ation

a: in

tege

r pa

rtnst

noln

l: In

lege

r so

lutio

n: In

tege

r iC

ount

: sho

lt IC

ount

: sho

rt In

H(n

ewPr

obIe

m: O

xPro

bler

n,ne

wD

ata:

OxP

robi

emD

ata)

~::~err

=~= Ox

Prob

Iem

) (ab

stra

ct)

P ~ProbIem

dala

ox

prob

lem

Dlle

ol

icre

at~n

umbe

rRee

': In

tege

r, nu

mbe

rlnt:

Inte

ger)

: ~:OxprobIernData)

eraa

le n

umbe

rRaa

l: In

leger

ltrea

lVaI

: IIo

at,

Set

: OxP

aram

lnet

ance

) nu

rnbe

rlnt:

Inle

ger,

Int

81: I

nteg

er)

~oNama: c

haI)

A

ddln

t(vaI

ue: I

nt=

~~ch

ar

Add

Aoa

t(val

ua: f

töat

Get

EllO

):

char

Se

t~Id

X: In

tege

r, va

Iue:

int:l

rr)

GetD

ataO:

Pr

obIe

mD

ata

Set I

dx: I

nteg

er, v

alue

: noa

Ge

tPIII

'IIIII

I1II(

): O

xPar

amln

st8nc

e In

t(ldx

: In

t= In

l!!la

r re

lAlI(

ouIS

ll8III

I: os

traar

n, da

la: O

xPro

bIam

Dal

a)

AoatQ

dx:

r): n

oat

R88U

IIS(o

utSt

ream

: ost

l8lll

l, da

la: O

xPro

biem

Dat

a)

InlP

aram

aO: I

nl!lf

lr A

oaIP

aram

aO: f

toat

A

Dou

bIe(

ldx:

inte

ger):

dou

bla

Max~

: in

tege

r No

l ()

:Int

~r

NoRa

aIO:

In a

gar

OxU

nCon

etA

lgor

tthm

" O

xNon

Line

arA

lgor

llhm

o Be

IIO

t"::::

;:;:=

-1

OxP

robl

emo

I pr

oble

m

S: OxP

robI

em, n

awDa

ta: O

xPro

bIer

nDat

a)

I OxN

LPro

bIe

° ~ i~a

m: Ox

Prob

Iem

, naw

Dat

a: O

xPro

bIam

Dat

a)

11ew

Prob

Iem

: OxP

robl

am)

m

Set n

ewPr

obIe

m: O

xPro

blam

) : O

xPro

bIam

pr

oblem

T

(o

utSt

ream

: ostr

eam

, dat

a: O

xPro

bIam

Dat

a)

A

Rasu

lt8(o

utSt

raam

: ost

l8ar

n, d

ata:

OxP

robl

amD

ata)

Pr

obIa

mO

: OxP

robl

em

/\

I I

I OxPo

~opto

U

I O

xSIfI

OPA

lgoO

I

OxC

onlD

I,.

I O

xSep

opD

Bo

• •

SaI,&

'Nam

a: ch

ar

sapo

pDB

I OxE

volu

tlon°

•

• •

IP

: Int

eger

RP

AR: d

oUbl

e

I OxR

aduc

edG

radl

enlo

in

oIPA

R: in

lege

r no

RPA

R: in

lega

ralg

orilh

m

type

: int

eger

$cre

ataO

So

IvaO

In

H(n

ewPr

oblam

: OxP

robl

am, n

awD

ala:

OxP

robi

emD

ala)

Cr

aala

DB(

new

Prob

lem

: OxP

robI

am, n

awD

ata: O

xPro

biem

Dat

a)

sal~

atab

asa:

OxS

apop

DB)

Pu

t ar

amet

er%

G

eiPa

ram

eter

f\

I O

xSEQ

U2°

I

> =

=- = =

(JQ

~

~ §

i I

PS =-

~ ~ .,

1 O

xPro

blem

' 1

I probl

em

OxU

nCon

stA

lgor

ithm

'

I O

xQu8

slN

ew'

I I

OxS

teep

Des

c' I

/

I O

xCon

jOlr'

I

I O

xNew

ton'

I

I O

xStd

Des

c2'

I

OxA

lgor

ithm

'

nam

e: c

har

d O

XP

lram

lnst

ance

'I Ite

ratio

ns: I

ntag

er

arln

st

solu

tion:

inta

ger

Init(

new

Prob

lem

: OxP

robl

em,n

ewD

ata:

OxP

robl

emD

ata)

So

lveO

~bstract}

Sel

"ew

rob

lem

: OxP

robl

em) (

abst

ract

) Pr

Ie

ma:

OxP

robl

em

---:;::;

::1 O

xPro

blem

Dat

a' J

se~ew

ata:

OxP

robl

emO

ata)

Se

t ins

tanc

e: O

xPar

amln

stan

ce)

data

Se

t afg

oNam

e: c

har)

Ge

a~:char

Get

Erro

S8

(): c

har

Get

Dat

a():

xPro

blem

Dat

a G

etPa

ram

lnst

(): O

xPar

amln

stan

ce

TeIlA

II(ou

tStre

am: o

stre

am, d

ata:

OxP

robl

emD

ata)

Re

sultS

(out

Stre

am: o

stre

am, d

ata:

OxP

robl

emD

ata)

A

1 O

xTen

An'

1 O

xNon

Une

lrAlg

orlth

m'

prob

lem

I O

xNLP

robl

em'

I

1 OxO

ptim

Com

plex

Met

hod'

11

OxA

ugm

llgr'

1

, 1 O

xOpt

lmC

onjG

radl

ent'

I O

xPen

llty'

I

I O

xSap

opO

B'

I 11

OxP

oIyt

ope'

11

O

xBar

rler'

-Jsa

POPD

B I

OxE

volu

tlon'

11

I O

xRan

dom

' I

1 11

OxP

SQP'

J

I O

xSap

opA

lgo'

A

1

OxG

REG

A'

1

I O

xOua

lSla

rr I

1 O

xGen

etlc

' 1

OxS

cann

lng'

I

11 O

xEXT

REM

' I 1

1 O

xEVO

LU'

111

OxQ

PRL T

' I

I O

xOpt

lmG

RG

' I O

xSlm

Ann

ealln

g'!

1 OxE

paSc

annl

ng'1

I OX

Red

Uce

dGra

dlen

t'!

1 OxO

ptlm

Ran

dSea

rch'

1

OxS

EQLl

2'

1 I

OxV

MC

WO

' 1

1 O

xSEC

OP1

' 1

i (JQ

rn ~ f ~ ~ ~ g. .....

00

\C

)

,---

----

----

-----

, , , , , , , , , se

lect

s al

g(jri

thm

s wi

1h:

OxC"

~Sol

ve

, O

xPro

blem

Dat

ll'1

I dats

OxA

lgor

ithm

'

nam

e:ch

Ir 1I

tIratI

ons:

Inte

ger

solu

tion:

Inte

g8r

I!*(n

ewPr

obIe

m: O

xPro

bIem

,new

Dat

s: O

XPro

blem

Dats

) ~Ibmct)

Eiern

: OxPro

biem

) (ab

stra

ct)

P

: OxP

robI

em

.-: OxP

llllllln

etan

ce)

~:cha~

: c:ha

r : c

:har

Qtt!

1a1I

():

mD

ats

~: O

xPar

amln

stan

ce

TeIA

II(ou

tSln

lim: 0

Itm

m, d

aIa:

OxP

robl

emD

ats)

R

eelit8

(out

Stre

am: o

atrse

m, d

ats:

OxP

robl

emD

ats)

parln

st

OxA

lgor

ithm

DB

'

fileNa

me:

cha

r

$cre

ata(

conf

igFi

le: c

har)

Ge

tPa

ram

ata

il.'i:

w

xList

G

etN

oAIg

orilh

m

: inte

ger

Seie

ctAl

gorit

hm

prop

erty

: OxP

rope

rty,

a Al

gos:

wxS

tring

List

, us

able

Algi

ls: w

xStri

ngLi

st)

Get

Algo

rithm

(cla

ssna

me:

cha

r): O

xAlg

onth

m

OX

Plra

mln

slS

nce'

noRe

al: I

nteg

er

noln

t: in

tege

r iC

ount

: shO

rt fC

ount

: sho

rt iV

al: i

n:?e

r lV

al: f

Ioa

--

-st

srts

with

file

Nam

e--

--

ist pa

ram

eter

list

t:ate

lnum

berR

eal:

Inte

ger,

num

berln

!: in

tege

r) at

e nu

mbe

rRea

l: In

tege

r re

alVa

l: flo

at,

nurn

berln

t: in

tege

r, in

tVal

: int

eger

) se

t :rt

!;:t

er .

___

Addl

nt(v

alue

: in~erl

AddF

lOat

(val

ue: f

löat

S~idx: in

tege

r, va

lue:

in::

rr)

S

idx:

inte

ger,

valu

e: fl

oa

In~i

dx: In

tage

~: in~

er

Floa

t(idx

: int

eger

): flö

at

IntP

aram

sO: I

nteg

er

Floa

tPar

ams(

): flö

at

Dou

bie(

idx:

inte

ger):

dou

ble

Max

O: i

nteg

er

Noln

lO: i

ntei

:r

NoRe

alO

: in

eger

Be

ll()

5toke

nJb':

ANT

LRCh

ar

t: S

etW

ordT

ype

rr2: S

etW

ordT

ype

113:

SetW

ordT

YJl8

$set

wdl

: Set

Wor

dTyp

e $s

etw

d2: S

etW

ordT

ype

para

mLi

st w

xList

zzdf

tthan

dler

sLsig

nal: in~r,

rets

igna

l: in

tege

r) $c

r8at

:inPu

t: AN

TLRT

okef

IBU/

fer)

$ere

a in

put:

ANTL

RTok

enBu

ffer,

801:

Toke

nTyp

e)

para

me

r()

desc

riptio

n-P8

rtO: O

xPar

amet

er

main

...pa

ram

atar

O: w

xList

ad

dltk

inal

,jJar

amel

llrO

: wxL

ist

para

met

erjte

mO

: OxP

aram

eler

ttem

I Wo

rds()

: cha

r -

, Get

Para

mPa

rser

(): wxL

~ , ge

ne;ra

tes

t O

xPar

ame!

er'

nam

e:ch

ar

class

Nam

e: c

har

canS

olve

: OxP

ROBL

EM

host

s: c

har

desc

riptio

n: c

har

nole

s: w

xStri

lgLi

st

$cr8

ate(

aNar

ne: c

har,

aCle

esNa

me:

cha

r, llo

atI..

ist c

har,

aDes

crip

tion:

cha~

Ad

d=

5

SetM

ain

a ist

: wxL

ist)

SetA

ddPa

ram

eter

( t:

wxLi

st)

GetN~

Get

ela

8: cha

r Getln~paramlnstance

Get

Nol

tsm

s nt

: int

eger

, fCo

unt:

inte

ger)

Mak

eFon

ns

~ate()

ake

pa

rs(p

are

nt:

wxW

indo

w): w

xDia

logB

ox

Make

He~

: WXD~BOX

Show

He

Dial

og s

how

: )

.- ~ >

5- ~ !:Tl ~ ';'l !2 1 g ~ ~ f =-

L wxD

lalo

gBox

~ --

----

---,

I w

xFon

n I

, I par

amD

iaIog

he

lpD

ialog

,

l';

OxP

aram

oter

' di

spla

ys ~ m

anag

es

OIP

....

. _onn·

na

me:

char

al

onn

dass

Nam

a: c

har

: ~er. O

xPar

amete

r ca

nSoI

ve: O

xPRO

BLEM

'

main

Msg

: wxF

onnl

lem

hos1

s: ch

ar

C _

__

__

__

__

_ ..

addM

sg: w

xFor

mlle

m

desc

rip1i

on: e

h ..

$cre

ala(

ij"e

ler.

DIP

_er,

usel

lutto

ns: I

nteg

e~

noteo

: wxS

lring

UsI

GelM

ain

I: wx

Fonn

I1em

$c

rtlle

(aN

ame:

cha

r, BC

lassN

ame:

char

, pa

ram

eter

i

para

mFo

nn ~f,Msg I:

wxF

onnl

1em

ho

sIU

st ch

ar, a

Des

crip

tion:

cha

~ sa

me ~rameter

AddN

oI~n

o1e:

cha

rl On

Canc

e1~

SeiM

ain a

ram=~I: w

xUsII

,

OnR

ever

t Se

1Add

Para

me

I: wx

UsII

OnU

pdal

1 G

eIN

"'""/.

!: ch

ar

para

met

er

he1p

Form

On

He1p

O G

eIC

lass

~: c

har

Cent

e~)

GeH

ns15

/1'

IPar

amln

s1lln

ce

GeIN

o11

iCou

nt in

lege

r,lC

ounl

: int

eger

l M

alleF

O

xPar

amet

ertle

m·

OIP

ARAI

iETE

II"

l!f.:t

eO

aII

ep

ap

a,e

nl:

wxW

indo

wl: w

xDiaI

ogBo

x na

me:

cha

r $I

NT _P

ARAM

: ""'

m

~=e1

~

~DtllFx

desa

lp1i

on: c

har

~OUND I

NT P

AR

AM

:....m

y $c

reat

e(aN

ame:

cha

r, aDasaI~: ~

NUM1

>~tt

~~ ...

...

S.,=

ion(

alD

escr

ipti

on:

~ ~~ R

EAl

PARA

M:en

um

Gel

I:c

har

=t-tM

ALl,=

: enum

ad

dPar

amo

g::T

J~~~

PE

Ge1F

IoOIO

: ftO

al

mai

nPar

ams

=~~=~~:'Ö:~=llern

A

OIR

oaIP

a,..,

· O

xlnt

Parlm

t O

IBoo

IPar

am·

valu

e:fto

al

valu

e: In

lege

r va

lue:

8oo1

$cra

ala(

aNam

a: c

har,

aVal

ue: H

oa~

$cre

ala(

aNam

e: c

har,

aVaI

ue: i

nlag

er,

Scre

ala(

aNar

ne: e

hor,

aVaJ

ue: 8

001,

aDes

crtp

1ion

: cha~

aDes

alp1

ion:

eha

rl a~:charl

Ge1

F*l1

' H08

1 &~

f'O:

ffi'

~PE

&=,"~arrvP

E G

eiT

: OxT

YPE

Mak

e or

mlle

m():

wxF

orm

llern

M

akef

o'nnl

1em

Q: w

xFon

nllem

M

ak

onnH

ernO

: wxF

onnl

1em

A

A

OxB

ound

Rta

lPar

am·

OIE

num

Rta

IPar

am·

OxB

ound

lntP

_am

t O

IEnu

mln

IP.ra

m·

Iow

:ftoa

l se

1ec1

ion: c

har

Iow: i

ntag

er

salac

1ion

: cha

r hi

gh:lI

oal

valu

eUsI

: wxU

SI

hlg1

: Inl

ager

va

lueU

st wx

UsI

se1e

dUSI

: wxU

sI se

lec1U

sI: w

xlis

l Sc

real

a(aN

ame:

eha

r, .V

alue

: H08

I, $cr

eal~:~

:;';;'

:: ~~~:i=~'

I ....

r. H

oaI,l

1ghe

r. lI

oa~

Scre

ala(

aNam

a: e

h .. ,

aVaJ

ue: H

08I,

Scra

ala(

aNam

e: e

har,

aValu

e: in

tege

r, aD

escr

iptio

n: cha

~

GeiT

a~

~:~~

ehar

l aD

escr

iptio

n: e

harl

GelT

~'rß

~~~:

ehar

l G

ellnt

(): In

tege

r

Mak

ronn

llern

(): w

xFon

nller

n G

etFlo

elO: t

ioel

App

end(

nem

e: eh

.r, v

.lue:

inla

gerl

App

endI

nem

e: e

h.r,

valu

.: lIo

all

Mal<

on

nlle

rn():

wxF

onnl

lem

a:'J!r

.<.J;I

~~P";F

onnlle

m ~:

1.~=

I~VP

";Fo

nnll

em

~ ! ~ ~ f ~ ~ ~ [ ......

\0 -

nam

e:ch

ar

goaJ

: OxG

OAL

RCV

:dou

bIe

fCV:

Irde

aer

noAO

V: ff

ilege

r no

fDV:

Inte

ger

noRC

V: In

teger

no

tCV'

lnte

a8r

_:d

oIl

lIe

er

ror:O

xERR

OR

noC

onstr

eIrü

: Int

eger

OxP

rClb

l.m'

~

QlJl

adlv

e(RD

V: c

IouI

!!!..I

DV: "

-r):

doub

le (a

bstra

ct)

Obj

'IID

(dl!:

lnta

gIr

t1UV'

dou

bIi

IOV:

~I: do

uiM lab

eirac

t) 0b

j2nd

0(dx

;~!n

t8ge

i: dr. i

nIIiI

er, R

DV: d

oubl

e, IO

V,

,~labltract

~at

Num~

, R

OV: C

Ioub

te .. ~V

: Integ

er):

doub

le

dx: 1

nttQe

!, W

o In

teger

, t1U

V: d

oubl

e, I

' 1nt

IaIr

): d

Ouble

In

ill'llll

ltem

(Rliv

: dOu

Iiie, ID

V: In

tege

r) (a

batra

ct)

Ten

nfnl

llPio

bfer

nV: d

oubl

e, ID

V: lr

ilege

r) (a

bslra

ct)

GetG

oafO

: 0xG

0Al

!!='<h

1'RO

BLE M

ne

wEp

lilon

: dou

ble)

G

0:

c:ha

r No

ROVO

: Tnt

eger

=

:ln

teg

er

Nofc

vo9~

1nt~

Se

t(da!

8: o

?rob

Iem

Dat

a)

NoC

onatr

afnt

sO: I

nteg

er

O.o

.ta'

. I

-

--A

ppile

d by

---

resu

lt: d

oubl

e de

clsio

n re

alVal:

dou

ble

OxP

robl

emD

ata'

IntV

aI: In

teger

Q

P8I8

Ior«

(p: o

strea

m, p

: OxP

robi

emD

ata):

ostre

am

noRe

al: In

tege

r I

5eatel

neW

Dec

lslon

: OxD

ata, n

ewCo

ordi

nallo

o: O

xData

, valu

&: d

oubl

el K

>---

;;;;

;~jj

;""t

n~ot

~nt~

: lnt~eger~~ _

__

__

__

-1

Je n

oAOV

: Int

eger

, noI

DV: I

nteg

er, n

oACV

: Int

eger

, not

CV: I

nteg

er

I co

ordl

natlo

n ea

te d

ata:

OxP

rotii

emD

ata)

QIl8

rato

r«(p

: OItr

eam

, p: O

xData

): os

tream

Se

t(det

a: O

xPro

blem

Dala

) $C

reate

(noA

ealV

ar: I

nteg

er, n

otnt

Var

: Int

eger

) Ge

tVal

U~):

dou

ble

$Cre

ate(n

oRaa

IVar

: 1nI8

iiIr, I8

alD

ata:

dou

ble,

~~~

~~~~

GetD

aci

000:

OxO

ata

Scre

atal

data

: OxD

ata)

GatC

oord

inali

onO:

OxD

ata

Set

Rea

lif!

Integ

er, V

IIue:

doub

le)

SetR

DV

fror

n: In

tege

r, to:

Integ

er, v

alue

: dou

ble)

Se

tRea

l coo

ot: tm

ger,

cIata:

ibj,l

e)

Set

RD

VIX

: In1

eger

, valu

e: do

uble

) Se

tRea

l fro

m: 1

rtegI

r, \o:~, va

lue:

dou

ble)

SetR

DV

coun

t. In

tege

r, da

ta: d

oubl

e)

SetE

nt 'I

nteg

er, Y

lllue:

inte

ger)

GetR

DV :

doub

le Se

tlnt

rorn

: Int

eger

, to:

Intea

er, va

lua:

Integ

er)

GetA

OV

: Int

eger

): do

uble

Set

coun

t Int

eger

, det

a: li

dege

r) No

ADV

: Int

eger

No

RaaIO

: Int

agar

Se

tlDV

~X:

lnte

ger,

valu

e: In

teger

) No

tntO:

Tnt

eaar

Se

tiDV

from

: Int

eger

, to:

Integ

er, v

alue:

Integ

er)

GeIR

8aIO

: dOu

ble

SetlD

V c

ount

Integ

er, d

eta:

Ihteg

er)

Getin

tO: T

nteg

er

GetiD

V : I

nteg

er

Real(

ldx:

Integ

er):

doub

le

GetlO

V : I

nfeg

er):

Integ

er

Int(ld

K: In

tegeI

): In

teger

No

tDVO

: Int

eger

SatR

CV fr

om: I

nteg

er, t

o: In

teger

, val

ua: d

oubl

e)

SetR

CV c

ount

Inte

ger,

deta

: dou

ble)

Sat

RC

ViX

: Int

eger

, valu

e: do

uble)

GetR

CV :

doub

le G

etRCV

: I

nteg

er):

doub

le No

ACV

: Int

eger

SatlC

V fr

orn:

Inte

ger,

10: I

nteg

er, v

alue

: Int

eger

) Se

tlCV

coun

t: In

tege

r, da

ta: I

nteg

er)

SatfCV~X:

lnte

ger,

valu

a: In

teger

)

Getl

CV :

Inte

ger

Getl

CV

: Inf

eger

): In

teger

No

tCVO

: Int

eger

sapo

pDB

I O

xSap

opD

B'

- ~ :> I rn ~ j' ~ !t ~ i :r

I O

xNLP

robl

em'

no~str. in

tege

r no

Co

nstr.

inte

ger

~~~~

~~~:

rint

eger

st

a~Bo

unds

: in

tege

r en

dBou

nds:

inte

ger

maxHu~: d

oubl

e

T~(): O

xPRO

BLEM

t"'tconstrBou'1:.t:c~~~ ~

~~~! up

perV

alue

: dou

ble,

In

itVa

rBounds(sla~ID:

inte

ger,

coun

t: In

t::t

cis

Iow

erO

eclsi

on: d

oubl

e, u

pper

. i

on: d

oubl

e)

No~stm: in

tege

r No

Co

nst

: inte

ger

NoL

TCon

str

: Int

~r

NoCo

nstr

aint

s~ I ~r

NoA

llCon

stra

in W

:: In

eger

G

etTr

r.(co

nstri

: i

nt~e

rl.:

OxC

ON

STR

AIN

T C

hec

onst

~Dlc

onst

~ :

nteg

er)

ISSl~eConstra'"t(const~D: in

=:

BooI

Che

c E~

uaJC

onst

rain

ts~D

V:

e ID

V: In

tege

r): B

ooI

Che

ckln

~Co

nstr

ain

fRDV

: dOO

bIe, I

DV: I

nteg

er):

Bool

C

onst

raln

t Ifn

stdD

: Int

eger

, RDV

: dou

ble,

iD

: in

tege

r): d

oubl

e rs

tra

ct)

cons

lCor

elst

D~x:

inte

ger,

cons

trl

: inte

ger,

RDV:

dou

ble,

10

: in

t~er

): d

oubl

e (a

bstra

ct)

ConSlC

Ore2

nd~X

: In

~er

, ~: in

tege

r, co

nstrl

D: i

nt~e

r,

R v

: dou

e,

I v:

inte

ger):

dou

ble

labs

ract

) co

nstr

alnt

~oon

stdD

: in

tege

r, RD

V: d

oubI

'lIID

V: in

l::,y

:r): d

oubl

e Co

nst1

stD

dx: I

nteg

er, c

onst

dD: i

nteg

er,

DV: d

oub

, I

V: in

tege

r): d

oubl

e Const2ndD~dx:

Inte

ger,

'\Y; in

t:l/:r

, oon

stdD

: int

eger

, DV

: dou

ble,

V:

"' e

ger):

dou

ble

Con

slCor

elst

Num

Jdx:

int

~r, co~"D: inl~

R V

: dou

, I

DV: I

nteg

er):

bio

Cons

lC0r

e2nd

Num

JdlC

in~

er, d~

Inte

ger, const~D: in

tege

r, R

V: d

oub

e, 1

0 : i

nleg

er):

doub

le

'T-"

~~

rJ=r

s : :J:

::,er.r

Get

Low

erVa

r : d

oubl

e G

etU

pper

Var

d: in

tege

r: do

uble

G

ello

wer

Var

Id: i

nteg

er!:

doub

le

IsBoundedCons~const"D: In

tege

r): B

ooI

NoC

onst

rBou

nd

: Int

eger

G

elC

onst

rID():

inte

ger

Gelupp

etco

nstr

~: d

oubl

e G

elLo

weo

Con

str

: dou

ble

Gel

Low

eoC

onst

r Id:

inte

ge&

dou

ble

Get

Uppe

oCon

str i

d: int

~r :

doub

le

SelM

appi

ng(m

appi

ng:

x AP

_BO

UNO

S)

I O

xPro

blem

' I

/\

1 I

OxQ

uadr

atic

Pro

blem

' O

xUnC

onsl

rllln

edP

robl

em'

right

Side

LT: d

oubl

e rig

htSi

deLE

: dou

ble

Scre

ateß

se

re_t

eß

Type

O:

xPRO

BLEM

Ty

peRl

l: xP

ROBL

EM

Get

gh

tSid

eL T8

: dou

ble

Get

Rig

htSi

deLE

: d

oubl

e

OxN

etw

ofkP

rebl

em'

Oxl

inur

Pro

blem

'

right

Side

: dou

ble

Scre

ateß

S

crea

teß.

Ty

peO

: PR

OBL

EM

Type

O:

xPRO

BLEM

G

etRi

ghtS

ldeO

: dou

ble

OxB

ound

lng'

boun

ds

noVa

lBou

nds:

inte

ger

varlD

X: In

tege

r

:.~~

~:=r

Io

werV

ar. d

oubl

e no

Con

strB

ound

s: in

tege

r oo

nstd

DX: i

nteg

er

oons

tdD:

inte

ger

uppe

oCon

str.

iloub

le

Iow

erC

onst

r. do

uble

Scra

ate(

varB

ound

s: in

t::?3

rl co

nstrB

ound

s: in

tege

r) In

HCon

strB

oun~

"':.

:I~~

:! up

perV

aJue

: dou

ble,

InHV

arBo

unds

(sla

~ID:

inte

ger,

coun

t: in

tege

r, Io

werD

ecisi

on: d

oubl

e,

~o1)

ecis

ion:

dou

ble)

N

oVar

Boun

ds :

inte

ger

Get

Varie

blel

O :

int:'

J:r

Get

uppe

rVal

dou

e

Get

Low

erVa

r : d

oubl

e G

etU

pper

Var I

d: in

tege

T do

uble

G

ello

wer

Var

d: I

nteE

r : do

uble

Ge

tUpp

erFr

omVa

~D v

aliD

: int

eger

: dou

ble

Get

Low

erFr

omVa

dD va

~D: int

eger

!: do

uble

N

oCon

strB

ound

s{):

inte

ger

Get

Cons

trlDO

: int

eger

G

etup

petc

onst

l ijo

uble

G

etLo

weoC

onst

r : d

oubl

e G

etLo

weoC

onst

r Id:

inle

ger!'

dou

ble

Get

Uppe

oCon

str i

d: int

~er

: dou

ble

Get

Low

erFr

omC

onst

llD C

onslr

lD: i

nleg

er :

doub

le

Get

Upp

erFr

omC

onst

llO C

onst

rlD: I

nteg

er!:

doub

le

1 O

xSap

opP

robl

em'

üloN

ame:

eha

r de

cisio

n: d

oubl

e tra

nslo

nnat

ion:

inte

ger

objF

unc:

dou

ble

grad

Obj

Fune

: dou

ble

$create~robiemName:

chor

, dat

abas

e: O

xSap

opDB

) Ty

peO

: xP

ROBL

EM

setL

ower

V:;ft

d: in

tege

r, va

lue:

_e

i Se

tUpp

erV

id: i

nm

r, va

lue:

dou

ble

SetT

rans

lonn

atio

nC :

inte

ger,

valu

e: in

tege

r) G

etSa

poP,

Fde$

: tha

r O

bm:M

iJR

D :

doub

le o IDV

: int

eger

): do

uble

O

b IstD~lC in

tege

~ R

V: d

oubl

e,

I V:

Inte

ge :

dou

ble

Obj2n

dD&d

lC In

tege

r! ~n

tege

r, R

DV: d

oubl

e,

I V:

inte

ger:

ble

Cons

trai

n!Co

'rJo

onst

~D:

inte

ger,

RDV:

dou

ble,

I

V: in

tege

r): d

oubl

e Co

nstC

oret

stD~

x: in

tege

r, oonst~D:

inte

ger,

RDV:

dou

ble,

10

: in

t~er

): d

oubl

e co

ns!C

ore2

nd~x

: =, r

tJ.: in

tege

r, co

nstd

D: I

nteg

er,

R V

: ,I

V: i

nteg

er):

doub

le

~~::::;~=~'!~::I.~lnteger)

GetP

robI

e~

Get

Sapo

p 0:

OxS

apop

DB

1 proble

mDa

ta

/sap

opD

B

L OxP

robi

emD

all'j

I OxS

apop

DB'

I

~ § QQ

~ ~ S? 1 !t ~ * g g. ~

IN

~: O

xPRO

BLJ:

M

riORD

V: Inle

ger no

IOV:

Inl8

gBr

OxP

rope

rly'

noR

CV:

lnIeger

nolC

V: In

lege

r no

EQC

onsl

l: In

Iege

r no

lECo

nsIr:

Inle

ger

nolT

CCln

slr.ln

!eöe

r no

VIII

Ioun

dI: I

nfege

r no

Con

strB

ound

s: Irl

Iege

r

node

: Nod

e no

Elem

enls:

InIa

ger

prop

ertie

s

cons

llf'ro

pertl

es

In8e

rt(aN

ode:

Nod

e, I

valu

e: ln

)ege

r): N

ode

objP

rope

rtles

Fl

nd(a

Nod

e: N

cXIe,

va

lue:

inle

ger):

600

1 $c

reaI

eO

In8

8l1

m-O

xPRO

PERT

Y)

Con

l rIy

: OxP

RO

PER

lY):

6001

Em

plyO

:

OxD

elcr

lpllo

n'

nam

e: c

har

prob

lem

CODE

: cha

r ex

ecul

able

: cha

r 90

81: O

xGO

AL

synl

axEr

ror:

6001

st

alus

: OxS

TAlV

S $n

ameU

m: w

xSlrl

ngU

sl

$cre

ale(

fIIeN

ame:

cha

r) Ty

peO

: DxD

ESC

RIP

TID

N

Git~Tab(): O

xSvm

bolT

able

sa

l$Ym

bclT

lble

(tabl

e: O

xSym

bolT

able

) Se

lN"a

me~

ring:

cha

r) G

eINa

m

: cha

r Se

lF~1

e si

ng:

char

) G

eIAl

e :c

har

$IsU

m

e(slr

ing:

cha

r): 8

001

SelG

oaIO

odo:

OxG

DAL

) Se

lTYI

J8(Ih

eTyp

e: O

xPRO

BLEM

) sa

lOtije

cllYe

Prop

ertle

s(pr

oper

ty: O

xPro

pe~S

eI)

salC

oilsl

rPro

pertl

es(p

rope

rly: O

xPro

perIy

S8l)

GeI

PlO

I!!Irl

yO: O

xPro

perty

Er

ror()

: -- a:

lged

: 600

1)

GeI

Sial

usll:

OxS

TAlV

S

~O: O

Xbes

crlp

llon

PaIle

{errS

iream

: ost

raam

) G

ener

atat

desll

nallo

n: c

har

errS

lraam

: oSl

raam

) BU

IId(d

esiln

allo

n: c

har,

err$

iraam

: oslr

aarn

)

OxD

ESC

RIP

TlO

N'

~O_DESCRIPnON: e

num

PT

IXJI

I: en

um

APO

P:en

um

• •

•

sym

Tab

I sla

llRea

lOec

lDX:

Inle

ger

:::~

~!=~

~~eg

er

slartl

nlC

oord

lDX:

Inle

ger.

Inde

xNam

eLisl

: wxS

trtng

llsl

0xN

8med

Item

$ere

aleO

GeI~ype :

OxT

YPE

Pu

: OxP

URPO

SE

Gel

alu

8(ld

x: In

lege

r): c

har

~~SO

:800

1

Hash

Tabl

e

...... 'f

>

g. ~ tr1 ~ 1 g ~ @ r :r

OxH

lmtd

nem

·

ashT

able

$<>,

,10()

GttT

ype8

: o.T

YPE

P

: :

o.PU

RPO

SE

G.I

akM

(odx

: int

eger

): ch

or

~:80

01

A

0_

01

O

IV.ri

lbit

Oxl

ndex

val:

chor

de

pend

s: 8

001

nam

e:ch

ar

=:~SE

Iow:

Integ

er

$<>e

ato(v

alue:

char

) ~:

=rln

'oge

r GelValuo(Id1r:lntege~

t:: m

o.PU

RPO

SE,

: cho

r ~W'0: o

.TY

PE

$aea

te( .. lu

o: ch

or, I

ower

. Inl

eger

, ~

~: 8

001,

star

t: In

teger

) hi

gher

. Int

ege~

Go

tT

:0.

PE

GotV~In.

P ~;URPOSE

SotV

uo

: .. 1

eger

) D

epen

ds

: 800

1 l=

",le

go

r Ch

ock1

n 1(

P: Integer~,

H~h

: Inl

eger

p:

chor

, p:

: 800

1 N

ameO

:"""

r Ch

ockI

nllel

(p: I

nteg

er, p

: ,p

: Int

eger

, G

o=

s:o

.TY

PE

p:

Integ

er, p

: cho

r, p:

Integ

er):

8001

Pu

: o

.PU

RPO

SE

~:=!=:Integer)~

Prin

'O

prIn

'O

OxV

edor

0

_1

finltl

n'eg

or

1Ir_

:lnt

eger

la

st: i

nteg

er

tas'

-:ln

loge

r

$<>oo'tC.~~"?:E'I:::'~;:"

=.~:

= Sl

an: 1

n000

0r)

$aea,o

(=: O

IPU

RPO

SE, d

epon

ding

: 800

1, Fi

rsl~

:lnt

eger

fin

it El

em: 1

n1og

er!a

':"Ro

wEI

o'!': i

noog

er,

1Irst

CoIE

1om:

Integ

er,

tCoI

Elem

: Wlte

ger,

:;:'

~~,:

Integ

er, 1

ndex

2: in

1ege

r, st

art I

nteg

er)

nam

e: ch

or, N

ne: I

nteg

er)

Firsl

Row

8: in

tege

r Ch

ockI

nlle

l(lIre

lEle

men

t Int

eger

, Ias

tElo

men

t Int

eger

, la

s'Row

: In

teger

na

mo:

cho

r, Nn

e: lritege~:

8001

a:

inte

ger

Go

=:o

.TY

PE

la

s : i

ntog

er

Ma

urne

n ...

... :

In~ 1d

1lPtr:

Oxl

nlle

l,

I~=r

nam

e:ch

or,

:1n~OxArgumenl

Mak

eArg

umen

.lnde

lOO

: in~~:

um.n

t No

Eio

: Int

eger

G

o'Ran

go(ln

de ..

. : In

'eg.

~:

lege

r la

s'lnd

ex :

' pr

intO

Inde

xEno

r ~ Inle

ger,

mex

2: in

tege

r, In

dox3

: Int

eger

, Ind

ex.:

Inleg

er,

Chec

Wnll

e~~:

'~='

~~~

inOeg

er,

~m~\~'!~:-::r:rr~;'

~l.r

le~,

::;,

:~,:

Inoog

er, Id

llPk1

: Oxl

ndex

, va

lue2

: int

eger

, kb:

ptr2

: Oxl

ndex

, na

me:

cha

r, lin

e: in

C~er

): O

xArg

umen

l

~:~'

:=~~

':l"

~~er

xArg

umen

, pl

in'O

OX

Sym

botT

....

. •

--tso

anRo

oIO

ocIO

X: I

nteg

er

soan

lndl

eclO

X: i~

.tanR

oolC

oord

IOX

: "le

ger

starti

ntCo

ordl

OX

: ln!

090r

ln

d.xN

amet

Jst:

wxS

Iring

lisI

$aea

te(k

eyTy

pe: u

nsig

ned,

oIZ

t: In

tege

r)

Add

ConS

Ianl

(nam

e: ct

iar,

....

. : ~L .

MdV~:~_:OiPURPOSE,

MdV~:=:t:r"~~~r)

Ad

dM

aIri

= ch

or, 1

JUI1I

CI8O:

OxPU

RPOS

c. 1d

1l3: In~id~~\,=' ld

x2: I

nlegO

r, A

ddln

llex(

nam

e: di

or,ld

x1: _

, 1d

x2: I

nteg

er)

Add

lnlle

x(na

me:

chor

, Ind

ex: o

.lnlle

l) G

oISw

nCou

a$'1n

Iogo

r G

eISu

mNa

0:

1nIo

tjer):

chor

N

oR

oo

m'

Nolnt

OocO

: No

RoalC

Oord

O: In

tege

r No

InIC

oord

O: ln

o_

So

Ilnlle

x(pu

ipoo

o: o

.PU

RPO

SE, n

oE

_:

Integer

) G

olSl

ortln

llel(p

urpo

se: o

.PU

RPO

SE):

inIe

g«

Rem

ove(

nam

e: cti

IIIr)

r,o=~':;)~J::.tem

Fi:=

!:::rp

oso(

nern

e: ch

o~ O

IPU

RPO

SE

=r.:.tl=,;,:o:t.v~,

Indo

x .. :

Inte

ger,

vaIu

o: cho

~ PrintlnllV.~_m:_)

OIV

.1uI

UII

'

Inlll

i.,

~"?-

..O:

OxPU

RPO

SE,

VÜ

Hi:

OxV

alue

)

Fka'= o

.PU

RPO

SE)

PrIn

'(OUO

Skea

m: .

....

m)

ris'

OxV

llue'

IdxO

!Dim

: Int

eger

ra

ng.:

tnoeg

or

valU

e:ch

ar

I iriI

TIII>

Ie

$cre

aIo(

ldx:

inte

get',

_Val

uo: c

hor)

$ata

to(d

inon

sion

: inI

eg«,

=~i

GelV

aluoO

:chor

Se

tval

ue(n

amo:

cha

~ Pr

inI!lM

rrP: O

xPU

RPO

SE,

Ou

t_m

: OSI

ream

)

i OQ

1I1 ~ 9- d'J

~ ~ ft ~ [ ... ~

196 Anhang E. OMT-Diagramme der Workbench

~r

I

T

TI .

. T1I

1e·

1 he

oder

: cha

r

OdI

allE

dlto

r'

1nitF

n ...

• $c

reat

e{pa

rent

wxF

ram

e. x:

~teger.

1. in

teger

, W

IdIh:

Integ

er. h

eIgh

t IM

!Oge

r. sl)

1o: i

onQ.

I m

y11d

e ce

nter

. Boö

I. O

lme:

c:II.~

"" ..

18

(a_

: ()x

Lang

uall'!

. PI-

wxFr

ame.

x: In

teger

. y: N

I •• _

: in

tege

r. he

ight

integ

er. s

fyte

: Ion

g. c

onIe

r: Bo

ot.

nam

e: c

hor.

cmd:

cha

r)

""oo

le{p

oren

t wxF

llme.

1I1Ie:

c:IIa

r. x:

Integ

er. y:

integ

er.

_: in

tege

r. he

lght

in!O

ger)

$aoote~: O

xI.an

guag

o,pa

rerrt

: wxF

llme.

1I1Ie:

c:IIa

r. x:

infe

!jer.

y: Nl

Ieger.

_

: In

teger

. hel

ght I

nleg

ir)

=01=

oene

llliC

cxle

"8'la

bslra

ct)

1sM

cxifi

ed()

:iic\

lJ'ab

slllc

t)

r O

xSap

clf>

Ecl

tor'

""e

.II(

_: Ox~. P

lrent

wxF

ram

e. til

le: C

hll.

x: in

!ege

', y:

int.

r,

_: In

teger

. helg

ht: i

nteg

er)

=

Parae

O G

ontrI

teC<

ldeO

G

ener

steEx

ocO

1s

Mcx

ified

(): B

oot

edito

r

:&m

a:n

d(c

om

ma

nd

ID: in

logo~

SetT

ex1(

or: w

xSlrf

nglJs

t)

5to

:oot

rnm

) : B

oot

o : in

tege

r 10 i

nltW

indow

[

OxT

I'"

I

I pr

oble

m I

Ox

Lan

g-'

l l

OxE

dlto

r' !h

ePro

blem

• p

robl

em

i:~

. ...,,::7]~ I

wxW

IndOw

: myW

indo

WI(t

O)

$aea,-=.:~r,,=twxF""',

nda

Dei W

iI100

w

Ons~=~n~~in=

OnM

enU

Com

n::rc

omm

ancld

: int

eger

) V

ariab

le De

I ~

~P.noI

=

defp

anel

~ _

__

..J

PaIIe

O O

ener

ateC

odeO

Generale~

isMod

iIiedO

: Boo

t ~~~~~integer

WlP

lneI

fc

.-co

nste

nt D

ei:

.;..

LI _

__

~

prob

lem

I ~"~ItIon'1

errw

In

Show

Pars

erEn

or()

~~~~,bing: ch

ar):

c:IIar

t:~~t~ ~h

':ß'~:

c:IIar

k>

M ....

ge W

lndo

'" I O

IE""

,T ..

. • I

Enor

Msg

(msg

: c:II

ar)

rnyc

r;wnm

andS

tr: c

har

hNde

r. ch

ar

linIe

:inte

ger

writ

tenl

.inös

:lnte

ger

"ag:

Boo

t

: 11.'r'

_: in

Iogo

r. he~t Int

ege~

.: Boo

t) _te

(par

ant w

xFIIm

e. x:

inte

ger.

=rg~.

Erro

rMog

(p: c

:IIar)

OxD

ofin

ltlon

·

$aea

te(p

robl

em: O

xlan

gueg

e. p

anet

wx~nel.

!une

: wxF

uncI

ion.l

obei:

cha

r. vi

i ... : c:IIa~'n~:'~.r N

ltege

r. w

idIh

: Int

eger

. he~ in

teger

.

cErro

rTex

t) ,r)

'iMg(n

....ir

~r.lle

hra: i

nt~: Bo

ot

~:"".J

'(~,~:

t2

Erro

IMsg

(.tr:

c:IIar

) Se

tT ex

t(jl: wx

Stri

ngL~

t)

WriI

e(p:

ootre

am)

>

:;I [ O

Q trJ ~ 9- ~ I !t ~ [ ~

198 Anhang E. OMT-Diagramme der Workbench

OxDescription* DBINP*

name: char LCORE: integer problemCODE: char

executabIe: char NST AT: integer goal: OxGOAL LSTAT: integer syntaxError: BooI status: OxSTATUS $nameList wxStringUst

$creat~Name: ~ ~: ESCRI N

ymTabO: O~bolTable OxSapopDB* §etSYmbolTable( : OxSymbolTable)

SeINit;\)tring: chilr) IogicalUnit: integer GetName : chilr

~~~r) ~blemName: Char GetFile : chilr IeName: char $lsi strin : char): BooI isOpen: BooI

~E: AL~ $zero: integer SetT !heT : OXP OBLEM) sone: integer SetO· . ~s(prope% OxPropertySet) $two:in~ SeteonstrProperties(property: PropertySet) $OxPutl: r GetPrCJI)ertyO: OxProperty $IOUT:char ErrorQ: Bo6I $OxPutD: char

=::Pchanged: BooI) $ROUT: char $OxGetl: char

ISModifi~BooI $lIN: char GetStatu : OxSTATUS $OxGetD: char Cop~: 0 scription SRIN: char Parse errStrearn: ostrearn)

Initialize(problem: OxProblem) Generate(destination: char, errStream: ostream) Build(destination: char, errStream: ostream) DBlnit(unit: integer, cprog: chilr, type: integer,

name: char)

~ DBExit(unit: integer, cprog: char) $create(newNarne: char,

newChannei: integer, newDB: BooI) OxSapop* D=cprog: cha~ o cprog: cha

channei: integer Putldata: ::' ftag: char, from: integer, count: integerl Put data:. ' fl~ char, from: integer, count: integer transformation: integer sapopDB Text~: Integer, ta: char,

$create(fileNarne: charlm : integer, count int~r, Hag: char) 1=' "''''''. ~' ..... --'I TypeO: OxOESCRIPTI Ge data: e, fta!fi char, from: Integer, count: Integer SetLOwerVa~id: integer, value: doublel Pul data: OxProbferri ata~ SetUpperVa Id: int:fn' value: double G data: OxProbiemData SetTransformation(" : integer, value: integer) Ge 9ioechar GetSapop~: char GetSapop 0: char GetSa~ OxSapopDB Cop~: ription Parse errStrearn: ostream)

OxProbfemData*1 Ge.nerate{des!ination: char, errStream: ostream) Buikl(destination: char, errStrearn: ostream) probiemData

Anhang E. OMT-Diagramme der Workbench 199

-tim

er

~BooI

runn

able:

Boo

t _

:ch

ar

algo

rllhm

FlIe

:cha

r

I OIAIg

orI .

... DI

I aJgo

rtlvn

llB

E

,=--

, ~

,1

-,

:iL_

IOOi

lndex

: Inl

egel

f I $c

raat

o(hm

e: w

xFlam

e, liI

Ie: c

hal,

x: ln

iege

l. w_

~ame a'

lnt erl

~~,h:lntegerl

. _

._i1

ch

: OxW

örl<

8enc

h)

GetW

):~

sotC!'!.!!\~ o

xCan

vaa)

GotC~~nvu

g::c~ Jet.

ille

gel

Task

Ora

w(dc

: ~. nam

e: ~"

BIa

ckboa~

I:rIlC

TWx~nl

....l:

char

, na

me2

: c:h

ar. x

: 1nJ

eger

, y: "

1ege

I)

Que

ueCr

aw(d

c: wx

DC. n

ame:

chal

,

la!!ll

ndex

: lnJ

eger

~ame

ooni

lolll

l $

craa

l8(p

rira

nt_

.x: =in

I_, ~=~~~

.-_--tI~~BooI):

SatF

lam

o(aF

....

. : _

mo

) So

tCan

vai(I

Can

vu: 0

xC ..

....

)

~~~~

~'"T:.:kc~IegeI.y.inIogor)

RC

on

.-o

r.w

(dc:

wxD

C. x:

Integ

er. y

. _)

MSC

onno

ctor

llraW

(dc:

wxD

C, x:

1nJe

ger.

y: lr

i_)

g~t'~~)

visua

lCan

vas

xpoo

: fto

at

r=.::'in

IIger

~

U80

8

0xI'n

IeH

I'

~char

L;=.

:====

=--' _I

errar:

OlI!

RAO

II lu

L

OI=:J.~~ ..

llau:

inIIg

er

1~~TIO:inIIger.

, 'u

L

4~~OIcMESSAGE)

,-;:;=

=:=.

101

'iiio'Q

.ToI

IMES

SAG

E I..

=):

1n

\I!g

Ir

$cr

aato

(_: w

xFllm

o x:

'"'"

-

~e w

:::r=

;;;!·r

.iI'-,

.~;.~;

;=

x:ft

oaI;

y.~k

oya:illegor)

SM

Lo

adVO

S Q

ngIo

tj 'ln

Jege

rk

I ...

.-=~-

~~'"'m

'US

r execF

lm

od.is

t 1~ .. ~:'

=:"t.:

;.,o.:

t=-...

..,...

......

.....

1!II!cId

IOIOd(x:

~y: ...

.. _

'1

wr

iIIICn

t.......

. ~.>i

:x:.IIoo

~y.iIooI

I :O

xBla

cidl

oard

) ln

\I!g

Ir

.~~~

SatT*iib~

wxlao

ia;;r

Ist

_ r:n

anag

os

VJsu

aI op

tIIIII

Za1I

On

Sche

mas

acIiv

IVO

S

OxP

robi

emD

atl·

dala

~ame

llisu

alCan

vu

canv

uObj

ect'

CUen

tDat

a ~ew '

• ob)

ect

8 >

50

~ tr1 ~ s:1 1 ~ ~ ~ t g.

!!!!

! ZE

HN

STA

B

Ipre

p7

Ipnu

m,n

ode,

I Ip

num

,ele

m,l

Ipnu

m,k

p,l

Ipnu

m,li

ne,l

Ipnu

m,a

rea,

l Ip

num

,vol

u,I

Ipbc

,all,

l !Jß

utJ,\'m

cc::::

:;::::::

u: St

aebe

ccx:::

:co::cc

::xm:::s

!JX::X

.VN.\'

et,l

,8

mp,

ex, I

,210

000.

0 m

p,nu

xy, I

,0.3

r,

l,al

r,2

,a2

r,3,a

3 r,4

,a4

r,5,a

5 r,6

,a6

r,7,a

7 r,8

,a8

r,9,a

9 r,l

O,a

lO

1::C

CXXl

\'co.

\';\,X

X::X

II" K

eypo

ints

###

If##X

XXCI

::mC:

JCIIt

r\' k,

I,O,3

60

k,2,

360,

360

k,3,

720,

360

k,4,

720,

O

k,5,

360,

O

k,6,

O,O

r::X::N

t',VJJ

IYXJ

JCJX

I

...... lV

nn ..

t'JV

' ...

....

. •

type

I

HU S

taeb

e g

w .. ·

·· ...

. es

ize"

I ...

.... il

\l\i ..

.. JiW

JW

mat

,l re

al,l

1,1,

2 Im

esh,

l re

al,2

1,

2,3

Irne

sh,2

re

al,3

1,

3,4

Imes

h,3

real

,4

1,4,

5 Im

esh,

4 re

al,5

1,

5,6

Imes

h,5

real

,6

1,2,

5 Im

esh,

6 re

al,7

1,

2,6

Imes

h,7

real

,8

1,1,

5

Imes

h,8

real

,9

1,2,

4 Im

esh,

9 re

al,lO

1,

3,5

Imes

h,lO

11

t:::::u

:::m:xI

IJJ(J(

(j' R

andb

edin

gung

en :;:

:t'XIJ:

::WX:W

ns

el,S

,loc,

x,O

d,

all,a

ll

Die

Wer

te d

er A

nsys

His

tory

-Dat

ei f

ür d

en Z

ehns

tab:

"te

nb.h

is"

!II""

XXXU

I((fX

####

Las

ten

""lfX

JlX::X

XXXJ

Jx::x

x:raa

« ns

el,S

,loc,

y,O

ns

el,U

,loc,

x,O

f,a

ll,fy

,-IO

OO

O

nsel

,all

fini

!#X,V

t'JJ::

N.\',W

II:IJIO

OXX

Loe

sen

Isol

u so

lve

fini

!:JJt:

t r'wax

::xx::

,\'C::U

(r'llJr

VX.\'x

::,.,xa

:::uc::

::::::X

X:: x:

: J:lC J(

# lpos

t!

set

etab

le,w

ork,

ls,l

*get

,sO I ,

elem

, I ,e

tab,

wor

k *g

et,s

02,e

lem

,2,e

tab,

wor

k *g

et,s

03,e

lem

,3,e

tab,

wor

k *g

et,s

04,e

lem

,4,e

tab,

wor

k *g

et,s

05,e

lern

,5,e

tab,

wor

k *g

et,s

06,e

lern

,6,e

tab,

wor

k *g

et,s

07 ,e

Iern

, 7 ,e

tab,

wor

k *g

et,s

08,e

lern

,8,e

tab,

wor

k *g

et,s

09,e

lern

,9,e

tab,

wor

k *g

et,s

lO,e

lern

,IO,e

tab,

wor

k !e

son,

etab

,wor

k,O

,O

!*ge

t,max

sax,

son,

O,m

ax

!*ge

t,min

sax,

son,

O,m

in

getv

olu

volu

men

=tot

volu

fin

i

> =

=- = =

(Jej

~ ~ i ~ s ~ =

== •• ... ~ B

INO

PR

$H

EA

DE

R

6 A

6 I

·SE

T,A

l ,

60.0

0000

0000

00

$AL

GO

R 0

0001

(X

6)

1.0

·SE

T,A

I0

, 10

.000

0000

0000

I

GR

EG

A 0

0100

7

A7

I ·S

ET

,A2

, 10

.000

0000

0000

IP

AR

3

5 (X

7)

1.0

·SE

T,A

3 ,

10.0

0000

0000

00

$ST

RA

N 0

0001

8

A8

I ·S

ET

,A4

, 40

.000

0000

0000

I

AN

SYS

tenb

(X

8)

1.0

·SE

T,A

5 ,

90.0

0000

0000

00

RST

AT

1

21

9 A

9 I

·SE

T,A

6 ,

10.0

0000

0000

00

$DE

SIG

N

(X9)

1.

0 ·S

ET

,A7

, 50

.000

0000

0000

I

1.00

0 0.

0000

10

000.

0 0

10

AIO

I

·SE

T,A

8 ,

60.0

0000

0000

00

2 1.

000

0.00

00

1000

0.0

0 (X

10)

1.

0 ·S

ET

,A9

, 60

.000

0000

0000

3

1.00

0 0.

0000

10

000.

0 0

$DE

FC

ON

0002

0 IG

OP

R

4 1.

000

0.00

00

1000

0.0

0 I

STA

TE

_MA

X

250.

00

5 1.

000

0.00

00

1000

0.0

0 2

STA

TE

_MA

X

250.

00

6 1.

000

0.00

00

1000

0.0

0 3

STA

TE

_MA

X

250.

00

7 1.

000

0.00

00

1000

0.0

0 4

STA

TE

_MA

X

250.

00

8 1.

000

0.00

00

1000

0.0

0 5

STA

TE

_MA

X

250.

00

9 1.

000

0.00

00

1000

0.0

0 6

STA

TE

_MA

X

250.

00

10

1.00

0 0.

0000

10

000.

0 0

7 ST

AT

E_M

AX

25

0.00

$D

EF

OB

Jooo

ol

8 ST

AT

E_M

AX

25

0.00

I

STA

TE

_MIN

V

OL

UM

EN

9

STA

TE

_MA

X

250.

00

$L1N

DE

SOO

OIO

10

ST

AT

E_M

AX

25

0.00

1

AI

I 11

ST

AT

E_M

IN

-250

.00

(Xl)

1.

0 12

ST

AT

E_M

IN

-250

.00

2 A

2 1

13

STA

TE

_MIN

-2

50.0

0 (X

2)

1.0

14

STA

TE

_MIN

-2

50.0

0 3

A3

I 15

ST

AT

E_M

IN

-250

.00

(X3)

1.

0 16

ST

AT

E_M

IN

-250

.00

4 A

4 I

17

STA

TE

_MIN

-2

50.0

0 (X

4)

1.0

18

STA

TE

_MIN

-2

50.0

0 5

A5

I 19

ST

AT

E_M

IN

-250

.00

(X5)

1.

0 20

ST

AT

E_M

IN

-250

.00

$EN

D

Ans

ys P

aram

eter

-Dat

ei:

"ten

b.pa

r"

Ans

ys S

teue

rdat

ei f

ür d

as O

ptim

ieru

ngsm

odel

l: "

tenb

.OP

T"

------------

SOl

S02

S0

3 S

04

SOS

S06

S0

7 S

08

S09

SIO

SO

l S

02

S03

S

04

S05

S

06

S07

S

08

S09

S

10

N S f :-n i ~ g I;d ~: ~

I!!!!

ZE

HN

STA

B

Ipre

p7

Ipnu

m,n

ode,

I Ip

num

,ele

m,l

Ipnu

m,k

p,l

Ipnu

m,li

ne,l

Ipnu

m,a

rea,

1 Ip

num

,vol

u,l

Ipbc

,a1I

,1

!OO:

:,\',VJ

JJJc

:a'cu

::C;:#

N St

acbe

/Jr\'(

(JWOU

,vl:m

::u;.y

.\'JJ#

#1t#

et,l,

S

mp,

ex, I

,210

000.

0 m

p,nu

xy,I,

O.3

r,

l,al

r,2

,a2

r,3,a

3 r,4

,a4

r,5,a

5 r,6

,a6

r,7,a

7 r,S

,aS

r,9,a

9 r,l

O,a

lO

'#lYt

tI\'Jfl

ßNUJ

JXNU

.V.\'

Key

poin

ts m

:::.\',\

'X,VC

INUX

XJJJ

IJOXJ

J k,

I,O,3

60

k,2,

360,

360

k,3,

720,

360

k,4,

720,

O

k,5,

360,

O

k,6,

O,O

IXffX

C:XX

Oo'XJ

tJ:CU

:X::

Stae

be #

l###

XXX:

:::XI

JXJJ

rVNX

::XNf

t ty

pe,l

esiz

e .. 1

m

at,l

real

,l 1,

1,2

Imes

h,l

real

,2

1,2,

3 Im

esh,

2 re

al,3

1,

3,4

Imes

h,3

real

,4

1.4,

5 Im

esh,

4 re

al,5

1,

5,6

Imes

h,5

reaI

,6

1,2,

5 Im

esh,

6 re

al,7

1,

2,6

Imes

h,7

real

,S

1,1,

5

Imes

h,S

reaI

,9

1,2,

4 Im

esh,

9 re

al,lO

1,

3,5

Die

Wer

te d

er A

nsys

His

tory

-Dat

ei f

ür d

en Z

ehns

tab:

"te

nb.h

is"

Imes

h,lO

!J:

XXtJC

l.\';JO

JIJJJI

I:CJJC

C R

andb

edin

gung

en #

JIIJII

IIICIO

M##

ns

el,S

,loc,

x,O

d,

all,a

ll !X

.\',VJ

JJJN

nX.1x

xt'lIl1

Las

ten

xxn:

:::s:::C

::OOX

I:XCl

IIJ:n

::A'

nsel

,S,lo

c,y,

O

nsel

,U,lo

c,x,

O

f,all,

fy,-I

OO

OO

ns

el,a1

1 fin

i !JJ

I:X.\'O

OXXN

,\'nXX

n::x

Loe

sen

XJlIC

OOtIJ

OlJlf

XU::X

XCIII.

1CC:

; Is

olu

solv

e fin

i IX

NXIJJ

J.'::X

XXJJ

IJ,VO

IJJt:C

lIJ.'X

,JXOn

X##X

XIJ:I

A'XI

I::XOO

UIIX

Ip

ostl

set

etab

le,w

ork,

ls,l

*get

,sO

I,ele

m,I,

etab

,wor

k *g

et,s

02,e

lem

,2,e

tab,

wor

k *g

et,s

03,e

lem

,3,e

tab,

wor

k *g

et,s

04,e

lem

,4,e

tab,

wor

k *g

et,s

05,e

lem

,5,e

tab,

wor

k *g

et,s

06,e

Jem

,6,e

tab,

wor

k *g

et,s

07,e

lem

,7,e

tab,

wor

k *g

et,s

OS,

elem

,S,e

tab,

wor

k *g

et,s

09,e

lem

,9,e

tab,

wor

k *g

et,s

I O,e

lem

,l O

,eta

b,w

ork

!eso

rt,et

ab,w

ork,

O,O

!*

get,m

axsa

x,so

rt,O

,max

!*

get,m

insa

x,so

rt,O

,min

ge

tvol

u vo

lum

en=t

otvo

lu

fini

i !TI [ [ ~ Ir

::s !:Xl

!!.

~ t 8

204 Anhang F. Quelltexte zu den Beispielen

OpTiX-ID Problembeschreibung des Zehnstabsystems

problem "ZEHNST': constants

e=210000.0; forc=IOOOO.O; ro=1.0; xl=360.0; sigmax=250.0; sigmin=-250; sqrt2=1.41421356237309504880;

decisionvars realvar

x[IO];

objective min sum(i=I .. 6:ro*xl*x[i])+sum(j=7 .. 1 O:ro*xl* sqrt2*xU]);

eonstraints

1************ DEL 10 = -fore*xl/e*(l/(sqrt2*x[2])+ lI(sqrt2*x[3 ])+21x[lO]) DELI I = xl/(2.0*e)*(lIx[2]+ IIx[4]+ IIx[6]+ IIx[3D+xl*sqrt2le*( IIx[9]+ IIx[1 0]) DEL20 = fore*xl/e*(3/(sqrt2*x[5])+4/x[8]-II(sqrt2*x[l])) DEL22 = xl/(2.O*e)*(l/x[ 1]+ IIx[5]+ lIx[6])+xl*sqrt2le*(l/x[8]+ I/x[7]) DELl2 = xl/(2.O*e*x[6D DEL21 = xl/(2.O*e*x[6D Xl = (DELI2*DEL20IDEL22-DELIO) I (DELlI-DEL21*DELI2/DELL22)

(xl/(2.0*e*x[6]) * (fore*xlle*(3/(sqrt2*x[5D+4/x[8]-I/(sqrt2*x[I]))) I (xll(2.0*e)*(l/x[I]+ I/x[5]+ 1/ x[6])+xl*sqrt2le*(lIx[8]+l/x[7])) - (-fore*xlle*(1I(sqrt2*x[2])+1I(sqrt2*x[3])+21x[10]))) I «xll(2.O*e)*(l1 x[2]+ lIx[4]+lIx[6]+ lIx[3])+xl*sqrt2le*(1/x[9]+ lIx [1 0])) - (xll(2.0*e*x[6])) * (xll(2.O*e*x[6])) I (xli (2.0*e)*( I/x[l]+ I/x[5]+ lIx[6D+xl*sqrt2le*( I/x[8]+ IIx[7]» )

X2 = - (DEL20 + Xl * DEL21) I DEL22 -( fore*xl/e*(3/(sqrt2*x[5])+4Ix[8]-I/(sqrt2*x[I]» + (xlI(2.0*e*x[6]) * (fore*xlle*(3/(sqrt2*x[5])+4Ix[8]-I/(sqrt2*x[1]))) I (xll(2.O*e)*(l/x[1]+ lIx[5]+ I1 X[6])HI*sqrt2le*(lIx[8]+ I/x[7])) - (-forc*xl/e*(l/(sqrt2*x[2])+I/(sqrt2*x[3])+21x[10]» ) I «xll(2.O*e)*(l1 x[2]+ lIx[ 4]+ IIx[ 6]+ I/x[3])+ xl* sqrt2le* (1/x[9]+ lIx[ 10]))- (xl/(2.O*e* x[ 6])) * (xl/(2.0* e*x[ 6])) I (xII (2.O*e)*(lIx[I]+ lIx[5]+ I/x[6])+xl*sqrt2le*(l1x[8]+ lIx[7])) )* xll(2.O*e*x[6])) I (xl/(2.O*e)*(lIx[ 1]+ 1/ x[5]+ I/x[ 6])+xl* sqrt2le·( I/x[8]+ I/x[7])

SIGMAN(l) = (fore - X21 sqrt2) I x[l] SIGMAN(2) = (fore - XII sqrt2) I x[2] SIGMAN(3) = (fore - Xl I sqrt2) I x[3] SIGMAN(4) = ( - XII sqrt2) I x[4] SIGMAN(5) = (-3.0 * fore - X21 sqrt2) I x[5] SIGMAN(6) = (-(xl + X2) I sqrt2) I x[6] SIGMAN(7) = (X2) I x[7] SIGMAN(8) = (2 * sqrt2 * fore + X2) I x[8] SIGMAN(9) = XII x[9] SIGMAN(IO) = (-sqrt2 * fore + Xl) I x[10] ***************/

11 G(l) = SIGMAN(1) Isigmax -1.0 <= 0.0; «fore - ( -( fore*xlIe*(3/(sqrt2*x[5])+4Ix[8]-I/(sqrt2*x[l])) + I*XI *1 (xl/(2.O*e*x[6]) * (fore*xlIe*(31 (sqrt2* x[5])+4Ix[8]-I/(sqrt2*x[l]))) / (xll(2.O*e)*( IIx[l]+ IIx[5]+ IIx[ 6])+xl*sqrt2le*(lIx[8]+ I/x[7]» - (fore*xlIe*( l/(sqrt2*x[2])+ 1I(sqrt2*x[3 ])+21x[ 1 0])) ) I «xlI(2.O*e)* (lIx[2]+ IIx[ 4]+ lIx[6]+ IIx[3 D+xl* sqrt21 e*(l/x[9]+ I/x[10])) - (xll(2.0*e*x[6]» * (xl/(2.O*e*x[6])) / (xl/(2.0*e)*(lIx[l]+lIx[5]+lIx[6])+xl*sqrt2le*(I/ x[8]+lIx[7])) ) • xlI(2.0*e*x[6])) / (xll(2.0*e)*(IIx[I]+lIx[5]+1/x[6])+x1*sqrt2le*(1/x[8]+I/x[7]))) / sqrt2)1 x[I])I sigmax -1.0 <= 0.0;

Anhang F. Quelltexte zu den Beispielen 205

11 G(2) = SIGMAN(2» I sigmax - 1.0 <= 0.0; «forc - «xV(2.O*e*x[6]) * (forc*xVe*(3/(sqrt2*x[5])+4Ix[8]-I/(sqrt2*x[I]))) I (xV(2.O*e)*(l/x[l]+l/x[5]+ I1 x[6])+xl*sqrt2le*(l/x[8]+l/x[7])) - (-forc*xVe*(l/(sqrt2*x[2])+I/(sqrt2*x[3])+21x[lO]))) I «xV(2.0*e)*(l1 x[2]+ I/x[4]+l/x[6]+l/x[3])+xl*sqrt2le*(l/x[9]+ I/x[IO])) - (xV(2.0*e*x[6])) * (xV(2.O*e*x[6])) I (xV (2.O*e)*(l/x[I]+l/x[5]+l/x[6])+xl*sqrt2le*(l/x[8]+l/x[7])))) I sqrt2) I x[2])/ sigmax - 1.0 <= 0.0;

11 G(3) = SIGMAN(3» I sigmax - 1.0 <= 0.0; «forc - ( (xV(2.0*e*x[6]) * (forc*xVe*(3/(sqrt2*x[5])+4/x[8]-I/(sqrt2*x[I]))) I (xV(2.0*e)*(l/x[I]+ IIx[5]+ 11 x[6])+XI*sqrt2le*(l/x[8]+l/x[7])) - (-forc*xVe*(l/(sqrt2*x[2])+I/(sqrt2*x[3])+21x[lO]))) I «xV(2.0*e)*(l1 x[21+l/x[41+l/x[6]+l/x[3])+xl*sqrt2le*(l/x[9]+lIx[lO])) - (xV(2.0*e*x[6])) * (xV(2.O*e*x[6])) I (xiI (2.O*e)*(lIx[I]+ IIx[5]+ I/x[6])+xI*sqrt2le*(l/x[81+ IIx[7])) » I sqrt2) I x[3] ) I sigmax - 1.0 <= 0.0;

IISIGMAN( 4) = ( - X I I sqrt2) I x[ 4] 11 G(4) = SIGMAN(4» I sigmax - 1.0 <= 0.0;

« - «xV(2.0*e*x[6D * (forc*xIle*(3/(sqrt2*x[5D+4/x[8]-II(sqrt2*x[I]))) I (xV(2.0*e)*(l/x[I]+ IIx(5)+ 11 x[ 6D+xl*sqrt2le*(l/x[8]+ I/x[7])) - (-forc* xIle* (l/(sqrt2*x[2])+ lI(sqrt2*x[3])+21x[ 10])) ) I «xIl(2.0*e)* (11 x[2]+ IIx[4]+ IIx[6]+ I/x[3])+xl*sqrt2le*(l/x[9)+ IIx[lO])) - (xIl(2.0*e*x[6])) * (xV(2.0*e*x[6))) I (xII (2.O*e)*(l/x[I]+ I/x[5]+ I/x(6))+xl*sqrt2le*(l/x[8)+ I/x[7])) ) ) I sqrt2) I x[4]) I sigmax - 1.0 <= 0.0;

IISIGMAN(5) = (-3.0 * forc - X21 sqrt2) I x(5) IIG(5) = SIGMAN(5» I sigmax - 1.0 <= 0.0;

«-3.0 * fore - ( -( forc*xVe*(3/(sqrt2*x[5])+4/x[8]-II(sqrt2*x[l))) + I*XI *1 (xV(2.0*e*x[6)) * (forc*xV e*(3/(sqrt2*x[5D+4/x[8]-II(sqrt2*x[I)))) I (xIl(2.0*e)*(lIx[I]+ IIx[5]+ IIx[6D+xl*sqrt2le*(l/x[8]+ I/x[7])) - (forc*xIle*(I/(sqrt2*x[2D+ lI(sqrt2*x[3D+21x[ I 0])) ) I «xV(2.O*e)*( IIx[2]+ IIx[4]+ I/x[6]+ I x[3])+xl* sqrt21 e*(l/x[9]+lIx[lO])) - (xV(2.0*e*x[6])) * (xV(2.O*e*x[6])) I (xI/(2.0*e)*(l/x[I]+ IIx[5]+ IIx[6])+xl*sqrt2le*(I/ x[8]+lIx[7]))) * xIl(2.0*e*x[6])) / (xV(2.0*e)*(lIx[I]+lIx[5]+I/x[6])+xI*sqrt2le*(l/x[81+lIx[7]))) / sqrt2) / x[5]) / sigmax - 1.0 <= 0.0;

IISIGMAN(6) = (-(xl + X2) / sqrt2) I x[6] //G(6) = SIGMAN(6» / sigmax - 1.0 <= 0.0;

«- ( (xV(2.O*e*x[6]) * (forc*xVe*(3/(sqrt2*x[5D+4Ix[8]-II(sqrt2*x[1]))) / (xV(2.0*e)*(lIx[1]+lIx[5]+I/ x[6D+xl*sqrt2le*(l/x[8]+ IIx[7])) - (-forc*xVe*(I/(sqrt2*x[2])+ lI(sqrt2*x[3])+21x[lO])) ) / «xV(2.0*e)*(l/ x[2]+l/x[4]+ I/x[6]+ l/x[3])+xl*sqrt2le*(lIx[9)+ IIx[IOJ)) - (xV(2.O*e*x[6])) * (xll(2.O*e*x[6])) / (xV (2.O*e)*O/x[I)+l/x[5)+l/x[6])+xl*sqrt2le*(lIx[8)+I/x[7]))) + (-( forc*xlle*(3/(sqrt2*x[5))+4Ix[8)-1I (sqrt2*x[l])) + I*XI *1 (xV(2.0*e*x[6]) * (forc*xIle*(3/(sqrt2*x[5])+4Ix[8)-II(sqrt2*x[I]))) / (xll(2.O*e)*(I/ x[ll+ IIx[51+ l/x[61)+xl*sqrt2le*O/x[81+ IIx[7])) - (-forc*xIle*( lI(sqrt2*x[2))+ lI(sqrt2*x[3 D+21x[l 0])) ) / «xV(2.0*e)*(l/x[2]+ IIx (4) + IIx[6]+ IIx[3])+xl* sqrt2le*(l/x[9]+ IIx[l 0])) - (xll(2.0*e*x[6J)) * (xV (2.O*e*x[6])) / (xll(2.0*e)*(l/x[I]+ IIx(5)+lIx[6])+xl*sqrt2le*(l/x[8]+ IIx[7J)) ) * xI/(2.O*e*x[6])) / (xV (2.O*e)*(l/x[I]+ IIx[5]+ IIx[6])+xl*sqrt2le*(l/x[8]+lIx[7]))) )/ sqrt2) I x[6]) I sigmax - 1.0 <= 0.0;

IISIGMAN(7) = (X2) / x[7] IIG(7) = SIGMAN(7» / sigmax - 1.0 <= 0.0;

« -(forc*xVe*(3/(sqrt2*x[5])+4/x[8)-I/(sqrt2*x[l])) + I*XI *1 (xI/(2.0*e*x[6]) * (forc*xVe*(31 (sqrt2*x[5]) + 4/x[8]- lI(sqrt2*x[ I]))) I (xV(2.O*e)* (lIx[I]+ IIx[5]+ I/x[6])+xl*sqrt2le*( I/x[8]+ IIx[7]))-( -forc*xIle*(11 (sqrt2 *x[2])+ 1/(sqrt2*x[3])+21x[l 0])) ) I «xV(2.0*e)*(lIx[2)+ IIx[ 4]+ IIx[6]+ l/x[3])+xl* sqrt2le*(lIx[9]+ 11 x[ 1O]))-(xll(2.O*e*x[6J))*(xIl(2.0*e* x[6])) I (xIl(2.0*e)*(l/x[I)+ IIx[5]+ I/x[6])+xl*sqrt2le*(lIx[8)+ IIx(7)) ) ) *xV(2.0*e*x[6]»)/(xI/(2.0*e)*(lIx[I]+ IIx[5]+ IIx(6))+xl* sqrt2le* (lIx[8]+ IIx[7])))/x[7)) I sigmax - 1.0 <=0.0;

IISIGMAN(8) = (2 * sqrt2 * forc + X2) / x[8) IIG(8) = SIGMAN(8» I sigmax - 1.0 <= 0.0;

«2 * sqrt2 * forc + ( -( forc*xVe*(3/(sqrt2*x[5])+4Ix[8)-I/(sqrt2*x[l])) + I*XI*I (xIl(2.O*e*x[6]) * (forc*xVe*(3/(sqrt2* x[5])+4Ix[8]-I/(sqrt2*x[ I J))) I (xV(2.0*e)*(l/x[I)+ IIx(5)+ IIx[6])+xl*sqrt2le*(lIx[8]+ 11 x[7])) - (-forc*xVe*(l/(sqrt2*x[2])+ I/(sqrt2*x[3])+21x[lOJ)) ) I «xIl(2.0*e)*(l/x[2]+lIx[4]+ I/x[6]+ 11 x[3])+xl*sqrt2le*(l/x[9]+l/x[lOJ)) - (xV(2.O*e*x[6])) * (xll(2.0*e*x[6J)) I (xll(2.O*e)*(l/x[l]+ I/x[5]+ 1/ x[6])+xl*sqrt2le*(l/x[8]+lIx[7J)) ) * xV(2.0*e*x[6])) I (xIl(2.0*e)*(l/x[I]+ IIx[5]+ IIx[6])+xl*sqrt2le*(1I x[8]+ IIx[7])))) I x[8] ) I sigmax - 1.0 <= 0.0;


IISIGMAN(9) = XII x[9] IIG(9) = SIGMAN(9» I sigmax - 1.0 <= 0.0;

« (xV(2.O*e*x[6]) * (fore*xVe*(3/(sqrt2*x[5])+4/x[8]-I/(sqrt2*x[I]))) 1 (xV(2.O*e)*(1/x[I]+ IIx[5]+ I/ x[6])+xl*sqrt2/e*(lIx[8]+lIx[7])) - (-fore*xVe*(1I(sqrt2*x[2])+II(sqrt2*x[3))+21x[10])) ) 1 «xV(2.0*e)*(1I x[2]+l/x[4]+l/x[6]+l/x[3])+xl*sqrt2/e*(1/x[9]+ I/x[IO))) - (xV(2.O*e*x[6))) * (xV(2.O*e*x[6))) 1 (xV (2.O*e)*(lIx[I]+l/x[5]+l/x[6])+xI*sqrt2/e*(lIx[8]+ IIx[7))) ) ) 1 x[9]) I sigmax - 1.0 <= 0.0;

IISIGMAN(IO) = (-sqrt2 * fore + XI) I x[lO] IIG(10)= SIGMAN(10» 1 sigmax - 1.0 <= 0.0;

« -sqrt2 * fore + «xV(2.0*e*x[6]) * (forc*xVe*(3/(sqrt2*x[5D+4/x[8]-II(sqrt2*x[1]))) I (xV(2.0*e)*(1/x[Il+ 11 x[5]+l/x[6])+xI*sqrt2/e*(1/x[8]+ I/x[7))) - (-fore*xVe*(1I(sqrt2*x[2])+ I/(sqrt2*x[3])+21x[lO))) ) 1 «xV (2.0* e)* (lIx[2]+ I/x[4]+ lIx[6]+ I/x[3])+xl*sqrt2/e*(1/x[9]+ lIx[IO])) - (xI/(2.O*e*x[6])) * (xV(2.O*e*x[6])) 1 (xV(2.O*e)*(lIx[l]+lIx[5]+l/x[6])+xI*sqrt2/e*(lIx[8]+l/x[7))) »)1 x[lO] ) 1 sigmax - 1.0 <= 0.0;

~****************************************************************************

11 G(l1) bis G(20) entsprechen G(I+IO), i=I..IO und sigmin anstatt sigmax *****************************************************************************/

11 G(1O+I) = SIGMAN(I) 1 sigmin -1.0 <= 0.0; «fore - ( -( fore*xVe*(3/(sqrt2*x[5])+4/x[8]-I/(sqrt2*x[l])) + I*XI *1 (xV(2.O*e*x[6]) * (fore*xVe*(31 (sqrt2*x[5D+4/x[8]-I/(sqrt2*x[l]))) I (xI/(2.0*e)*(1/x[1]+ IIx[5]+ I/x[6D+xl*sqrt2/e*( lIx[8]+ I/x[7])) - (fore*xVe*(I/(sqrt2*x[2D+ 1I(sqrt2*x[3 D+21x[1 0))) ) 1 «xV(2.O*e)*(lIx[2]+ IIx[4]+ lIx[6]+ I/x[3])+xI*sqrt21 e*(1/x[9]+l/x[lO])) - (xV(2.0*e*x[6))) * (xV(2.0*e*x[6])) 1 (xI/(2.0*e)*(1/x[I]+ I/x[5]+l/x[6D+xI*sqrt2/e*(1I x[8]+ I/x[7])) ) * xV(2.0*e*x[6])) 1 (xV(2.O*e)*(lIx[I]+lIx[5]+ lIx[6])+xl*sqrt2/e*(l/x[8]+l/x[7]))) 1 sqrt2 )1 x[I))1 sigmin -1.0 <= 0.0;

11 G(10+2) = SIGMAN(2» 1 sigmin - 1.0 <= 0.0; «fore - «xV(2.0*e*x[6]) * (fore*xVe*(3/(sqrt2*x[5))+4/x[8]-I/(sqrt2*x[I)))) 1 (xI/(2.0*e)*(1/x[l]+ I/x[5]+ 11 x[6])+xl*sqrt2/e*(l/x[8]+lIx[7))) - (-fore*xVe*(I/(sqrt2*x[2])+ l/(sqrt2*x[3))+21x[10J)) ) 1 «xV(2.0*e)*(I1 x[2]+ lIx[4]+ I/x[6]+ lIx[3D+xl*sqrt2/e*(1/x[9]+lIx[lO])) - (xV(2.O*e*x[6])) * (xV(2.O*e*x[6))) 1 (xV (2.O*e)*(l/x[1]+lIx[5]+lIx[6))+xI*sqrt2/e*(1/x[8]+lIx[7))))) / sqrt2) 1 x[2])1 sigmin - 1.0 <= 0.0;

11 G(I 0+3) = SIGMAN(3» 1 sigmin - 1.0 <= 0.0; «fore - ( (xI/(2.0*e*x[6]) * (fore*xVe*(3/(sqrt2*x[5D+4/x[8]-II(sqrt2*x[I)))) I (xV(2.0*e)*(lIx[I]+ I/x[5J+ 11 x[6])+xI*sqrt2/e*(lIx[8]+ lIx[7))) - (-fore*xVe*( 1I(sqrt2*x[2])+ l/(sqrt2*x[3])+21x[ 10])) ) 1 «xV(2.0*e)*(11 x[2]+l/x[4]+l/x[6]+lIx[3D+xl*sqrt2/e*(lIx[9]+lIx[lO])) - (xI/(2.0*e*x[6))) * (xV(2.O*e*x[6))) I (xV(2.0*e)*(lIx[1]+ l/x[5]+l/x[6])+xl*sqrt2le*(l/x[8]+lIx[7])) » I sqrt2) I x[3] ) I sigmin - 1.0 <= 0.0;

I/SIGMAN(4) = ( - XII sqrt2) I x[4] 11 G(10+4) = SIGMAN(4» I sigmin - 1.0 <= 0.0;

« - «xV(2.0*e*x[6]) * (forc*xI/e*(3/(sqrt2*x[5])+4/x[8]-I/(sqrt2*x[ID» I (xV(2.O*e)*(lIx[I]+l/x[5]+ 11 x[6])+xl*sqrt2/e*(l/x[8]+l/x[7))) - (-forc*xVe*(I/(sqrt2*x[2])+I/(sqrt2*x[3])+21x[10J))) 1 «xV(2.0*e)*(1I x[2]+ lIx[4]+ lIx[6]+ lIx[3])+xI*sqrt2le*(1/x[9]+ lIx[1 0))) - (xV(2.O*e*x[6])) * (xV(2.O*e*x[6])) I (xV(2.O*e)*(1/x[I]+lIx[5]+11x[6])+xl*sqrt2/e*(l/x[8]+l/x[7])))) 1 sqrt2) 1 x[4]) 1 sigmin - 1.0 <= 0.0;

IISIGMAN(5) = (-3.0 * fore - X21 sqrt2) 1 x[5] I/G(10+5) = SIGMAN(5» 1 sigmin - 1.0 <= 0.0;

«-3.0 * fore - ( -( forc*xVe*(3/(sqrt2*x[5])+4Ix[8]-1I(sqrt2*x[1])) + I*Xl*1 (xV(2.O*e*x[6D * (forc*xVe*(31 (sqrt2*x[ 5])+4/x[8]-lI(sqrt2*x[l]))) I (xI/(2.O*e)*( lIx[l]+ IIx[5]+ IIx[6])+xI*sqrt2/e*(11x[8]+ IIx[7])) - (forc*xVe*(II(sqrt2*x[2])+II(sqrt2*x[3])+21x[IO)))) 1 «xV(2.O*e)*(lIx[2]+lIx[4]+lIx[6]+lIx[3])+xl*sqrt2/ e*(1/x[9]+lIx[10))) - (xV(2.0*e*x[6))) * (xV(2.O*e*x[6J)) 1 (xI/(2.O*e)*(l/x[I]+lIx[5]+11x[6])+xl*sqrt2/e*(1I x[8]+lIx[7])) ) * xll(2.0*e*x[6))) I (xV(2.0*e)*(lIx[I]+ I/x[5]+ I/x[6])+xI* sqrt2/e* (l/x[8]+l/x[7))) )1 sqrt2) 1 x[5]) I sigmin - 1.0 <= 0.0;

Anhang F. Quelltexte zu den Beispielen

IISIGMAN(6) = (-(xl + X2) I sqrt2) I x[6] IIG(I0+6) = SIGMAN(6» I sigmin - 1.0 <= 0.0;

207

«- ( (xV(2.O*e*x[6]) * (fore*xVe*(3/(sqrt2*x[5])+4Ix[8]-I/(sqrt2*x[I]))) I (xV(2.O*e)*(l/x[I]+l/x[5]+1/ x[6])+xl*sqrt2le*(lIx[8]+lIx[7])) - (-fore*xVe*(I/(sqrt2*x[2])+I/(sqrt2*x[3])+21x[10]))) I «xV(2.0*e)*(1I x[2]+lIx[4]+ lIx[6]+l/x[3])+xl*sqrt2le*(l/x[9]+ lIx[lO])) - (xV(2.0*e*x[6])) * (xV(2.O*e*x[6])) I (xV (2.O*c)*(l/x[I]+ lIx[5]+lIx[6])+xl*sqrt2le*(lIx[8]+lIx[7])) ) + ( -( fore*xVc*(3/(sqrt2*x[5])+4/x[8]-1I (sqrt2*x[lJ)) + I*XI*I (xV(2.O*e*x[6]) * (fore*xVe*(3/(sqrt2*x[5])+4Ix[8]-1I(sqrt2*x[I]))) I (xV(2.O*c)*(1I x[ 1]+ IIx[5]+ IIx [6])+xl* sqrt2le* (l/x[8]+ lIx[7])) - (-forc*xVe*(1I(sqrt2*x[2])+ 1I(sqrt2*x[3])+21x[l 0])) )

I (xV(2.0*c)*(1/x[2]+ lIx[4]+ lIx[6]+ I/x[3])+xl*sqrt2le*(l/x[9]+ lIx[IO])) - (xV(2.0*e*x[6])) * (xV (2.O*e*x[6])) I (xV(2.0*e)*(lIx[I]+ lIx[5]+ lIx[6])+xl*sqrt2le*(l/x[8]+ lIx[7])) ) * xV(2.0*e*x[6])) 1 (xV (2.O*e)*(I/x[I]+lIx[5]+lIx[6])+xl*sqrt2lc*(I/x[8]+l/x[7]))))1 sqrt2) I x[6]) I sigmin - 1.0 <= 0.0;

IISIGMAN(7) = (X2) I x[7] IIG(IO+ 7) = SIGMAN(7» I sigmin - 1.0 <= 0.0;

«-(fore*xVe*(3/(sqrt2*x[5])+4/x[8]-I/(sqrt2*x[I])) + I*XI *1 (xV(2.0*e*x[6]) * (fore*xVe*(3/(sqrt2*x[5]) +41 x[8]-1I(sqrt2*x[I]))) I (xV(2.0*e)* (1/x[I]+ lIx[5]+ I/x[6])+xl*sqrt2le*(lIx[8]+ lIx[7]))-( -forc*xVe*( lI(sqrt2 * x[2])+ I/(sqrt2*x[3])+21x[1 OJ)) ) I (xV(2.0*e)*( IIx[2]+ lIx[4]+ IIx[6]+ IIx[3])+xl* sqrt2lc* (l/x[9]+ IIx[1 OJ)) -(xV(2.O*e*x[6])) * (xV(2.0*c*x[6J)) I (xV(2.0*e)*(lIx[l]+ lIx[5]+ I/x[6])+xI* sqrt2le* (I/x[8]+ I/x[7])) )* xV (2.O*e*x[6])) I (xV(2.0*e)*(l/x[I]+lIx[5]+lIx[6])+xl*sqrt2le*(lIx[8]+lIx[7]))) I x[7]) I sigmin - 1.0 <= 0.0;

IISIGMAN(8) = (2 * sqrt2 * forc + X2) I x[8] IIG(IO+8) = SIGMAN(8» I sigmin - 1.0 <= 0.0;

((2 * sqrt2 * forc + ( -( forc*xlIe*(3/(sqrt2*x[5])+4Ix[8]-I/(sqrt2*x[I])) + I*XI *1 (xll(2.O*e*x[6]) * (forc*xlle*(3/(sqrt2*x[5])+4Ix[8]-II(sqrt2*x[1 J)) I (xlI(2.0*e)*(1/x[I]+ lIx[5]+ lIx[6])+xl*sqrt2le*( lIx[8]+ II x[7])) - (-forc*xVc*(l/(sqrt2*x[2D+I/(sqrt2*x[3])+21x[IO]))) I (xll(2.O*e)*(I/x[2]+l/x[4]+lIx[6]+11 x[3D+xl*sqrt2le*(lIx[9]+ I/x[IO])) - (xll(2.0*e*x[6]» * (xll(2.0*e*x[6])) I (xV(2.0*e)*(1/x[I]+ IIx[5]+ 11 x[6])+xl*sqrt2le*(l/x[8]+ I/x[7])) ) * xV(2.0*e* x[6])) I (xll(2.O*e)*(I/x[I]+ IIx[5]+ lIx[6])+xl*sqrt2le*(I1 x[8]+ IIx[7])))) I x[8] ) I sigmin - 1.0 <= 0.0;

IISIGMAN(9) = XII x[9] IIG(10+9) = SIGMAN(9» I sigmin - 1.0 <= 0.0;

« (xll(2.O*e*x[6]) * (forc*xlle*(3/(sqrt2*x[5])+4/x[8]-I/(sqrt2*x[I]))) I (xll(2.0*e)*(l/x[I]+ IIx[5]+ I x[6])+xl*sqrt2le*(lIx[8]+ I/x[7])) - (-fore* xlle*( 1I(sqrt2*x[2])+ 1I(sqrt2*x[3])+21x[ I 0])) ) I «xll(2.0*e)* (11 x[2]+l/x[4]+lIx[6]+ lIx[3])+xl*sqrt2lc*(lIx[9]+ IIx[IO])) - (xll(2.O*e*x[6])) * (xll(2.0*e*x[6])) I (xV (2.O*e)*(l/x[l]+lIx[5]+lIx[6])+XI*sqrt2le*(I/x[8]+lIx[7])))) I x[9J) I sigmin - 1.0 <= 0.0;

IISIGMAN(10) = (-sqrt2 * fore + XI) I x[lO] IIG(lO+IO)= SIGMAN(10» I sigmin - 1.0 <= 0.0;

«(-sqrt2 * forc + «xV(2.0*e*x[6]) * (fore*xVe*(3/(sqrt2*x[5])+4Ix[8]-1I(sqrt2*x[l]))) I (xV(2.0*e)*(I/x[I]+1I x[5]+lIx[6])+xl*sqrt2le*(lIx[8]+ IIx[7]» - (-fore*xVe*(1/(sqrt2*x[2])+ I/(sqrt2*x[3])+21x[10])) ) I «xli (2.0*e)*(I/x[2]+ lIx[ 4]+ I/x[6]+ lIx[3])+xl* sqrt2lc*(1/x[9]+ IIx[1 0])) - (xV(2.O*e*x[6])) * (xll(2.O*e*x[6]))

I (xll(2.0*e)*(I/x[I]+ lIx[5]+ lIx[6])+XI*sqrt2le*(lIx[81+ lIx[7])) ) »1 x[lO] ) I sigmin - 1.0 <= 0.0;

bounds 1.0 <= x <=10000.0;

initialvalues x[I]=60; x(2)=IO; x(3)=10; x(4)=40; x[5]=90; x(6)=IO; x[7]=50; x(8)=60; x[9]=60; x[IO)=IO;


OpTiX.llI Problembeschreibung des dekomponierten Getriebes

problem "Reduziergetriebe_Manager_ C": decisionvars realvar xl, x2, x3; coordinationvars realvar x4, x5, x6, x7, f; objective f = min -1.508*xl *sqr(x6) + 7.477*x6"3 + 0.7854*x4*sqr(x6) -1.508*xl *sqr(x7)

+ 7.477*x7"3 + 0.7854*x5*x7"2; constraints

1* gl *1 27/xllsqr(x2)/x3 <= I; 1* g2 *1 397.5/xllsqr(x2)1sqr(x3) <= I; 1* g7 *1 x2*x3 <= 40; 1* g8 *1 xl/x2 >= 5; 1* g9 *1 xllx2 <= 12;

bounds 1* glO,gll */2.6 <= xl <= 3.6; 1* g12,g13 *1 0.7 <= x2 <= 0.8; 1* g14,g15 */17 <= x3 <= 28;

initialvalues xl = 2.7; x2 = 0.75; x3 = 20; x4 = 7.5; x5 = 7.4; x6 = 3.0; x7 = 5.1;

problem "Reduziergetriebe_ Worker_1 ": decisionvars realvar x4, x6; coordinationvars realvar f, x I, x2, x3; objective f = min -1.508*xl *sqr(x6) + 7.477*x6"3 + 0.7854*(x4*sqr(x6»; constraints

1* g3 *1 1.93/x2lx3*x4"3/x6"4 <= I; 1* g5 *1 sqrt(sqr(745*x4/x2lx3)+16.9E6)/0.lIx6"3 <= 1100; 1* g24 *1 (l.5*x6+1.9)/x4 <= I;

bounds 1* g16,g17 */7.3 <= x4 <= 8.3; 1* g20,g21 */2.9 <= x6 <= 3.9;

problem "Reduziergetriebe_ Workec2": decisionvars realvar x5, x7; coordinationvars realvar xl, x2, x3, f; objective

f = min -1.508*xl *sqr(x7) + 7.477*x7"3 + 0.7854*x5*x7"2; constraints

1* g4 *1 1.93/x21x3*x5"3/x7"4 <= I; 1* g6 *1 sqrt(sqr(745*x5/x2lx3)+1 57.5E6)/0. lIx7"3 <= 850; 1* g25 *1 (1.1 *x7+1.9)1x5 <= I;

bounds 1* g18,g19 */7.3 <= x5 <= 8.5; 1* g22,g23 *15.0 <= x7 <= 5.5;

Anhang F. Quelltexte zu den Beispielen

OpTiX-ill Problembeschreibung des Managers für das dekomponierte Rosenbrock 100 Problem mit sieben Workern

problem "Rosenbrock_lOO_Manager": decisionvars realvar

x40,x61,x72,x83,x91,x97; coordinationvars

realvar wl(39), w2(20), w3[J0), w4(10), w5(7), w6(5), w7(3), f; objective

f= min sum(i1 = 1..38: lOO*sqr(wl[il+l)-sqr(wl[il)))+sqr(wl[il)-1.0)) + 1 OO*sqr(x40-sqr(w 1 (39)))+sqr(w I (39)-1.0) + I OO*sqr(w2[ 1)-sqr(x40))+sqr(x40-1.0) + sum(i2=1..19: 1 OO*sqr(w2[i2+ 1)-sqr(w2[i2)))+sqr(w2[i2)-1.0)) + 1 OO*sqr(x61-sqr(w2[20)))+sqr(w2[20]-1.0) + 1 OO*sqr(w3[ 1)-sqr(x61»+sqr(x61-1.0) + sum(i3=1..9: IOO*sqr(w3[i3+ 1)-sqr(w3[i3)))+sqr(w3[i3)-1.0)) + I OO*sqr(x72-sqr(w3[ 1O)))+sqr(w3[ 10]-1.0) + I OO*sqr(w4[ 1)-sqr(x72))+sqr(x72-1.0) + sum(i4=1..9: lOO*sqr(w4[i4+1)-sqr(w4[i4)))+sqr(w4[i4)-1.0)) + 1 OO*sqr(x83-sqr(w4[J 0]»+sqr(w4[ 10]-1.0) + 1 OO*sqr(w5[1]-sqr(x83))+sqr(x83- \.0) + sum(i5=1 .. 6: lOO*sqr(w5[i5+ 1]-sqr(w5[i5)))+sqr(w5[i5)-1.0)) + 1 OO*sqr(x91-sqr(w5[7)))+sqr(w5[7]-1.0) + 1 OO*sqr(w6[ 1)-sqr(x91 ))+sqr(x91-1.0) + sum(i6=1..4: lOO*sqr(w6[i6+ 1)-sqr(w6[i6)))+sqr(w6[i6]-1.0)) + 1 OO*sqr(x97-sqr(w6[5)))+sqr(w6[5)-1.0) + 1 OO*sqr(w7[1)-sqr(x97»+sqr(x97-1.0) + sum(i7= 1..2: 1 OO*sqr(w7[i7+ 1]-sqr(w7[i7)))+sqr(w7[i7]-1.0));

bounds -3.0 <= x40 <= 3.0; -3.0 <= x61 <= 3.0; -3.0 <= x72 <= 3.0; -3.0 <= x83 <= 3.0; -3.0 <= x91 <= 3.0; -3.0 <= x97 <= 3.0; -3.0 <= wl <= 3.0; -3.0 <= w2 <= 3.0; -3.0 <= w3 <= 3.0; -3.0 <= w4 <= 3.0; -3.0 <= w5 <= 3.0; -3.0 <= w6 <= 3.0; -3.0 <= w7 <= 3.0;

initialvalues wl=1.2; w2=1.2; w3=1.2; w4=\.2; w5=\.2; w6=\.2; w7=\.2;

209

wl(2)=-\.2; wl[4]=-1.2; wl(6)=-\.2; wl[8]=-\.2; wl[IO)=-\.2; wl[12]=-\.2; wl[14]=-\.2; wl[16]=-\.2; wl[J8]=-\.2; wl(20)=-1.2; wl[22]=-1.2; wl[24]=-1.2; wl[26]=-\.2; wl(28)=-\.2; wl(30)=-\.2; wl(32)=-\.2; wl(34)=-1.2; wl(36)=-\.2; wl(38)=-\.2; w2(2)=-1.2; w2[4]=-\.2; w2(6)=-1.2; w2(8)=-\.2; w2[J0)=-1.2; w2(12)=-1.2; w2[J4)=-1.2; w2[J6)=-1.2; w2(18)=-1.2; w3(1)=-1.2; w3(3)=-1.2; w3(5)=-\.2; w3(7)=-1.2; w4(1)=-1.2; w4(3)=-1.2; w4(5)=-\.2; w4(7)=-1.2; w5[J)=-1.2; w5[3]=-1.2; w5(5)=-\.2; w6[1]=-\.2; w6(3)=-1.2; w6(5)=-1.2; w7[l)=-\.2; w7(3)=-\.2; x4O=-\.2; x61= \.2; x72=-\.2; x83= 1.2; x91= 1.2; x97= \.2;

OpTiX-III Problembeschreibung der sieben Worker für das dekomponierte Rosenbrock 100 Problem

problem "Rosenbrock_ Worker_l ": decisionvars

realvar workerl_x(39); coordinationvars

realvar fI , x40; objective

fI = min sum(i=1..38: lOO*sqr(workerl_x[i+l]-sqr(workerl_x[i]))+sqr(workerl_x[i]-\.O)) + 1 OO*sqr(x40-sqr(worker l_x(39)))+sqr(workerl_x[39)-1.0);

bounds -3.0 <= workerl_x <= 3.0;

problem "Rosenbrock_ Worker_2": decisionvars

realvar worker2_x(20); coordinationvars

realvar f2, x40, x61 ;


objective f2= min IOO*sqr(worker2_x[I)-sqr(x40»+sqr(x40-1.0) + sum(i=1..19: IOO*sqr(worker2_x[i+I]sqr(worker2_x[iJ)+sqr(worker2_x[i)-1.0» + I OO*sqr(x61-sqr(worker2_x[20J)+sqr(worker2_x[20]-1.0);

bounds -3.0 <= worker2_x <= 3.0;


realvar worker3_x[10]; coordinationvars

realvar 13. x61. x72; objective

13= min lOO*sqr(worker3_x[I]-sqr(x61»+sqr(x61-1.0) + sum(i=1..9: IOO*sqr(worker3_x[i+I) -sqr(worker3_x[i]))+sqr(worker3_x[i]-1.0)) + I OO*sqr(x72-sqr(worker3_x[ I 0]»+sqr(worker3_x[ I 0]-1.0);


problem • .Rosenbrock_ Worker_ 4": decisionvars


rea1var f4. x72. x83; objective

f4= min 100* sqr(worker4_x[ 1]-sqr(x72))+sqr(x72-1.0) + sum(i= 1..9: I OO*sqr(worker4_x[i+ I] -sqr(worker4_x[i]))+sqr(worker4_x[i]-1.0)) + I OO*sqr(x83-sqr(worker4_x[ 1O]»+sqr(worker4_x[1 0]-1.0);




realvar x83. x91. f5; objective

f5= min lOO*sqr(worker5_x[I]-sqr(x83»+sqr(x83-1.0) + sum(i=1..6: lOO*sqr(worker5_x[i+l] -sqr(worker5_x[i]))+sqr(worker5_x[i]-1.0)) + I OO*sqr(x91-sqr(worker5_x[7])+sqr(worker5_x[7]-1.0);


problem .. Rosenbrock_ Worker_6": decisionvars


realvarf6. x91. x97; objective

f6= min lOO*sqr(worker6_x[1]-sqr(x91»+sqr(x91-1.0) + sum(i=1..4: lOO*sqr(worker6_x[i+ I] -sqr(worker6_x[i]))+sqr(worker6_x[i]-I.O)) + I OO*sqr(x97-sqr(worker6_x[5]))+sqr(worker6_x[5]-1.0);


problem "Rosenbrock_ Workec7": decisionvars

rea1var worker7 _x[3]; coordinationvars

rea1var f7. x97; objective

f7= min lOO*sqr(worker7 _x[1]-sqr(x97»+sqr(x97-1.0) + I OO*sqr(worker7 _x[2]-sqr(worker7 _x[l])) +sqr(worker7 _xl I )-1.0) + I OO*sqr( worker7 _x[3]-sqr(worker7 _x[2]) )+sqr( worker7 _x(2)-1.0);


Literaturveneichnis - Springer978-3-642-51734...Literaturveneichnis Literatur Kapitell: [Bode94]...

Documents

Transcript of Literaturveneichnis - Springer978-3-642-51734...Literaturveneichnis Literatur Kapitell: [Bode94]...