Effective risk management requires adequate risk measurement. A basic problem herein is the quantification of market risks: what is the overall effect on a portfolio if market rates change? First, a mathematical problem statement is given and the concept of `Maximum Loss' (ML) is introduced as a...

Effective risk management requires adequate risk measurement. A basic problem herein is the quantification of market risks: what is the overall effect on a portfolio if market rates change? First, a mathematical problem statement is given and the concept of `Maximum Loss' (ML) is introduced as a...

This chapter provides a survey of the recent work on learning in the context of macroeconomics. Learning has several roles. First, it provides a boundedly rational model of how rational expectations can be achieved. Secondly, learning acts as a selection device in models with multiple REE...

This chapter is concerned with numerical simulation of dynamic economic models. We focus on some basic algorithms and assess their accuracy and stability properties. This analysis is useful for an optimal implementation and testing of these procedures, as well as to evaluate their performance....

The problem of allocating scarce resources over time to perform a given set of activities - that is, project scheduling - appears in the vast spectrum of real-world situations. Over the last forty years project scheduling problems have been carefully studied, resulting in a considerable body of...

At a practical level, mathematical programming under multiple objectives has emerged as a powerful tool to assist in the process of searching for decisions which best satisfy a multitude of conflicting objectives, and there are a number of distinct methodologies for multicriteria decision-making...

We consider two “minimum”NP-hard job shop scheduling problems to minimize the makespan. In one of the problems every job has to be processed on at most two out of three available machines. In the other problem there are two machines, and a job may visit one of the machines twice. For each...

We consider two “minimum”NP-hard job shop scheduling problems to minimize the makespan. In one of the problems every job has to be processed on at most two out of three available machines. In the other problem there are two machines, and a job may visit one of the machines twice. For each...