Sökning: "implied constraints"
Visar resultat 1 - 5 av 10 avhandlingar innehållade orden implied constraints.
1. Analysis, synthesis and application of automaton-based constraint descriptions
Sammanfattning : Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjunction of constraints on variables ranging over given initial domains, and optionally an objective function on the variables. Such a model is given to a general-purpose solver performing systematic search to find constraint-satisfying domain values for the variables, giving an optimal value to the objective function. LÄS MER
2. Fish foraging under visual constraints
Sammanfattning : Visual conditions are changing in several different ways. Some lakes are getting turbid due to eutrophication or erosion while others are getting browner due to brownification. These two types of visual degradation results in completely different optical properties of lakes. LÄS MER
3. The market impact of short-sale constraints
Sammanfattning : The thesis addresses two areas of research within financial economics: empirical asset pricing and the borderline area between finance and economics with emphasis on econometrical methods. The empirical asset pricing section considers the effects of short-sale constraints on both the stock market as well as the derivatives market. LÄS MER
4. Optimal Decisions in the Equity Index Derivatives Markets Using Option Implied Information
Sammanfattning : This dissertation is centered around two comprehensive themes: the extraction of information embedded in equity index option prices, and how to use this information in order to be able to make optimal decisions in the equity index option markets. These problems are important for decision makers in the equity index options markets, since they are continuously faced with making decisions under uncertainty given observed market prices. LÄS MER
5. Function Variables for Constraint Programming
Sammanfattning : Quite often modelers with constraint programming (CP) use the same modelling patterns for different problems, possibly from different domains. This results in recurring idioms in constraint programs. Our approach can be seen as a three-step approach. First, we identify some of these recurring patterns in constraint programs. LÄS MER