An optimal algorithm for floorplan area optimization
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Minimizing and maximizing the product of linear fractional functions
Recent advances in global optimization
Linear multiplicative programming
Mathematical Programming: Series A and B
Multiplicative programming problems: analysis and efficient point search heuristic
Journal of Optimization Theory and Applications
A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving aProduction-Transportation Problem
Journal of Global Optimization
A Finite Algorithm for Globally Optimizing a Class of Rank-Two Reverse Convex Programs
Journal of Global Optimization
Cutting Plane/Tabu Search Algorithms for Low Rank Concave Quadratic Programming Problems
Journal of Global Optimization
On finding most optimal rectangular package plans
DAC '82 Proceedings of the 19th Design Automation Conference
Hi-index | 0.00 |
We consider a global optimization problem of minimizinga linear function subject to p linear multiplicative constraintsas well as ordinary linear constraints. We show that this problem can reduce to a 2p-dimensional reverse convex program,and present an algorithm for solving the resulting problem.Our algorithm converges to a globally optimal solution and yieldsan ε-approximate solution in finite timefor any ε 0. We also report some results of computational experiment.