15287

13731

كارشناسي ارشد

سيستم هاي اقتصادي و اجتماعي

اصفهان : دانشگاه صنعتي اصفهان

1398

پنج، 70ص.

ناصر ملاوردي

نادر شتاب بوشهري، مهدي ايرانپور

1398/08/25

كتابنامه

مهندسي صنايع

مهندسي صنايع و سيستم ها

1398/08/25

2569812

Inverse optimization of network problems minimum cost flow problem and maximum flow problem Ali Hojati Najafabadi September 1st 2019 Master of Science Thesis in Farsi Departement of Industrial Engineering Isfahan University of Technology Isfahan 84156 8311 IranSupervisor Dr Naser Molaverdi Keywords inverse optimization network problems minimum cost flow maximum flow sparse system linear inverse optimization non linear inverse optimization Abstract In this study inverse optimization is studied on two problems of network problems One is the problem of minimumcost flow which is the main problem of this research and the other the maximum flow problem as an example of theuse of work done has been discussed The modeling of the problems in this research is by using a sparse equationsystem And the kind of problem that is being considered is kind of non classical In this study inverse optimizationwith weighted Euclidean distance infinity norm and square norm are performed The work involves creating optimalconditions on a problem with an arbitrary point as the answer which may not be optimal and a vector of arbitrarycoefficients for the objective function This involves two approaches of applying a two stage inverse optimizationapproach to the problem and inverse problem optimization to adjust the coefficients of the problem constraints untiloptimality is achieved The results show that changing the norm of the objective function of the inverse problemdoes not cause much change in the computation and it is quite feasible to apply twice the inverse optimization on aproblem and not to damage the model Applications of this research include issues of production planning informationnetworks and circuits in electrical engineering

ناصر ملاوردي

نادر شتاب بوشهري، مهدي ايرانپور