Iterative methods for large-scale problems

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 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 their 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, as well as for the problems received after the reduction. Suggested here method mainly uses sequential approximation schemes to fulfill.

کلیدواژه ها:

Linear programming ، dual problem ، Dual theorem ، basic variable ، basic solution ، Pareto bound