N. Mamatov, A. Samijonov, Z. Yuldashev, N. Niyozmatova
{"title":"线性分数阶泛函的离散优化","authors":"N. Mamatov, A. Samijonov, Z. Yuldashev, N. Niyozmatova","doi":"10.1109/OPCS.2019.8880208","DOIUrl":null,"url":null,"abstract":"The solution of a set of applied problems is reduced to the solution of problems of fractional-linear discrete optimization. Including economic, medical tasks, tasks of placing objects, etc. The article proposes the fastest method for solving an unconditional discrete-fractional-linear optimization problem, determines the optimality conditions of the selected solution. Based on these conditions of optimality, a new method and algorithm are proposed.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Discrete Optimization of Linear Fractional Functionals\",\"authors\":\"N. Mamatov, A. Samijonov, Z. Yuldashev, N. Niyozmatova\",\"doi\":\"10.1109/OPCS.2019.8880208\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The solution of a set of applied problems is reduced to the solution of problems of fractional-linear discrete optimization. Including economic, medical tasks, tasks of placing objects, etc. The article proposes the fastest method for solving an unconditional discrete-fractional-linear optimization problem, determines the optimality conditions of the selected solution. Based on these conditions of optimality, a new method and algorithm are proposed.\",\"PeriodicalId\":288547,\"journal\":{\"name\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OPCS.2019.8880208\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OPCS.2019.8880208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Discrete Optimization of Linear Fractional Functionals
The solution of a set of applied problems is reduced to the solution of problems of fractional-linear discrete optimization. Including economic, medical tasks, tasks of placing objects, etc. The article proposes the fastest method for solving an unconditional discrete-fractional-linear optimization problem, determines the optimality conditions of the selected solution. Based on these conditions of optimality, a new method and algorithm are proposed.