Sökning: "Optimeringslära Linköping"
Visar resultat 1 - 5 av 40 avhandlingar innehållade orden Optimeringslära Linköping.
1. Multi-year maintenance optimisation for paved public roads - segment based modelling and price-directive decomposition
Sammanfattning : I avhandlingen studeras hur kostnadseffektiva underhålls- (uh-)planer för belagd väg kan genereras, på basis av information om aktuellt vägytetillstånd och funktionella modeller för kostnads- och tillståndsförändringar, delvis utvecklade i samarbete med svenska Vägverket (VV). Tilltänkt användning är på strategisk och programnivå, innan mer detaljerad objektinformation finns att tillgå. LÄS MER
2. Inverse Shortest Path Routing Problems in the Design of IP Networks
Sammanfattning : This thesis is concerned with problems related to shortest pathrouting (SPR) in Internet protocol (IP) networks. In IP routing, alldata traffic is routed in accordance with an SPR protocol, e.g. OSPF. LÄS MER
3. Application of operations research in operative planning in the forest industry
Sammanfattning : The focus of this thesis is the use of Operations Research for pplications in the forest industry. Optimization models and methods have been developed for problems in the forest supply chain and they have been integrated in decision support systems. The problems considered in this thesis are operative with a planning horizon of less than a month. LÄS MER
4. Supply chain optimization in the forest industry
Sammanfattning : The scope of this thesis is modelling and solving large-scale planning problems in the supply chain within the forest industry. Five research papers are included, the first three of which focus on the modelling, and the last two on the solution methods. LÄS MER
5. Feasible Direction Methods for Constrained Nonlinear Optimization : Suggestions for Improvements
Sammanfattning : This thesis concerns the development of novel feasible direction type algorithms for constrained nonlinear optimization. The new algorithms are based upon enhancements of the search direction determination and the line search steps. LÄS MER