Articoli correlati a Convex Relaxations for Mixed-Integer Nonlinear Programs
Risultati della ricerca per Convex Relaxations for Mixed-Integer Nonlinear Programs
Immagini fornite dal venditore
Convex Relaxations for Mixed-Integer Nonlinear Programs
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This thesis deals with new techniques to construct a strong convex relaxation for a mixed-integer nonlinear program (MINLP). While local optimization software can quickly identify promising operating points of MINLPs, the solution of the convex relaxation provides a global bound on the optimal value of the MINLP that can be used to evaluate the quality of the local solution. Certainly, the efficiency of this evaluation is strongly dependent on the quality of the convex relaxation. Convex relaxations of general MINLPs can be constructed by replacing each nonlinear function occurring in the model description by convex underestimating and concave overestimating functions. In this setting, it is desired to use the best possible convex underestimator and concave overestimator of a given function over an underlying domain ¿ the so-called convex and concave envelope, respectively. However, the computation of these envelopes can be extremely difficult so that analytical expressions for envelopes are only available for some classes of well-structured functions. 252 pp. Englisch. Codice articolo 9783954044740
Compra nuovo
EUR 43,85
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Convex Relaxations for Mixed-Integer Nonlinear Programs
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextrnrnThis thesis deals with new techniques to construct a strong convex relaxation for a mixed-integer nonlinear program (MINLP). While local optimization software can quickly identify promising operating points of MINLPs, the solution. Codice articolo 75054363
Compra nuovo
EUR 43,85
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Convex Relaxations for Mixed-Integer Nonlinear Programs
Editore:
Cuvillier, Cuvillier Sep 2013, 2013
ISBN 10: 3954044749
ISBN 13: 9783954044740
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This thesis deals with new techniques to construct a strong convex relaxation for a mixed-integer nonlinear program (MINLP). While local optimization software can quickly identify promising operating points of MINLPs, the solution of the convex relaxation provides a global bound on the optimal value of the MINLP that can be used to evaluate the quality of the local solution. Certainly, the efficiency of this evaluation is strongly dependent on the quality of the convex relaxation.Convex relaxations of general MINLPs can be constructed by replacing each nonlinear function occurring in the model description by convex underestimating and concave overestimating functions. In this setting, it is desired to use the best possible convex underestimator and concave overestimator of a given function over an underlying domain - the so-called convex and concave envelope, respectively. However, the computation of these envelopes can be extremely difficult so that analytical expressions for envelopes are only available for some classes of well-structured functions.Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen 252 pp. Englisch. Codice articolo 9783954044740
Compra nuovo
EUR 43,85
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Convex Relaxations for Mixed-Integer Nonlinear Programs
Print on DemandDa: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This thesis deals with new techniques to construct a strong convex relaxation for a mixed-integer nonlinear program (MINLP). While local optimization software can quickly identify promising operating points of MINLPs, the solution of the convex relaxation provides a global bound on the optimal value of the MINLP that can be used to evaluate the quality of the local solution. Certainly, the efficiency of this evaluation is strongly dependent on the quality of the convex relaxation. Convex relaxations of general MINLPs can be constructed by replacing each nonlinear function occurring in the model description by convex underestimating and concave overestimating functions. In this setting, it is desired to use the best possible convex underestimator and concave overestimator of a given function over an underlying domain ¿ the so-called convex and concave envelope, respectively. However, the computation of these envelopes can be extremely difficult so that analytical expressions for envelopes are only available for some classes of well-structured functions. Codice articolo 9783954044740
Compra nuovo
EUR 43,85
Spedizione EUR 61,66
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Convex Relaxations for Mixed-Integer Nonlinear Programs
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Convex Relaxations for Mixed-Integer Nonlinear Programs | Martin Ballerstein | Taschenbuch | 252 S. | Englisch | 2013 | Cuvillier | EAN 9783954044740 | Verantwortliche Person für die EU: Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen, info[at]cuvillier[dot]de | Anbieter: preigu Print on Demand. Codice articolo 104315981
Compra nuovo
EUR 38,65
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili