Kontakt
Kako nakupovati
Dostava
Svetovalec pri nakupu
Angleščina
293 b
Do 30 dni za vračilo
Drugi so kupili tudi
/
Mehka
14.25
€
/
Mehka
16.18
€
/
Mehka
9.80
€
/
Mehka
7.78
€
In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered. §Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. §As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. Numerical approximation with respect to I 1 and I 4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. §Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.
O knjigi
Angleščina
Kategorije
Podarite to knjigo še danes
To je povsem preprosto
1 Dodajte knjigo v košarico in izberite dostavo kot darilo 2 V zameno vam bomo poslali kupon 3 Knjiga bo dostavljena na naslov obdarovancaMorda bi vas zanimalo tudi
/
Karte
16.18
€
