REDUCTION OF ONE BLOCK LINEAR MULTICRITERIA DECISION-MAKING PROBLEM

被引：0

作者：

Hamidov, R. ^{[1
]}

Huseynova, K. ^{[1
]}

机构：

[1] BSU, Dept Operat Res & Probabil Theory, Baku, Azerbaijan

来源：

PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON CONTROL AND OPTIMIZATION WITH INDUSTRIAL APPLICATIONS, VOL II | 2018年

关键词：

Large-scale problem; dimension reduction; multicriteria programming; Pareto-set; dynamic programming;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper analyzes one large-scale multicriteria linear programming with block-triangular shape matrix A of constraints. The matrix A is taken as M-matrix. Its all diagonal blocks are also assumed to be M-matrix. We construct procedure to reduce the dimension of problem, preserving the initial structure as it was. Suggested reduction scheme allows to treat information in part. We also consider linear dynamic multicriteria problem with a phase vector having large dimension and show applicability of reduction algorithm in this case.

引用

页码：138 / 140

页数：3