آمار
| تعداد نشریات | 45 |
| تعداد شماره‌ها | 1,405 |
| تعداد مقالات | 17,242 |
| تعداد مشاهده مقاله | 55,680,685 |
| تعداد دریافت فایل اصل مقاله | 17,862,646 |
ITERATIVE METHODS FOR LARGE SCALE PROBLEM | ||
| Computational Methods for Differential Equations | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 08 مرداد 1404 اصل مقاله (1.09 M) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22034/cmde.2025.67389.3208 | ||
| نویسندگان | ||
| Rafael H. Gamidov1؛ Mutallim M. Mutallimov* 2 | ||
| 1Baku State University, Baku, Azerbaijan. | ||
| 2Institute of Applied Mathematics, BSU, Baku, Azerbaijan. | ||
| چکیده | ||
| One linear bi-criterion mathematical program, which appears as a large-scale problem in practice, is considered. Problems, related to the large size, are usually solved with the help of the methods, based on the possibilities created by the zeros of the matrix of the problem. In this way, a large number of different separation schemes have been suggested in the scientific literature. However, the problems considered here have no such possibility due to its large size. In order to overcome the size problem during the solution of the problem, the possibility of reducing it to a smaller problem is investigated. The reduction is carried out without disturbing the original structure of the problem. The goal is to maintain the possibility of using the existing effective solution methods for the problems before the reduction also for the problems received after the reduction. Suggested here method mainly uses sequential approximation schemes in fulfilling. | ||
| کلیدواژه‌ها | ||
| linear programming؛ dual problem؛ basic variable؛ basic solution؛ Pareto bound | ||
|
آمار تعداد مشاهده مقاله: 33 تعداد دریافت فایل اصل مقاله: 31 |
||