Some inverse optimization problems on network

被引：1

作者：

Xu Cheng ^{[1
,2
]}

Xu Xiaoming ^{[1
]}

机构：

[1] Shanghai Univ Sci & Technol, Sch Management, Shanghai 200093, Peoples R China

[2] Qingdao Univ, Coll Math, Qingdao 266071, Peoples R China

来源：

JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY | 2013年 / 26卷 / 03期

关键词：

Dual problem; fractional minimum cost flow problem; gain network; inverse problem; SHORTEST PATHS PROBLEM; COSTS;

D O I：

10.1007/s11424-013-0259-x

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper, the authors consider some inverse problems on network, such as the inverse transport problems with gains (IGTP) and the inverse linear fractional minimum cost flow problem (IFFP). Firstly, the authors give the mathematics model of (IGTP) and an efficient method of solving it under l (1) norm; Secondly, taking advantage of the optimality conditions, the authors consider the (IFFP) and give a simple method of solving it. Finally, an numerical example test is also developed.

引用

页码：350 / 364

页数：15

共 21 条

[1]

Ahuja R. K., 1998, WORKING PAPER

[2]

[Anonymous], 1983, Z OPER RES, DOI DOI 10.1007/BF01916898

[3]

Bondy J. A., 1976, Graduate Texts in Mathematics, V290

[4]

Burton D, 1997, LECT NOTES ECON MATH, V450, P156

[5] ON THE USE OF AN INVERSE SHORTEST PATHS ALGORITHM FOR RECOVERING LINEARLY CORRELATED COSTS [J].

BURTON, D ;

TOINT, PL .

MATHEMATICAL PROGRAMMING, 1994, 63 (01) :1-22

[6] ON AN INSTANCE OF THE INVERSE SHORTEST PATHS PROBLEM [J].

BURTON, D ;

TOINT, PL .

MATHEMATICAL PROGRAMMING, 1992, 53 (01) :45-61

[7] Linear fractional programming and duality [J].

Chadha, S. S. ;

Chadha, Veena .

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2007, 15 (02) :119-125

[8]

Demange M, 2010, INTRO INVERSE COMBIN

[9] Some inverse optimization problems under the Hamming distance [J].

Duin, CW ;

Volgenant, A .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 170 (03) :887-899

[10]

Guan M., 1983, LINEAR PROGRAMMING

← 1 2 3 →