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.
computing complexity, problems of nonlinear programming, multi-criteria optimization, nonlinear schema of compromise
"Znyzhennia obchysliuvalnoi skladnosti za dopomohoiu bahatokryterialnoi optymizatsii v zadachi neliniinoho prohramuvannia" ,
Information Processing Systems,