Skip to main navigation Skip to search Skip to main content

An optimization model for inventory spares under multi-constraints and its decomposition algorithm

Research output: Contribution to journalArticlepeer-review

Abstract

An optimization problem of inventory spares under multi-constraints was studied. Its optimization model was set up and an optimization algorithm was presented. It is the steps to find the optimal solution of original problem that the constraints of inventory spares are relaxed by the Lagrange relaxation to make sub-problem only be optimal problem of inventory capacity function of single product; the Lagrange multiplier is updated by the sub-gradient method and the optimal solution of each sub-problem is obtained by the line search; the final solution of original problem is obtained by the Lagrange heuristic method. The proposed method can provide a new way for solving optimization prblem of inventory spares under multi-constraints.

Original languageEnglish
Pages (from-to)247-251
Number of pages5
JournalBinggong Xuebao/Acta Armamentarii
Volume30
Issue number2
StatePublished - Feb 2009

Keywords

  • Aerospace system engineering
  • Lagrange relaxation
  • Multi-constraints
  • Optimizing
  • Spares inventory

Fingerprint

Dive into the research topics of 'An optimization model for inventory spares under multi-constraints and its decomposition algorithm'. Together they form a unique fingerprint.

Cite this