{"title":"群体预防性置换的最优与次优策略","authors":"A. Haurie, P. L'Ecuyer","doi":"10.1109/CDC.1980.271904","DOIUrl":null,"url":null,"abstract":"The group preventive replacement problem is formulated in continuous time for a multicomponent system having identical elements. The Dynamic Programming equation is obtained in the framework of the theory of optimal control of Jump processes. A discrete time version of the model is used for the numerical computation of optimal and suboptimal strategies of group preventive replacement. A monotonicity property of the Bellman functional (or cost-to-go function) is stated and serves to reduce the size of the computational problem.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimal and suboptimal strategies for group preventive replacement\",\"authors\":\"A. Haurie, P. L'Ecuyer\",\"doi\":\"10.1109/CDC.1980.271904\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The group preventive replacement problem is formulated in continuous time for a multicomponent system having identical elements. The Dynamic Programming equation is obtained in the framework of the theory of optimal control of Jump processes. A discrete time version of the model is used for the numerical computation of optimal and suboptimal strategies of group preventive replacement. A monotonicity property of the Bellman functional (or cost-to-go function) is stated and serves to reduce the size of the computational problem.\",\"PeriodicalId\":332964,\"journal\":{\"name\":\"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1980-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1980.271904\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1980.271904","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal and suboptimal strategies for group preventive replacement
The group preventive replacement problem is formulated in continuous time for a multicomponent system having identical elements. The Dynamic Programming equation is obtained in the framework of the theory of optimal control of Jump processes. A discrete time version of the model is used for the numerical computation of optimal and suboptimal strategies of group preventive replacement. A monotonicity property of the Bellman functional (or cost-to-go function) is stated and serves to reduce the size of the computational problem.