Zobrazeno 1 - 7
of 7
pro vyhledávání: '"O. N. Shulgina"'
Publikováno v:
Учёные записки Казанского университета. Серия Физико-математические науки, Vol 165, Iss 3, Pp 208-218 (2024)
A cutting method for solving the problem of convex programming was proposed. The method calculates iteration points based on approximation by polyhedral sets of the constraint region and the epigraph of the objective function. Its distinguishing feat
Externí odkaz:
https://doaj.org/article/e9d561796fd04a58a60535d0880085b7
Publikováno v:
Учёные записки Казанского университета. Серия Физико-математические науки, Vol 165, Iss 2 (2024)
A cutting method was proposed for solving the convex programming problem. The method assumes that the constraint region of the problem is embedded into some polyhedral sets for constructing iteration points. It involves the construction of a sequence
Externí odkaz:
https://doaj.org/article/2ea2fcfc906b4f04b4b44c9739a13559
Publikováno v:
Lobachevskii Journal of Mathematics. 44:483-490
Autor:
O. N. Shulgina, N. K. Shcherbakova
Publikováno v:
Lobachevskii Journal of Mathematics. 36:211-214
In this paper we proved the new properties optimal schedules for unknown strongly NP-complete scheduling problem of minimizing maximum lateness on a single machine, not allowing preemption. Pseudopolynomial implementation of the general scheme for so
Publikováno v:
Journal of Physics: Conference Series. 1158:042040
Publikováno v:
IOP Conference Series: Materials Science and Engineering. 158:012098
We propose a conditional minimization method of the convex nonsmooth function which belongs to the class of cutting-plane methods. During constructing iteration points a feasible set and an epigraph of the objective function are approximated by the p
Publikováno v:
IOP Conference Series: Materials Science & Engineering; 2016, Vol. 158 Issue 1, p1-1, 1p