A duality theorem for nondifferentiable convex programming with operatorial constraints

Publisher： Cambridge University Press

E-ISSN： 1755-1633|22|1|145-152

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.22, Iss.1, 1980-08, pp. : 145-152

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

A duality theorem for a nondifferentiable nonlinear fractional programming problem

By  

Bulletin of the Australian Mathematical Society, Vol. 20, Iss. 3, 1979-06 ,pp. : 397-406

Cambridge University Press

Access to resources Recommend Favorite

Nondifferentiable programming and duality with modified convexity

By  

Bulletin of the Australian Mathematical Society, Vol. 35, Iss. 2, 1987-04 ,pp. : 309-313

Cambridge University Press

Access to resources Recommend Favorite

Duality for a non-differentiable programming problem

By  

Bulletin of the Australian Mathematical Society, Vol. 55, Iss. 1, 1997-02 ,pp. : 29-44

Cambridge University Press

Access to resources Recommend Favorite

On second-order converse duality for a nondifferentiable programming problem

By  

Bulletin of the Australian Mathematical Society, Vol. 72, Iss. 2, 2005-10 ,pp. : 265-270

Cambridge University Press

Access to resources Recommend Favorite

Higher-order generalized invexity and duality in nondifferentiable mathematical programming

By Mishra S.S.K.   Rueda N.N.G.  

Journal of Mathematical Analysis and Applications, Vol. 272, Iss. 2, 2002-08 ,pp. : 496-506

Academic Press

Access to resources Recommend Favorite