An approximate approach of global optimization for polynomial programming problems

Author： Li H.-L.   Chang C.-T.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.107, Iss.3, 1998-06, pp. : 625-632

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 global optimization method for nonconvex separable programming problems

By Li H.-L.   Yu C.-S.  

European Journal of Operational Research, Vol. 117, Iss. 2, 1999-09 ,pp. : 275-292

Elsevier

Access to resources Recommend Favorite

GLOBAL OPTIMIZATION FOR SIGNOMIAL DISCRETE PROGRAMMING PROBLEMS IN ENGINEERING DESIGN

By TSAI JUNG-FA   LI HAN-LIN   HU NIAN-ZE  

Engineering Optimization, Vol. 34, Iss. 6, 2002-01 ,pp. : 613-622

Taylor & Francis Ltd

Access to resources Recommend Favorite

Global optimization of nonlinear fractional programming problems in engineering design

By Tsai Jung-Fa  

Engineering Optimization, Vol. 37, Iss. 4, 2005-06 ,pp. : 399-409

Taylor & Francis Ltd

Access to resources Recommend Favorite

A new deterministic global optimization method for general twice-differentiable constrained nonlinear programming problems

By Park Y. C.   Chang M. H.   Lee T.-Y.  

Engineering Optimization, Vol. 39, Iss. 4, 2007-06 ,pp. : 397-411

Taylor & Francis Ltd

Access to resources Recommend Favorite

A global optimization method for packing problems

By Tsai Jung-Fa  

Engineering Optimization, Vol. 38, Iss. 6, 2006-09 ,pp. : 687-700

Taylor & Francis Ltd

Access to resources Recommend Favorite