Decomposition Algorithm in the Approximate Optimization Method of Geometric Programming
نویسندگان
چکیده
منابع مشابه
Tractable approximate robust geometric programming
The optimal solution of a geometric program (GP) can be sensitive to variations in the problem data. Robust geometric programming can systematically alleviate the sensitivity problem by explicitly incorporating a model of data uncertainty in a GP and optimizing for the worst-case scenario under this model. However, it is not known whether a general robust GP can be reformulated as a tractable o...
متن کاملGlobal optimization of fractional posynomial geometric programming problems under fuzziness
In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...
متن کاملA New Global Optimization Algorithm for Solving Generalized Geometric Programming
A global optimization algorithm for solving generalized geometric programming GGP problem is developed based on a new linearization technique. Furthermore, in order to improve the convergence speed of this algorithm, a new pruning technique is proposed, which can be used to cut away a large part of the current investigated region in which the global optimal solution does not exist. Convergence ...
متن کاملOptimization-based Approximate Dynamic Programming
OPTIMIZATION-BASED APPROXIMATE DYNAMIC PROGRAMMING
متن کاملUsing Imperialist competitive algorithm optimization in multi-response nonlinear programming
The quality of manufactured products is characterized by many controllable quality factors. These factors should be optimized to reach high quality products. In this paper we try to find the controllable factors levels with minimum deviation from the target and with a least variation. To solve the problem a simple aggregation function is used to aggregate the multiple responses functions then a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 1990
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.3.21