Get Free Shipping on orders over $79
Separable Programming : Theory and Methods - S.M. Stefanov

Separable Programming

Theory and Methods

By: S.M. Stefanov

Hardcover | 31 May 2001

At a Glance

Hardcover


$169.75

or 4 interest-free payments of $42.44 with

 or 

Ships in 5 to 7 business days

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 I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well.
Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.

More in Production & Industrial Engineering

Manufacturing Engineering and Technology in SI Units : 8th Edition - Serope Kalpakjian
The Site Reliability Workbook : Practical ways to implement SRE - Betsy Beyer
Rules of Thumb for Maintenance and Reliability Engineers - R. Keith Mobley
Systems Engineering : Design Principles and Models - Dahai Liu

RRP $173.00

$126.75

27%
OFF