| NOTE ON INVERSE PROBLEM WITH l∞ OBJECTIVE FUNCTION |
| |
| 作者姓名： | YANGXIAOGUANG |
| |
| 作者单位： | LaboratoryofManagement,DecisionandInformationSystems.InstituteofSystemsScience,AcademiaSinica,Beijing100080. |
| |
| 摘 要： | In this note, the author proves that the inverse problem of submodular function on digraphs with l∞ objective function can be solved by strongly polynomial algorithm. The result shows that most inverse network optimization problems with l∞ objective function can be solved in the polynomial time.
|
| 关 键 词： | 逆元问题 目标函数 强多项式算法 子模方程 网络最优化 |
| 收稿时间： | 30 April 1996 |
Note on inverse problem with l
∞ objective function |
| |
| YANGXIAOGUANG.Note on inverse problem with l
∞ objective function[J].Applied Mathematics A Journal of Chinese Universities,1998,13(3):341-346. |
| |
| Authors: | Yang Xiaoguang |
| |
| Institution: | (1) Laboratory of Management, Decision and Information Systems, Institute of Systems Science, Academia Sinica, 100080 Beijing |
| |
| Abstract: | In this note, the author proves that the inverse problem of submodular function on digraphs with l
∞ objective function can be solved by strongly polynomial algorithm. The result shows that most inverse network optimization
problems with l
∞ objective function can be solved in the polynomial time.
The work is supported by the National Natural Science Foundation of China (79791030). |
| |
| Keywords: | 68Q25 90B10 90C35 |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
