线性分数阶泛函的离散优化

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}
引用次数: 5

摘要

将一组应用问题的解简化为分数线性离散优化问题的解。包括经济、医疗、放置物品等任务。提出了求解无条件离散-分数-线性优化问题的最快方法,确定了所选解的最优性条件。基于这些最优性条件,提出了一种新的方法和算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信