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 条

[11] Inverse combinatorial optimization: A survey on problems, methods, and results [J].

Heuberger, C .

JOURNAL OF COMBINATORIAL OPTIMIZATION, 2004, 8 (03) :329-361

[12]

Robert J V, 2001, MANAGEMENT SCI, V37

[13] A PARAMETRIC METHOD FOR SOLVING THE LINEAR FRACTIONAL-PROGRAMMING PROBLEM [J].

WOLF, H .

OPERATIONS RESEARCH, 1985, 33 (04) :835-841

[14] The fractional minimal cost flow problem on network [J].

Xu, Cheng ;

Xu, Xiao-ming ;

Wang, Hai-feng .

OPTIMIZATION LETTERS, 2011, 5 (02) :307-317

[15]

Xu Shaoji, 1995, Japan J. Ind. Appl. Math., V12, P47, DOI DOI 10.1007/BF03167381

[16]

Yang C., 1997, Optimization, V40, P147

[17]

Zhang J Z, 1999, LINEAR PROGRAMMING

[18]

Zhang J Z, 1995, ZOR MATH METHODS OPE, V41, P347

[19] Inverse problem of minimum cuts [J].

Zhang, JZ ;

Cai, MC .

MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 1998, 47 (01) :51-58

[20] A further study on inverse linear programming problems [J].

Zhang, JZ ;

Liu, ZH .

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1999, 106 (02) :345-359

← 1 2 3 →