Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Engleski
293 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
Meki uvez
7.89
€
/
Meki uvez
15.39
€
/
Meki uvez
26.12
€
/
Meki uvez
10.32
€
/
Meki uvez
8.30
€
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.
Informacije o knjizi
Engleski
Kategorija
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Karte
17.31
€
