Stock image for illustration purposes only - book cover, edition or condition may vary.
Nondifferentiable Optimization and Polynomial Problems (Nonconvex Optimization and Its Applications (closed))
N.Z. Shor
€ 181.98
FREE Delivery in Ireland
Description for Nondifferentiable Optimization and Polynomial Problems (Nonconvex Optimization and Its Applications (closed))
Paperback. Series: Nonconvex Optimization and Its Applications. Num Pages: 396 pages, biography. BIC Classification: KJT; PBU; PBV; TBC; UYA. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 21. Weight in Grams: 635.
Polynomial extremal problems (PEP) constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. Let :e = {:e 1, ... , :en} be the vector in n-dimensional real linear space Rn; n PO(:e), PI (:e), ... , Pm (:e) are polynomial functions in R with real coefficients. In general, a PEP can be formulated in the following form: (0.1) find r = inf Po(:e) subject to constraints (0.2) Pi (:e) =0, i=l, ... ,m (a constraint in the ... Read more
Polynomial extremal problems (PEP) constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. Let :e = {:e 1, ... , :en} be the vector in n-dimensional real linear space Rn; n PO(:e), PI (:e), ... , Pm (:e) are polynomial functions in R with real coefficients. In general, a PEP can be formulated in the following form: (0.1) find r = inf Po(:e) subject to constraints (0.2) Pi (:e) =0, i=l, ... ,m (a constraint in the ... Read more
Product Details
Format
Paperback
Publication date
2011
Publisher
Springer
Condition
New
Series
Nonconvex Optimization and Its Applications
Number of Pages
396
Place of Publication
New York, NY, United States
ISBN
9781441947925
SKU
V9781441947925
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Nondifferentiable Optimization and Polynomial Problems (Nonconvex Optimization and Its Applications (closed))