Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach

Author： Cánovas M. J.  

Publisher： Taylor & Francis Ltd

ISSN： 0233-1934

Source： Optimization, Vol.56, Iss.5-6, 2007-10, pp. : 547-563

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Copositive Programming via Semi-Infinite Optimization

By Ahmed Faizan   Dür Mirjam   Still Georg  

Journal of Optimization Theory and Applications, Vol. 159, Iss. 2, 2013-11 ,pp. : 322-340

Springer Publishing Company

Access to resources Recommend Favorite

Stability of the primal-dual partition in linear semi-infinite programming

By Ochoa Pablo D.  

Optimization, Vol. 61, Iss. 12, 2012-12 ,pp. : 1449-1465

Taylor & Francis Ltd

Access to resources Recommend Favorite

Global optimization of semi-infinite programs via restriction of the right-hand side

By Mitsos Alexander  

Optimization, Vol. 60, Iss. 10-11, 2011-10 ,pp. : 1291-1308

Taylor & Francis Ltd

Access to resources Recommend Favorite

A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing

By Daum Sebastian  

Optimization, Vol. 60, Iss. 10-11, 2011-10 ,pp. : 1379-1398

Taylor & Francis Ltd

Access to resources Recommend Favorite

Feasible Method for Generalized Semi-Infinite Programming

By Stein O.   Winterfeld A.  

Journal of Optimization Theory and Applications, Vol. 146, Iss. 2, 2010-08 ,pp. : 419-443

Springer Publishing Company

Access to resources Recommend Favorite