A new relaxation technique based on fractional representation to solve bilinear models: Application to the long horizon crude oil scheduling problem

	A new relaxation technique based on fractional representation to solve bilinear models: Application to the long horizon crude oil scheduling problem
AUT Journal of Mathematics and Computing
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 18 بهمن 1402
نوع مقاله: Original Article
شناسه دیجیتال (DOI): 10.22060/ajmc.2024.22240.1142
نویسندگان
Mohammad Nasir Yarahmadi؛ Seyyed Ali MirHassani^* ؛ Farnaz Hooshmand
Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Iran
چکیده
This paper proposes a novel relaxation technique based on the fractional representation of bilinear terms. This technique is embedded into an iterative two-step MILP-NLP algorithm based on piecewise relaxation and domain reduction strategies. To evaluate the performance of the algorithm, it is compared to the recently addressed iterative MILP-NLP algorithm based on piecewise McCormick relaxation techniques over a variety of instances. Our method is also applied to the crude oil scheduling problem as an application. The results confirm the efficiency of the proposed algorithm from both solution quality and running time.
کلیدواژه‌ها
Bilinear programming problem؛ Two-step MILP-NLP algorithm؛ McCormick relaxation؛ Fractional representation؛ Crude oil scheduling problem

آمار تعداد مشاهده مقاله: 116

سامانه مدیریت نشریات علمی. طراحی و پیاده سازی از سیناوب