ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Springer  (57)
Collection
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Advanced performance materials 1 (1994), S. 51-85 
    ISSN: 1572-8765
    Keywords: composite materials ; environmental effects ; long-term durability ; flight service
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract NASA Langley and the U.S. Army have jointly sponsored programs to assess the effects of realistic flight environments and ground-based exposure on advanced composite materials and structures. Composite secondary structural components were initially installed on commercial transport aircraft in 1973; secondary and primary structural components were installed on commercial helicopters in 1979; and primary structural components were installed on commercial aircraft in the mid-to-late 1980's. Over 5.3 million total component flight hours have been accumulated on 350 composite components since 1973. Service performance, maintenance characteristics, and residual strength of numerous composite components are reported. In addition to data on flight components; 10-year ground-based exposure test results on material coupons are reported. Comparisons between flight and ground-based environmental effects for several composite material systems are also presented. Test results indicate excellent in-service performance with the composite components during the 15 year evaluation period. Good correlation between ground-based material performance and operational structural performance has been achieved.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Theoretical chemistry accounts 23 (1971), S. 259-265 
    ISSN: 1432-2234
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Description / Table of Contents: Zusammenfassung Die INDO Molekularorbital-Methode wurde so erweitert, daß sie auch auf Atome der 2. Periode anwendbar ist. Es wurden die Gleichgewichtsgeometrien für einige Si und Cl enthaltende Radikale berechnet. Die ebenfalls errechneten Hyperfeinkopplungs-Konstanten werden mit Resultaten aus ESR Experimenten verglichen. Für organische Radikale erhält man Chlor-Hyperfein-Aufspaltungen in guter Übereinstimmung mit neueren experimentellen Werten.
    Notes: Abstract The INDO molecular orbital method has been extended to allow for the inclusion of second row atoms. Equilibrium geometries have been calculated for several radicals containing Si and Cl and their hyperfine coupling constants compared with results from ESR experiments. The calculations give chlorine hyperfine splittings in organic radicals in good agreement with recently reported experimental values.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 36 (1982), S. 129-134 
    ISSN: 1573-2878
    Keywords: Nonconvex programming ; algorithmic convergence ; branch-and-bound procedures ; global minimum
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This note presents a new convergence property for each of two branch-and-bound algorithms for nonconvex programming problems (Falk-Soland algorithms and Horst algorithms). For each algorithm, it has been shown previously that, under certain conditions, whenever the algorithm generates an infinite sequence of points, at least one accumulation point of this sequence is a global minimum. We show here that, for each algorithm, in fact, under these conditions, every accumulation point of such a sequence is a global minimum.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 38 (1982), S. 319-340 
    ISSN: 1573-2878
    Keywords: Nonconvex programming ; parametric programming ; branch-and-bound methods ; global minimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we consider a general family of nonconvex programming problems. All of the objective functions of the problems in this family are identical, but their feasibility regions depend upon a parameter ϑ. This family of problems is called a parametric nonconvex program (PNP). Solving (PNP) means finding an optimal solution for every program in the family. A prototype branch-and-bound algorithm is presented for solving (PNP). By modifying a prototype algorithm for solving a single nonconvex program, this algorithm solves (PNP) in one branch-and-bound search. To implement the algorithm, certain compact partitions and underestimating functions must be formed in an appropriate manner. We present an algorithm for solving a particular (PNP) which implements the prototype algorithm by forming compact partitions and underestimating functions based upon rules given by Falk and Soland. The programs in this (PNP) have the same concave objective function, but their feasibility regions are described by linear constraints with differing right-hand sides. Computational experience with this algorithm is reported for various problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 38 (1982), S. 341-361 
    ISSN: 1573-2878
    Keywords: Admissible points ; multiple-objective decision making ; efficient points ; vector maximization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we present several new properties of the admissible points of a convex polyhedron. These properties can be classified into two categories. One category concerns the characterization and generation of these points. The other category concerns the circumstances under which these points are efficient solutions for linear multiple-objective programs with nonnegative criteria matrices. To illustrate some of the potential utility of these properties, we describe their application to two practical problems. These problems are the linear multiple-objective problem with interval coefficients and the problem of optimizing over the efficient set.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 39 (1983), S. 125-132 
    ISSN: 1573-2878
    Keywords: Vector maximization ; multiple-objective optimization ; efficient points ; proper efficiency ; nondominated points
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this note, we give sufficient conditions for a domination property to hold for a vector maximization problem with respect to cones. A previously developed result concerning this domination property easily follows from these conditions. We also show that, if one of these conditions is relaxed, then the domination property may not hold.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 43 (1984), S. 477-479 
    ISSN: 1573-2878
    Keywords: Vector maximization ; multiple-objective optimization ; efficient points ; proper efficiency ; nondominated points
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We give a corrected version of Theorem 2.1 of Ref. 1.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 60 (1989), S. 353-373 
    ISSN: 1573-2878
    Keywords: Multilevel programming ; multistage optimization ; linear multilevel programming ; multiple-criteria decision making
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Many decision-making situations involve multiple planners with different, and sometimes conflicting, objective functions. One type of model that has been suggested to represent such situations is the linear multilevel programming problem. However, it appears that theoretical and algorithmic results for linear multilevel programming have been limited, to date, to the bounded case or the case of when only two levels exist. In this paper, we investigate the structure and properties of a linear multilevel programming problem that may be unbounded. We study the geometry of the problem and its feasible region. We also give necessary and sufficient conditions for the problem to be unbounded, and we show how the problem is related to a certain parametric concave minimization problem. The algorithmic implications of the results are also discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 94 (1997), S. 487-510 
    ISSN: 1573-2878
    Keywords: Multiplicative programming ; global optimization ; concave minimization ; efficient points ; heuristic algorithms ; multiple objectives
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Multiplicative programming problems are difficult global optimization problems known to be NP-hard. At the same time, these problems have some important applications in engineering, finance, economics, and other fields. This article has two purposes. The first is to present an analysis that shows several relationships between concave multiplicative programs and concave minimization problems, and between concave multiplicative programs and certain multiple-objective mathematical programs. The second purpose is to propose and report computational results for a heuristic efficient-point search algorithm that we have designed for use on linear multiplicative programming problems. To our knowledge, this is the first heuristic algorithm of its type. The theoretical and algorithmic results given in the article offer some potentially important new avenues for analyzing and solving multiplicative programming problems of various types.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 97 (1998), S. 1-10 
    ISSN: 1573-2878
    Keywords: Multiple-objective linear programming ; efficient sets ; weakly efficient sets ; outer-approximation algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Various difficulties have been encountered in using decision set-based vector maximization methods to solve a multiple-objective linear programming problem (MOLP). Motivated by these difficulties, Benson recently developed a finite, outer-approximation algorithm for generating the set of all efficient extreme points in the outcome set, rather than in the decision set, of problem (MOLP). In this article, we show that the Benson algorithm also generates the set of all weakly efficient points in the outcome set of problem (MOLP). As a result, the usefulness of the algorithm as a decision aid in multiple objective linear programming is further enhanced.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...