On method of solving the problem of convex programming
Saved in:
| Date: | 2018 |
|---|---|
| Main Author: | E. I. Nenakhov |
| Format: | Article |
| Language: | English |
| Published: |
2018
|
| Series: | Teoriia optymalnykh rishen |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0001031539 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
Probalistic-gradient method for solving certain problems convex optimization
by: A. F. Godonoga, et al.
Published: (2014) -
On two approaches to model and solve the packing problem for convex polytopes
by: Ju. E. Stojan, et al.
Published: (2018) -
Existence of solutions and solving method of lexicographic problem of convex optimization with the linear criteria functions
by: N. V. Semenova, et al.
Published: (2020) -
Algorithms for solving a separable quadratic programming problem
by: P. I. Stetsiuk, et al.
Published: (2017) -
Applying dynamic programming method to solving the problem of optimal allocation of funds between projects
by: N. V. Gripinskaja, et al.
Published: (2020)