Bibliothek

Sprache
Bevorzugter Suchindex
Ergebnisse pro Seite
Sortieren nach
Sortierung
Anzahl gespeicherter Suchen in der Suchhistorie
E-Mail-Adresse
Voreingestelltes Exportformat
Voreingestellte Zeichencodierung für Export
Anordnung der Filter
Maximale Anzahl angezeigter Filter
Autovervollständigung
Feed-Format
Anzahl der Ergebnisse pro Feed
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
    Journal of global optimization 7 (1995), S. 143-182 
    ISSN: 1573-2916
    Schlagwort(e): Global optimization ; nonlinear systems of equations ; all solutions
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract A new approach is proposed for finding allε-feasible solutions for certain classes of nonlinearly constrained systems of equations. By introducing slack variables, the initial problem is transformed into a global optimization problem (P) whose multiple global minimum solutions with a zero objective value (if any) correspond to all solutions of the initial constrained system of equalities. Allε-globally optimal points of (P) are then localized within a set of arbitrarily small disjoint rectangles. This is based on a branch and bound type global optimization algorithm which attains finiteε-convergence to each of the multiple global minima of (P) through the successive refinement of a convex relaxation of the feasible region and the subsequent solution of a series of nonlinear convex optimization problems. Based on the form of the participating functions, a number of techniques for constructing this convex relaxation are proposed. By taking advantage of the properties of products of univariate functions, customized convex lower bounding functions are introduced for a large number of expressions that are or can be transformed into products of univariate functions. Alternative convex relaxation procedures involve either the difference of two convex functions employed in αBB [23] or the exponential variable transformation based underestimators employed for generalized geometric programming problems [24]. The proposed approach is illustrated with several test problems. For some of these problems additional solutions are identified that existing methods failed to locate.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Hoboken, NJ : Wiley-Blackwell
    AIChE Journal 43 (1997), S. 1250-1264 
    ISSN: 0001-1541
    Schlagwort(e): Chemistry ; Chemical Engineering
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Chemie und Pharmazie , Werkstoffwissenschaften, Fertigungsverfahren, Fertigung
    Notizen: A systematic method that quantitatively assesses property prediction uncertainty (imprecision) on optimal molecular design problems is introduced. Propety-structure relations are described with specific nonlinear functionalities based on group contribution methods. Property prediction uncertainty is explicitly quantified by using multivariate probability density distributions to model the likelihood of different realizations of the group contribution parameters. Assuming stability of these probability distributions, a novel approach is introduced for transforming the original nonlinear stochastic formulation into a deterministic MINLP problem with linear binary and convex continuour parts with separability. The resulting convex MINLP formulation is solved to global optimality for molecular design problems involving many uncertain group contribution parameters. Results indicate the computtional tractability of the method and the profound effect that property prediction uncertainty may have in optimal molecular design. Specifically, trade-off curves between performance objectives, probabilities of meeting the objectives, and chances of satisfying design specifications offer a concise and systematic way to guide optimal molecular design in the face of property prediction uncertainty.
    Zusätzliches Material: 6 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    New York, NY [u.a.] : Wiley-Blackwell
    Biotechnology and Bioengineering 56 (1997), S. 145-161 
    ISSN: 0006-3592
    Schlagwort(e): metabolic pathways ; parametric uncertainty ; chance-constrained programming ; nonlinear optimization ; Chemistry ; Biochemistry and Biotechnology
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Biologie , Werkstoffwissenschaften, Fertigungsverfahren, Fertigung
    Notizen: The S-System formalism provides a popular, versatile and mathematically tractable representation of metabolic pathways. At steady-state, after a logarithmic transformation, the S-System representation reduces into a system of linear equations. Thus, the maximization of a particular metabolite concentration or a flux subject to physiological constraints can be expressed as a linear programming (LP) problem which can be solved explicitly and exactly for the optimum enzyme activities. So far, the quantitative effect of parametric/experimental uncertainty on the S-model predictions has been largely ignored. In this work, for the first time, the systematic quantitative description of modeling/experimental uncertainty is attempted by utilizing probability density distributions to model the uncertainty in assigning a unique value to system parameters. This probabilistic description of uncertainty renders both objective and physiological constraints stochastic, demanding a probabilistic description for the optimization of metabolic pathways. Based on notions from chance-constrained programming and statistics, a novel approach is introduced for transforming the original stochastic formulation into a deterministic one which can be solved with existing optimization algorithms. The proposed framework is applied to two metabolic pathways characterized with experimental and modeling uncertainty in the kinetic orders. The computational results indicate the tractability of the method and the significant role that modeling and experimental uncertainty may play in the optimization of networks of metabolic reactions. While optimization results ignoring uncertainty sometimes violate physiological constraints and may fail to correctly assess objective targets, the proposed framework provides quantitative answers to questions regarding how likely it is to achieve a particular metabolic objective without exceeding a prespecified probability of violating the physiological constraints. Trade-off curves between metabolic objectives, probabilities of meeting these objectives, and chances of satisfying the physiological constraints, provide a concise and systematic way to guide enzyme activity alterations to meet an objective in the face of modeling and experimental uncertainty. © 1997 John Wiley & Sons, Inc. Biotechnol Bioeng 56: 145-161, 1997.
    Zusätzliches Material: 7 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...