CSpace
A further study on inverse linear programming problems
Zhang, JZ; Liu, ZH
1999-06-30
发表期刊JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
ISSN0377-0427
卷号106期号:2页码:345-359
摘要In this paper we continue our previous study (Zhang and Liu, J. Comput. Appl. Math. 72 (1996) 261-273) on inverse linear programming problems which requires us to adjust the cost coefficients of a given LP problem as less as possible so that a known feasible solution becomes the optimal one. In particular, we consider the cases in which the given feasible solution and one optimal solution of the LP problem are 0-1 vectors which often occur in network programming and combinatorial optimization and give very simple methods for solving this type of inverse LP problems. Besides, instead of the commonly used I-j measure, we also consider the inverse LP problems under l infinity measure and propose solution methods. (C) 1999 Elsevier Science B.V. All rights reserved.
关键词inverse problem linear programming complementary slackness shortest path minimum spanning toe
语种英语
WOS研究方向Mathematics
WOS类目Mathematics, Applied
WOS记录号WOS:000081088700009
出版者ELSEVIER SCIENCE BV
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/14130
专题中国科学院数学与系统科学研究院
作者单位1.City Univ Hong Kong, Dept Math, Hong Kong, Peoples R China
2.Acad Sinica, Inst Syst Sci, Beijing 100039, Peoples R China
推荐引用方式
GB/T 7714
Zhang, JZ,Liu, ZH. A further study on inverse linear programming problems[J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS,1999,106(2):345-359.
APA Zhang, JZ,&Liu, ZH.(1999).A further study on inverse linear programming problems.JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS,106(2),345-359.
MLA Zhang, JZ,et al."A further study on inverse linear programming problems".JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 106.2(1999):345-359.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhang, JZ]的文章
[Liu, ZH]的文章
百度学术
百度学术中相似的文章
[Zhang, JZ]的文章
[Liu, ZH]的文章
必应学术
必应学术中相似的文章
[Zhang, JZ]的文章
[Liu, ZH]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。