0
Your cart

Your cart is empty

Books > Business & Economics > Business & management > Management & management techniques > Operational research

Buy Now

Nondifferentiable Optimization and Polynomial Problems (Paperback, Softcover reprint of the original 1st ed. 1998) Loot Price: R4,523
Discovery Miles 45 230
Nondifferentiable Optimization and Polynomial Problems (Paperback, Softcover reprint of the original 1st ed. 1998): N. Z. Shor

Nondifferentiable Optimization and Polynomial Problems (Paperback, Softcover reprint of the original 1st ed. 1998)

N. Z. Shor

Series: Nonconvex Optimization and Its Applications, 24

 (sign in to rate)
Loot Price R4,523 Discovery Miles 45 230 | Repayment Terms: R424 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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 form of inequality can be written in the form of equality by introducing a new variable: for example, P( x) 0 is equivalent to P(: e) + y2 = 0). Boolean and mixed polynomial problems can be written in usual form by adding for each boolean variable z the equality: Z2 - Z = O. Let a = {al, ..., a } be integer vector with nonnegative entries {a;}f=l. n Denote by R a](: e) monomial in n variables of the form: n R a](: e) = IT: ef';;=1 d(a) = 2:7=1 ai is the total degree of monomial R a]. Each polynomial in n variables can be written as sum of monomials with nonzero coefficients: P(: e) = L caR a](: e), aEA{P) IX x Nondifferentiable optimization and polynomial problems where A(P) is the set of monomials contained in polynomial P

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Nonconvex Optimization and Its Applications, 24
Release date: October 2011
First published: 1998
Authors: N. Z. Shor
Dimensions: 235 x 155 x 21mm (L x W x T)
Format: Paperback
Pages: 396
Edition: Softcover reprint of the original 1st ed. 1998
ISBN-13: 978-1-4419-4792-5
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Professional & Technical > Technology: general issues > Engineering: general
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Business & Economics > Business & management > Management & management techniques > Operational research
Books > Science & Mathematics > Mathematics > Optimization > General
LSN: 1-4419-4792-2
Barcode: 9781441947925

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners