- Home
- Mathematics
- Game Theory
- Introduction to Minimax
Introduction to Minimax
List Price:
$19.95
- Availability: Confirm prior to ordering
- Branding: minimum 50 pieces (add’l costs below)
- Check Freight Rates (branded products only)
Branding Options (v), Availability & Lead Times
- 1-Color Imprint: $2.00 ea.
- Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
- Belly-Band Wrap: $2.50 ea. (full-color printed)
- Set-Up Charge: $45 per decoration
- Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
- Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
- Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
- RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
Product Details
Author:
V. F. Dem'yanov, V. N. Malozemov, D. Louvish
Format:
Paperback
Pages:
320
Publisher:
Dover Publications (April 16, 2014)
Language:
English
ISBN-13:
9780486664231
ISBN-10:
0486664236
Weight:
15.6oz
Dimensions:
6.14" x 9.21"
Case Pack:
26
Series:
Dover Books on Mathematics
File:
Dover-Dover_09022026_P10562608_onix30_Complete-20260901.xml
Folder:
Dover
As low as:
$18.95
List Price:
$19.95
Publisher Identifier:
P-DOVER
Discount Code:
D
Audience:
College/higher education
Pub Discount:
65
Imprint:
Dover Publications
Overview
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.
