Nondifferentiable optimization polynomial problems di shor (18 risultati)

hardcover. Condizione: Sehr gut. 413 Seiten; 9780792349976.2 Gewicht in Gramm: 1.

Condizione: New.

Condizione: New.

Condizione: New. In English.

Condizione: New. In English.

Condizione: New. This work is devoted to an investigation of polynomial optimization problems, including Boolean problems which are the most important part of mathematical programming. It demonstrates methods of nondifferentiable optimization that can be used for finding solutions to many polynomial problems. Series: Nonconvex Optimization and Its Applications. Num Pages: 413 pages, biography. BIC Classification: PBF; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 23. Weight in Grams: 758. . 1998. Hardback. . . . .…

Paperback. Condizione: Brand New. 412 pages. 9.45x6.30x0.94 inches. In Stock.

Condizione: New. This work is devoted to an investigation of polynomial optimization problems, including Boolean problems which are the most important part of mathematical programming. It demonstrates methods of nondifferentiable optimization that can be used for finding solutions to many polynomial problems. Series: Nonconvex Optimization and Its Applications. Num Pages: 413 pages, biography. BIC Classification: PBF; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 23. Weight in Grams: 758. . 1998. Hardback. . . . . Books ship from the US and Ireland.…

Condizione: gut. 1998. Nondifferentiable Optimization and Polynomial Problems (Nonconvex Optimization and Its Applications ; 24 In englischer Sprache. pages.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: As New. Unread book in perfect condition.

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 416 pp. Englisch.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.…

Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.…

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 416 pp. Englisch.…