Advertisement

Discrete optimization with bilinear objective function and linear constraints

  • Wolfgan Lassmann
  • Rolf Rogge
II Mathematical Programming II.2 Discrete Optimization
  • 112 Downloads
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 180)

Keywords

Variable Coefficient Linear Constraint Mixed Integer Linear Program Discrete Optimization Linear Programming Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Lassmann, W.; Rogge, R.: The Complex method for Mixed Integer Linear Programs. 14th IFIP Conference on System Modelling and Optimization, Leipzig 1989, Heft 4, p. 134–135.Google Scholar
  2. [2]
    Lassmann, W.; Rogge, R.: Die Komplexmethode in der computergestützten Planoptimierung und Entscheidungsvorbereitung. Operations Research — Spektrum Band 12, Heft 1, 1990, p. 25–34. Springer-Verlag.CrossRefGoogle Scholar
  3. [3]
    Rogge, R.: Zu Weiterentwicklungen der Komplexmethode. In: 7. Forschungslehrbrief "Optimierungssoftware für 16-Bit-Personalcomputer", p. 71–76. Lehrbrief für das Hochschulfernstudium, Dresden 1990.Google Scholar
  4. [4]
    Pressmar, D.B.: Formulation of multiple — choice situations in linear programming models using binary coding matrices. European Journal of Oper. Res. 21 (1985) 106–112.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© International Federation for Information Processing 1992

Authors and Affiliations

  • Wolfgan Lassmann
    • 1
  • Rolf Rogge
    • 1
  1. 1.Institut für WirtschaftsinformatikMartin-Luther-Universität HalleHalle

Personalised recommendations