Similar Search Results

Optimal control of pollutants with delayed stock accumulation

Winkler, Ralph - 2008

We study the optimal control of a pollutant that accumulates with a delay.We find that optimal paths are, in general, non-monotonic and oscillatory, but monotonic if the objective function is additively separable. Hence, using additively separable objective functions as an approximation to a...

Persistent link: https://www.econbiz.de/10011753155

Was Harold Zurcher myopic after all? Replicating Rust's engine replacement estimates

Ferrall, Christopher - 2021

fixed point algorithm developed in the paper which became the basis of an ongoing empirical literature. The p-value of the …

Persistent link: https://www.econbiz.de/10012670902

Reducing the elastic generalized assignment problem to the standard generalized assignment problem

Büther, Marcel - 2007

The elastic generalized assignment problem (eGAP) is a natural extension of the generalized assignment problem (GAP) where the capacities are not fixed but can be adjusted which is expressed by continuous variables. These variables might be un-bounded or restricted by a lower or upper bound,...

Persistent link: https://www.econbiz.de/10011558704

Beam search for the elastic generalized assignment problem

Büther, Marcel - 2008

variables might be unbounded or restricted by a lower or upper bound, respectively. This paper describes an algorithm based on …

Persistent link: https://www.econbiz.de/10011558706

Zur Rolle einer optimierten Verteilung von Sicherheiten im Risikomanagement: Motivation, Modellierung und Implikationen

Börstler, Daniel; Mölls, Sascha H. - 2010

Die Erfahrungen aus der jüngsten Finanzmarktkrise zeigen, dass der gezielten Abschätzung und Steuerung von Kreditrisiken in Banken eine enorme betriebs- und volkswirtschaftliche Bedeutung zukommt. Sowohl in der internen Kreditrisikomessung als auch bei den zugehörigen gesetzlichen Vorgaben...

Persistent link: https://www.econbiz.de/10011558723

Lagrangean relaxation for scheduling projects under resource constraints to maximize the net present value

Kimms, Alf - 1999

Resource-constrained project scheduling under a net present value objective attracts growing interest. Because this is an NP-hard problem, it is unlikely that optimum solutions can be computed for large instances. Thus, heuristics have become a popular research field. Up to now, however, tight...

Persistent link: https://www.econbiz.de/10011558745

Self-adapting genetic algorithms with an application to project scheduling

Hartmann, Sönke - 1999

. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or … such cases, we suggest to include alternative components into the genetic algorithm. Indicating the component to be … actually used in the genotype, this allows the genetic algorithm to adapt itself. That is, the genetic algorithm learns which …

Persistent link: https://www.econbiz.de/10011558747

Instrumente zur operativen Entscheidung über Eigenfertigung und Fremdbezug

Sprecher, Arno; Konle, Matthias - 1999

In der vorliegenden Untersuchung wird die operative Entscheidung über Eigenfertigung und Fremdbezug betrachtet. Exemplarisch wird dargelegt, dass klassische Entscheidungshilfen unwirtschaftliche Ergebnisse hervorbringen. Die qualitative und quantitative Fehlspezifikation der Fremdbezugsprodukte...

Persistent link: https://www.econbiz.de/10011558757

Standardization in information systems

Kimms, A. - 2001

On a very abstract level, an information system consists of a set of system elements which communicate with each other. Communication is an unproductive operation, so the time needed to communicate data should be kept as short as possible and, to put it in monetary terms, the opportunity costs...

Persistent link: https://www.econbiz.de/10011558768

A note on capacitated lot sizing with setup carry-over

Briskorn, D. - 2004

use subgradient optimization and a dynamic programming algorithm to solve the corresponding subproblems optimally. The … present paper elucidates that this algorithm does not necessarily provide the optimal solution of the subproblem. Additionally …

Persistent link: https://www.econbiz.de/10011558795