ISSN:
1436-4646
Keywords:
Approximating Functions
;
Convex Programming
;
Inventory Control
;
Contractive Maps
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract This paper studies an optimization problem in which the objective function can not be completely given in closed form. In particular, we assume that some part of the objective function must be computed by an approximation process. This paper develops a technique for solving a class of such problems. Examples demonstrating the technique and problem areas in which it has been successfully applied are also given.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01589333
Permalink