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

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.

deterioration cost

inconsistent convex programs

subgradient methods

Lagrangian dual

preventive maintenance

ergodic sequences

maintenance scheduling

primal recovery

Pascal, Matematiska vetenskaper, Chalmers tvärgata 3, Chalmers Tekniska Högskola
Opponent: Nils-Hassan Quttineh

Author

Magnus Önnheim

University of Gothenburg

Chalmers, Mathematical Sciences, Mathematics

The opportunistic replacement problem: theoretical analyses and numerical tests

Mathematical Methods of Operations Research,; Vol. 76(2012)p. 289-319

Journal article

Nonsmooth convex optimization—theory and solution methodology

Chalmers, 1998-07-01 -- 2020-12-31.

Naturvetenskapliga Forskningsrådet, 1998-07-01 -- 2022-12-31.

Subject Categories

Mathematics

Computational Mathematics

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

Publisher

Chalmers

Pascal, Matematiska vetenskaper, Chalmers tvärgata 3, Chalmers Tekniska Högskola

Opponent: Nils-Hassan Quttineh

More information

Latest update

10/22/2020