๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions

โœ Scribed by M. S. Bazaraa; J. J. Goode; R. L. Rardin

Book ID
105009463
Publisher
Springer
Year
1978
Tongue
English
Weight
284 KB
Volume
25
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A planning horizon algorithm for determi
A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs
โœ Alain Bensoussan; Jean-Marie Proth; Maurice Queyranne ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 551 KB

We consider a single-product, discrete-time productioniinventory-control problem with nonstationary concave nondecreasing costs. Given a forecast horizon K . the problem is to find a decision horizon. We specialize to piecewise linear costs a general approach whereby a problem with horizon K + 1 and

A unified treatment of superconvergent r
A unified treatment of superconvergent recovered gradient functions for piecewise linear finite element approximations
โœ G. Goodsell; J. R. Whiteman ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 523 KB

Piecewise linear finite element approximations to two-dimensional Poisson problems are treated. For simplicity, consideration is restricted to problems having Dirichlet boundary conditions and defined on rectangular domains R which are partitioned by a uniform triangular mesh. It is also required th