{"title":"线性多目标优化问题的一种计算方法","authors":"H. Shen, J. Lin","doi":"10.1109/CDC.1975.270578","DOIUrl":null,"url":null,"abstract":"An algorithm for finding the set of all Pareto-optimal solutions of a linear multiple-objective optimization problem is presented in this paper. This algorithm is successful in detecting any Pareto-optimal solution and will systematically and efficiently determine the entire set of Pareto-optimal solutions. An example is given to illustrate the algorithm.","PeriodicalId":164707,"journal":{"name":"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1975-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A computational method for linear multiple-objective optimization problems\",\"authors\":\"H. Shen, J. Lin\",\"doi\":\"10.1109/CDC.1975.270578\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algorithm for finding the set of all Pareto-optimal solutions of a linear multiple-objective optimization problem is presented in this paper. This algorithm is successful in detecting any Pareto-optimal solution and will systematically and efficiently determine the entire set of Pareto-optimal solutions. An example is given to illustrate the algorithm.\",\"PeriodicalId\":164707,\"journal\":{\"name\":\"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1975-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1975.270578\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1975.270578","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A computational method for linear multiple-objective optimization problems
An algorithm for finding the set of all Pareto-optimal solutions of a linear multiple-objective optimization problem is presented in this paper. This algorithm is successful in detecting any Pareto-optimal solution and will systematically and efficiently determine the entire set of Pareto-optimal solutions. An example is given to illustrate the algorithm.