Librería: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Alemania
EUR 9,95
Cantidad disponible: 1 disponibles
Añadir al carritoBroschiert. Condición: Gut. 244 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 440.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 115,65
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 142,75
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 264.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 153,95
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 264 pages. 9.61x6.69x0.60 inches. In Stock.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 1985
ISBN 10: 3540159967 ISBN 13: 9783540159964
Librería: moluna, Greven, Alemania
EUR 118,64
Cantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: New. Infinite programming may be defined as the study of mathematical programming problems in which the number of variables and the number of constraints are both possibly infinite. Many optimization problems in engineering, operations research, and economics ha.
Librería: Buchpark, Trebbin, Alemania
EUR 82,90
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: Sehr gut. Zustand: Sehr gut | Seiten: 264 | Sprache: Englisch | Produktart: Bücher | Infinite programming may be defined as the study of mathematical programming problems in which the number of variables and the number of constraints are both possibly infinite. Many optimization problems in engineering, operations research, and economics have natural formul- ions as infinite programs. For example, the problem of Chebyshev approximation can be posed as a linear program with an infinite number of constraints. Formally, given continuous functions f,gl,g2, ¿¿¿ ,gn on the interval [a,b], we can find the linear combination of the functions gl,g2, . ,gn which is the best uniform approximation to f by choosing real numbers a,xl,x2, ¿. ,x to n minimize a t¿ [a,b]. This is an example of a semi-infinite program; the number of variables is finite and the number of constraints is infinite. An example of an infinite program in which the number of constraints and the number of variables are both infinite, is the well-known continuous linear program which can be formulated as follows. T minimize ~ c(t)Tx(t)dt t b(t) , subject to Bx(t) + fo Kx(s)ds x(t) . 0, t ¿ [0, T] ¿ If x is regarded as a member of some infinite-dimensional vector space of functions, then this problem is a linear program posed over that space. Observe that if the constraint equations are differentiated, then this problem takes the form of a linear optimal control problem with state IV variable inequality constraints.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 169,50
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Very Good. Very Good. book.
Idioma: Inglés
Publicado por Springer, Berlin, Springer, 1985
ISBN 10: 3540159967 ISBN 13: 9783540159964
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 144,93
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware - Infinite programming may be defined as the study of mathematical programming problems in which the number of variables and the number of constraints are both possibly infinite. Many optimization problems in engineering, operations research, and economics have natural formul- ions as infinite programs. For example, the problem of Chebyshev approximation can be posed as a linear program with an infinite number of constraints. Formally, given continuous functions f,gl,g2, --- ,gn on the interval [a,b], we can find the linear combination of the functions gl,g2, . ,gn which is the best uniform approximation to f by choosing real numbers a,xl,x2, -. ,x to n minimize a tEUR [a,b]. This is an example of a semi-infinite program; the number of variables is finite and the number of constraints is infinite. An example of an infinite program in which the number of constraints and the number of variables are both infinite, is the well-known continuous linear program which can be formulated as follows. T minimize ~ c(t)Tx(t)dt t b(t) , subject to Bx(t) + fo Kx(s)ds x(t) . 0, t EUR [0, T] - If x is regarded as a member of some infinite-dimensional vector space of functions, then this problem is a linear program posed over that space. Observe that if the constraint equations are differentiated, then this problem takes the form of a linear optimal control problem with state IV variable inequality constraints.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 148,87
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 264 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 148,29
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 264.