A Numerical Approach for Solving Some Convex Maximization Problems

Author： Enkhbat R.   Barsbold B.   Kamada Masaru  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.35, Iss.1, 2006-05, pp. : 85-101

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

Piece adding technique for convex maximization problems

By Fortin Dominique   Tseveendorj Ider  

Journal of Global Optimization, Vol. 48, Iss. 4, 2010-12 ,pp. : 583-593

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for some maximization scheduling problems on a single machine

By Gafarov E.   Lazarev A.   Werner F.  

Automation and Remote Control, Vol. 71, Iss. 10, 2010-10 ,pp. : 2070-2084

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A finite steps algorithm for solving convex feasibility problems

By Rami M.   Helmke U.   Moore J.  

Journal of Global Optimization, Vol. 38, Iss. 1, 2007-05 ,pp. : 143-160

Springer Publishing Company

Access to resources Recommend Favorite

An approach for solving multiple objective manufacturing problems

By Chen Ming-Ru   Chen Chie-Bien   Wei Chiu-Chi  

International Journal of Computer Applications in Technology, Vol. 13, Iss. 3-4, 2003-07 ,pp. : 132-137

Inderscience Publishers

Access to resources Recommend Favorite

A parametric approach for maximum flow problems with an additional reverse convex constraint

By Kuno T.  

Annals of Operations Research, Vol. 69, Iss. 1, 1997-01 ,pp. : 261-276

Springer Publishing Company

Access to resources Recommend Favorite