Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 60 (1993), S. 349-359 
    ISSN: 1436-4646
    Schlagwort(e): linear complementarity problems ; efficient solutions ; multiple objective programming ; computational complexity
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract An equivalence is demonstrated between solving a linear complementarity problem with general data and finding a certain subset of the efficient points of a multiple objective programming problem. A new multiple objective programming based approach to solving linear complementarity problems is presented. Results on existence, uniqueness and computational complexity are included.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Fire technology 30 (1994), S. 338-340 
    ISSN: 1572-8099
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Architektur, Bauingenieurwesen, Vermessung
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Fire technology 34 (1998), S. 227-246 
    ISSN: 1572-8099
    Schlagwort(e): HAZARD I ; egress path ; multiple objectives ; dynamic programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Architektur, Bauingenieurwesen, Vermessung
    Notizen: Abstract Within the framework of HAZARD I, fire egress analysis is performed using the EXITT program. Yet another way to analyze fire egress employs newly developed multiple objective dynamic programming. This paper compares these two approaches by applying them to a model fire of moderate power in a residential building. The findings demonstrate that multiple objective dynamic programming can compute all the paths EXITT finds, but EXITT can't find all the paths multiple objective programming can. Some trade-offs inherent in choosing among the computed egress paths are discussed, and the features of the two fire egress methods are contrasted.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    Annals of operations research 44 (1993), S. 161-172 
    ISSN: 1572-9338
    Schlagwort(e): Input-output analysis ; generalized complementarity problems ; technological change models
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract The Leontief input-output model is generalized and formulated as a generalized linear complementarity problem. Conditions for existence of solutions are given, and solution techniques are reviewed. An application of the model to choosing new technologies is suggested.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 16 (1979), S. 127-130 
    ISSN: 1436-4646
    Schlagwort(e): Linear Complementarity Problem ; Lemke's Algorithm ; Cycling ; Degeneracy
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract A bound for the minimum length of a cycle in Lemke's Algorithm is derived. An example illustrates that this bound is sharp, and that the fewest number of variables is seven.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Digitale Medien
    Digitale Medien
    Springer
    Journal of global optimization 11 (1997), S. 151-161 
    ISSN: 1573-2916
    Schlagwort(e): Complementarity problems ; Z-matrices ; least element theory
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Existence of solutions to the Generalized Linear Complementarity Problem (GLCP) is characterized when the associated matrix is a vertical blockZ-matrix. It is shown that if solutions exist, then one must be the leastelement of the feasible region. Moreover, the vertical block Z-matrixbelongs to the class of matrices where feasibility implies existence of asolution to the GLCP. The concept of sufficient matrices of class Z isinvestigated to obtain additional properties of the solution set.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Digitale Medien
    Digitale Medien
    Chichester : Wiley-Blackwell
    International Journal for Numerical Methods in Fluids 4 (1984), S. 377-397 
    ISSN: 0271-2091
    Schlagwort(e): Lubrication ; Film Thickness ; Free Boundary ; Engineering ; Engineering General
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Maschinenbau
    Notizen: The classical problem of elasto-hydrodynamic lubrication of cylinders in line contact is formulated as a non-linear complementarity problem. A direct algorithm is applied to the approximation obtained by finite differences. Implementation considerations are emphasized. The new method provides reliable and automatic location of the previously troublesome lubricant free boundary. Numerical results reveal the qualitative behaviour of the pressure distribution and the lubricant film thickness under variation of key physical parameters.
    Zusätzliches Material: 13 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...