Inner approximation algorithm for generalized linear multiplicative programming problems

Inner approximation algorithm for generalized linear multiplicative programming problems

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 magnifyi...

Full description

Bibliographic Details
Main Authors: Yingfeng Zhao, Juanjuan Yang
Format: Article
Language:English
Published: SpringerOpen 2018-12-01
Series:Journal of Inequalities and Applications
Subjects:
Generalized multiplicative programming
Inner approximation algorithm
Geometric programming
Online Access:http://link.springer.com/article/10.1186/s13660-018-1947-9

Internet

http://link.springer.com/article/10.1186/s13660-018-1947-9

Similar Items