GLOBAL OPTIMIZATION FOR SIGNOMIAL DISCRETE PROGRAMMING PROBLEMS IN ENGINEERING DESIGN

Author： TSAI JUNG-FA   LI HAN-LIN   HU NIAN-ZE  

Publisher： Taylor & Francis Ltd

ISSN： 0305-215X

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

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

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

Investigation of path-following algorithms for signomial geometric programming problems

By Yang H.-H.   Bricker D.L.  

European Journal of Operational Research, Vol. 103, Iss. 1, 1997-11 ,pp. : 230-241

Elsevier

Access to resources Recommend Favorite

An approximate approach of global optimization for polynomial programming problems

By Li H.-L.   Chang C.-T.  

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

Elsevier

Access to resources Recommend Favorite

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

A new harmony search algorithm for solving mixed-discrete engineering optimization problems

By Jaberipour M.   Khorram E.  

Engineering Optimization, Vol. 43, Iss. 5, 2011-05 ,pp. : 507-523

Taylor & Francis Ltd

Access to resources Recommend Favorite