dc.contributor.author |
Pleshchinskii N. |
|
dc.date.accessioned |
2018-09-18T20:35:39Z |
|
dc.date.available |
2018-09-18T20:35:39Z |
|
dc.date.issued |
2012 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/141488 |
|
dc.description.abstract |
In this chapter primal and dual abstract linear programming problems are considered. The possibility of approximating of these problems by finite-dimensional problems is discussed. © 2012 Nova Science Publishers, Inc. All rights reserved. |
|
dc.subject |
Ap-proximation and interpolation |
|
dc.subject |
Dual space and dual operator |
|
dc.subject |
Infinite-dimensional linear programming |
|
dc.title |
The infinite-dimensional linear programming problems and their approximation |
|
dc.type |
Chapter |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
121 |
|
dc.source.id |
SCOPUS-2012-SID84892829044 |
|