CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Optimization of Maintenance Planning for Multi-Component Systems, and Primal-Dual Convergence Characterizations in Convex Optimization

Magnus Önnheim (Institutionen för matematiska vetenskaper, matematik)
Göteborg : Chalmers University of Technology, 2013. - 111 s.

This thesis considers two topics within mathematical programming. The first topic is an investigation into the behaviour of primal-dual subgradient algorithms with primal ergodic averaging in the case where it is not known a priori whether the primal program is consistent or not. In particular it is shown that, in the case of convex primal programs, relevant information can be obtained regardless of the consistency of the primal program. The second topic is that of maintenance optimization of multi-component systems. It is that mathematical programming techniques of the combinatorial type can be used successfully to plan maintenance of multi-component system where components are interdependent in a non-trivial way.

Nyckelord: subgradient methods, Lagrangian dual, primal recovery, inconsistent convex programs, ergodic sequences, maintenance scheduling, preventive maintenance, deterioration cost

Denna post skapades 2013-05-20.
CPL Pubid: 177110


Institutioner (Chalmers)

Institutionen för matematiska vetenskaper, matematik (2005-2016)


Tillämpad matematik
Optimeringslära, systemteori

Chalmers infrastruktur

Relaterade publikationer

Inkluderade delarbeten:

The opportunistic replacement problem: theoretical analyses and numerical tests


Datum: 2013-06-18
Tid: 13:15
Lokal: Pascal, Matematiska vetenskaper, Chalmers tvärgata 3, Chalmers Tekniska Högskola
Opponent: Nils-Hassan Quttineh

Ingår i serie

Preprint - Department of Mathematical Sciences, Chalmers University of Technology and Göteborg University