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

An enumerative algorithm for solving nonconvex dynamic DEA models

โœ Scribed by M. Soleimani-damaneh

Book ID
118815446
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
201 KB
Volume
7
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An extragradient algorithm for solving g
An extragradient algorithm for solving general nonconvex variational inequalities
โœ Muhammad Aslam Noor ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 251 KB

In this work, we suggest and analyze an extragradient method for solving general nonconvex variational inequalities using the technique of the projection operator. We prove that the convergence of the extragradient method requires only pseudomonotonicity, which is a weaker condition than requiring m

Algorithms for solving dynamic models wi
Algorithms for solving dynamic models with occasionally binding constraints
โœ Lawrence J. Christiano; Jonas D.M. Fisher ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 669 KB

We describe and compare several algorithms for approximating the solution to a model in which inequality constraints occasionally bind. Their performance is evaluated and compared using various parameterizations of the one sector growth model with irreversible investment. We develop parameterized ex

An Algorithm for Incorporating Subsystem
An Algorithm for Incorporating Subsystem Models into Overall Dynamic System Models
โœ Donald L. Margolis ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 615 KB

## Bond graphs are used to construct finite mode representations of inherently distributed systems. These systems are, perhaps, only part of an overall dynamic system. The "causal" ~~~or~arion provided by the bond graph permits the deri#at~on of an automarable algorithm which produces the state eq