Ciencias,UNAM

Infinite linear programming and multichain Markov control processes in uncountable spaces

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Hernández-Lerma, O
dc.contributor.author González-Hernández, J
dc.date.accessioned 2011-01-22T10:27:51Z
dc.date.available 2011-01-22T10:27:51Z
dc.date.issued 1998
dc.identifier.issn 0363-0129
dc.identifier.uri http://hdl.handle.net/11154/2807
dc.description.abstract In this paper we use infinite linear programming to study Markov control processes in Borel spaces and the average cost criterion in the "unichain" and "multichain" cases. Under appropriate assumptions we show that in both cases the associated linear programs are solvable and that there is no duality gap. Moreover, conditions are given for minimizing (respectively, maximizing) sequences for the primal (respectively, dual) programs to converge to optimal solutions. en_US
dc.language.iso en en_US
dc.title Infinite linear programming and multichain Markov control processes in uncountable spaces en_US
dc.type Article en_US
dc.identifier.idprometeo 2887
dc.source.novolpages 36(1):313-335
dc.subject.wos Automation & Control Systems
dc.subject.wos Mathematics, Applied
dc.description.index WoS: SCI, SSCI o AHCI
dc.subject.keywords (discrete-time) Markov control processes
dc.subject.keywords average cost criterion
dc.subject.keywords infinite linear programming
dc.subject.keywords generalized Farkas theorem
dc.relation.journal Siam Journal On Control and Optimization

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account