A new global optimization algorithm for solving generalized geometric programming.
Liu, San-Yang, Wang, Chun-Feng, Liu, Li-Xia (2010)
Mathematical Problems in Engineering
Similarity:
Liu, San-Yang, Wang, Chun-Feng, Liu, Li-Xia (2010)
Mathematical Problems in Engineering
Similarity:
Zdeněk Dostál (1999)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
A. Friedlander, J. M. Martinez (1992)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Ana Friedlander, José Mario Martínez (1989)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
D. Benterki, B. Merikhi (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.
Zhang, Ming-Liang, Xiao, Yun-Hai, Zhou, Dangzhen (2010)
Mathematical Problems in Engineering
Similarity:
Wei, Z., Qi, L., Birge, J.R. (1998)
Journal of Inequalities and Applications [electronic only]
Similarity:
Frederic Messine (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.