Global optimization for generalized geometric programming problems with discrete variables

Generalized geometric programming (GGP) problems occur frequently in engineering design and management, but most existing methods for solving GGP actually only consider continuous variables. This article presents a new branch-and-bound algorithm for globally solving GGP problems with discrete variab...

Full description

Saved in:

Bibliographic Details
Published in:	Optimization Vol. 62; no. 7; pp. 895 - 917
Main Authors:	Shen, Pei-Ping, Bai, Xiao-Di
Format:	Journal Article
Language:	English
Published:	Philadelphia Taylor & Francis Group 01.07.2013 Taylor & Francis LLC
Subjects:	Algorithms Branch & bound algorithms Computation discrete variable Equivalence generalized geometric programming Geometry global optimization Linear programming linearization technique Lower bounds Mathematical analysis Mathematical models Mathematical programming Optimization Optimization techniques Programming reduction cut Studies Variables
ISSN:	0233-1934, 1029-4945
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!