The construction of an algorithm with optimal complexity
Închide
Articolul precedent
Articolul urmator
164 0
SM ISO690:2012
GÂRLĂ, Eugeniu. The construction of an algorithm with optimal complexity. In: Conference on Applied and Industrial Mathematics: CAIM 2017, 14-17 septembrie 2017, Iași. Chișinău: Casa Editorial-Poligrafică „Bons Offices”, 2017, Ediţia 25, p. 31. ISBN 978-9975-76-247-2.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Conference on Applied and Industrial Mathematics
Ediţia 25, 2017
Conferința "Conference on Applied and Industrial Mathematics"
Iași, Romania, 14-17 septembrie 2017

The construction of an algorithm with optimal complexity


Pag. 31-31

Gârlă Eugeniu
 
Academy of Economic Studies of Moldova
 
 
Disponibil în IBN: 23 septembrie 2022


Rezumat

The paper analyses a class of nonlinear optimization problems with special restrictions, we propose a concept for solving the auxiliary problem, for which we calculate complexity, we also assesses the maximum number of elementary operations and describe the optimal algorithm for performing numerical calculations.