Related Experiment Video
Updated: Jan 28, 2026

Comprehensive Autopsy Program for Individuals with Multiple Sclerosis
Published on: July 19, 2019
Inner approximation algorithm for generalized linear multiplicative programming problems
Yingfeng Zhao1, Juanjuan Yang1
1School of Mathematical Science, Henan Institute of Science and Technology, Xinxiang, China.
Abstract:
An efficient inner approximation algorithm is presented for solving the generalized linear multiplicative programming problem with generalized linear multiplicative constraints. The problem is firstly converted into an equivalent generalized geometric programming problem, then some magnifying-shrinking skills and approximation strategies are used to convert the equivalent generalized geometric programming problem into a series of posynomial geometric programming problems that can be solved globally. Finally, we prove the convergence property and some practical application examples in optimal design domain, and arithmetic examples taken from recent literatures and GLOBALLib are carried out to validate the performance of the proposed algorithm.
Related Concept Videos
Linearization and Approximation
Application of Linearization and Approximation
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Generalized Hooke's Law
Generalized Anxiety Disorder

