This user-friendly text offers a thorough introduction to the part of optimization theory that lies between approximation theory and mathematical programming, both linear and nonlinear. Written by two distinguished mathematicians, the expert treatment covers the essentials, incorporating important background materials, examples, and extensive notes.
Geared toward advanced undergraduate and graduate students of mathematical programming, the text explores best approximation by algebraic polynomials in both discrete and continuous cases; the discrete problem, with and without constraints; the generalized problem of nonlinear programming; and the continuous minimax problem. Several appendixes discuss algebraic interpolation, convex sets and functions, and other topics. 1974 edition.
Geared toward advanced undergraduate and graduate students of mathematical programming, the text explores best approximation by algebraic polynomials in both discrete and continuous cases; the discrete problem, with and without constraints; the generalized problem of nonlinear programming; and the continuous minimax problem. Several appendixes discuss algebraic interpolation, convex sets and functions, and other topics. 1974 edition.
Payez facilement par carte, Klarna, Apple Pay ou Google Pay. Pas satisfait ? Vous avez toujours une garantie de remboursement de 14 jours. En savoir plus dans nos conditions. Si vous avez des questions, envoyez-nous un e-mail à hello@memmo.org.
Memmo facilite tes études, où que tu sois dans le monde. On rassemble tes manuels de cours et des outils d'étude intelligents au même endroit : résumés, quiz, podcasts et flashcards. Et il y a Ted, ton compagnon d'étude qui répond à toutes tes questions. Plus de 50 000 étudiants étudient déjà ici – conçu pour t'aider à apprendre plus vite et à moins stresser.
Tu pourrais aussi aimer
Acheter le livre0