Stochastic Separated Continuous Conic Programming: Strong Duality and a Solution Method

Xiaoqing Wang

Mathematical Problems in Engineering, 2014, vol. 2014, 1-20

Abstract:

We study a new class of optimization problems called stochastic separated continuous conic programming (SSCCP). SSCCP is an extension to the optimization model called separated continuous conic programming (SCCP) which has applications in robust optimization and sign-constrained linear-quadratic control. Based on the relationship among SSCCP, its dual, and their discretization counterparts, we develop a strong duality theory for the SSCCP. We also suggest a polynomial-time approximation algorithm that solves the SSCCP to any predefined accuracy.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/896591.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/896591.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:896591

DOI: 10.1155/2014/896591

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().