Asymptotic approach to solution of discrete extreme problems with interval data

Authors

  • V. A. Perepelitsa
  • Ye. V. Tereshchenko

Abstract

A polynomial two-level algorithm for the linear contraction of criteria for the problem of covering an interval-weighted graph with stars is offered when the objective function tends to a maximum. The sufficient conditions for the asymptotic accuracy of the algorithm is substantiated.

Author Biographies

V. A. Perepelitsa

V.A. Perepelitsa

Ye. V. Tereshchenko

Ye.V. Tereshchenko

Issue

Section

Methods of optimization, optimum control and theory of games