This reprint of the 1969 book of the same name is a concise, rigorous, yet accessible, account of the fundamentals of constrained optimization theory. Many problems arising in diverse fields such as machine learning, medicine, chemical engineering, structural design, and airline scheduling can be reduced to a constrained optimization problem. This book provides readers with the fundamentals needed to study and solve such problems. Beginning with a chapter on linear inequalities and theorems of the alternative, basics of convex sets and separation theorems are then derived based on these theorems. This is followed by a chapter on convex functions that includes theorems of the alternative for such functions. These results are used in obtaining the saddlepoint optimality conditions of nonlinear programming without differentiability assumptions.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
This reprint of the 1969 book of the same name is a concise, rigorous, yet accessible, account of the fundamentals of constrained optimization theory. Many problems arising in diverse fields such as machine learning, medicine, chemical engineering, structural design, and airline scheduling can be reduced to a constrained optimization problem. This book provides readers with the fundamentals needed to study and solve such problems. Beginning with a chapter on linear inequalities and theorems of the alternative, basics of convex sets and separation theorems are then derived based on these theorems. This is followed by a chapter on convex functions that includes theorems of the alternative for such functions. These results are used in obtaining the saddlepoint optimality conditions of nonlinear programming without differentiability assumptions.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 4,82 expédition depuis Etats-Unis vers France
Destinations, frais et délaisEUR 2,31 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisVendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
Paperback. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 0.75. N° de réf. du vendeur G0898713412I3N00
Quantité disponible : 1 disponible(s)
Vendeur : Rarewaves.com UK, London, Royaume-Uni
Paperback. Etat : New. This reprint of the 1969 book of the same name is a concise, rigorous, yet accessible account of the fundamentals of constrained optimization theory. Many problems arising in diverse fields such as machine learning, medicine, chemical engineering, structural design, and airline scheduling can be reduced to a constrained optimization problem. This book provides readers with the fundamentals needed to study and solve such problems.Beginning with a chapter on linear inequalities and theorems of the alternative, basics of convex sets and separation theorems are then derived based on these theorems. This is followed by a chapter on convex functions that includes theorems of the alternative for such functions. These results are used in obtaining the saddlepoint optimality conditions of nonlinear programming without differentiability assumptions. Properties of differentiable convex functions are derived and then used in two key chapters of the book, one on optimality conditions for differentiable nonlinear programs and one on duality in nonlinear programming. Generalizations of convex functions to pseudoconvex and quasiconvex functions are given and then used to obtain generalized optimality conditions and duality results in the presence of nonlinear equality constraints.The book has four useful self-contained appendices on vectors and matrices, topological properties of n-dimensional real space, continuity and minimization, and differentiable functions. N° de réf. du vendeur LU-9780898713411
Quantité disponible : 2 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. illustrated edition. 236 pages. 9.25x6.25x0.50 inches. In Stock. N° de réf. du vendeur __0898713412
Quantité disponible : 2 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. 1987. Paperback. . . . . . N° de réf. du vendeur V9780898713411
Quantité disponible : 1 disponible(s)
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
Paperback. Etat : New. This reprint of the 1969 book of the same name is a concise, rigorous, yet accessible account of the fundamentals of constrained optimization theory. Many problems arising in diverse fields such as machine learning, medicine, chemical engineering, structural design, and airline scheduling can be reduced to a constrained optimization problem. This book provides readers with the fundamentals needed to study and solve such problems.Beginning with a chapter on linear inequalities and theorems of the alternative, basics of convex sets and separation theorems are then derived based on these theorems. This is followed by a chapter on convex functions that includes theorems of the alternative for such functions. These results are used in obtaining the saddlepoint optimality conditions of nonlinear programming without differentiability assumptions. Properties of differentiable convex functions are derived and then used in two key chapters of the book, one on optimality conditions for differentiable nonlinear programs and one on duality in nonlinear programming. Generalizations of convex functions to pseudoconvex and quasiconvex functions are given and then used to obtain generalized optimality conditions and duality results in the presence of nonlinear equality constraints.The book has four useful self-contained appendices on vectors and matrices, topological properties of n-dimensional real space, continuity and minimization, and differentiable functions. N° de réf. du vendeur LU-9780898713411
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. InhaltsverzeichnisPreface to the Classic Edition 1. The Nonlinear Programming Problem, Preliminary Concepts, and Notation 2. Linear Inequalities and Theorems of the Alternative 3. Convex Sets in Rn 4. Convex and Concave Functions 5. N° de réf. du vendeur 898975772
Quantité disponible : 3 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 1514175-n
Quantité disponible : 3 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. 220. N° de réf. du vendeur 6279163
Quantité disponible : 3 disponible(s)
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Paperback. Etat : New. New copy - Usually dispatched within 4 working days. 331. N° de réf. du vendeur B9780898713411
Quantité disponible : 3 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 1514175-n
Quantité disponible : 3 disponible(s)