Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables

Authors:
Han-Lin Li;Hao-Chun Lu
Affiliations:
Institute of Information Management, National Chiao Tung University, Taiwan, Republic of China;Institute of Information Management, National Chiao Tung University, Taiwan, Republic of China
Venue:
Operations Research
Year:
2009

Citing 3
Cited 6

Incorporation Competence Sets of Decision Makers by Deduction Graphs

Operations Research
Treating Free Variables in Generalized Geometric Global Optimization Programs

Journal of Global Optimization
Digital Circuit Optimization via Geometric Programming

Operations Research

A Superior Representation Method for Piecewise Linear Functions

INFORMS Journal on Computing
A DIAMOND method of inducing classification rules for biological data

Computers in Biology and Medicine
A DIAMOND method for classifying biological data

ICMB'10 Proceedings of the Second international conference on Medical Biometrics
Base-2 Expansions for Linearizing Products of Functions of Discrete Variables

Operations Research
Base-2 Expansions for Linearizing Products of Functions of Discrete Variables

Operations Research
A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many optimization problems are formulated as generalized geometric programming (GGP) containing signomial terms f(X)·g(Y), where X and Y are continuous and discrete free-sign vectors, respectively. By effectively convexifying f(X) and linearizing g(Y), this study globally solves a GGP with a lower number of binary variables than are used in current GGP methods. Numerical experiments demonstrate the computational efficiency of the proposed method.