Treffer: Decreasing in computing complexity of high-order problem of nonlinear programming

Title:
Decreasing in computing complexity of high-order problem of nonlinear programming
Authors:
Zasyadko, A. A.
Source:
The Banking University Bulletin; No. 2(23) (2015); 158-162; № 2(23) (2015); 158-162; № 2(23) (2015); 158-162; 2221-755X; 10.18371/2221-755x2(23)2015
Document Type:
E-Ressource Electronic Resource
Index Terms:
computing complexity, problems of nonlinear programming, multi-criteria optimization, nonlinear schema of compromise, 519.81, 621.372, info:eu-repo/semantics/article, info:eu-repo/semantics/publishedVersion
URL:
http://visnuk-archiv.ubs.edu.ua/article/view/69654
http://visnuk-archiv.ubs.edu.ua/article/view/69654/71976
Availability:
Open access content. Open access content
https://creativecommons.org/licenses/by/4.0
Note:
application/pdf
The Banking University Bulletin
Ukrainian
Other Numbers:
UANTU oai:ojs.journals.uran.ua:article/69654
962736373
Contributing Source:
NATIONAL TECH UNIV OF UKRAINE
From OAIster®, provided by the OCLC Cooperative.
Accession Number:
edsoai.ocn962736373
Database:
OAIster

Weitere Informationen

Decrease in computing complexity of high-order problem of nonlinear programming is reached due to application the multi-criteria optimization. The non-linear schema of compromise is offered to use for equalizing partial criteria that implement the reduction of tensed situation to the calm one are suggested. The numerical implementation on the base of this scheme does not demand additional limitations by the calm criteria though these limitations are necessary by tensed criteria.