A new hybrid genetic algorithm for global minimax optimization

2001 International Conferences on Info-Tech and Info-Net: A Key to Better Life, ICII 2001 - Proceedings

Volumn 4, Issue , 2001, Pages 316-321

  Ma, Longhua ^a   Zheng, Yongling ^a   Qian, Jixin ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Genetic Algorithm; Minimax Programming; Multilevel Programming

Indexed keywords

EID: 84964669979     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICII.2001.983838     Document Type: Conference Paper

References (7)

1. J.F.Bard, An algorithm for solving the general bilevel programming, Mathematics of Operations Research 8,260-272,(1983)
2. J.F.Bard, Optimality conditions for the bilevel programming problem, Naval Research Logistics Quarterly 31,13-26,(1984)
3. J.F.Bard, J.T.Moore, A branch and bound algorithm for the bilevel programming problem, SIAM J Sci. Statist. Comput. 11,281-292,(1990)
4. G.Savard, J. Gauvin, The steepest descent direction for nonlinear bilevel programming problem, Operations Research Letters 15,265-272(1994)
5. B.Liu, A.O.Esogbue, Cluster validity for fuzzy criterion clustering, In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Piscataway, NJ, U.S.A., Volume 5,IEEE,pp.4702-4705,(1995)
6. H. Raiffa, Decision Analysis, Addison-Wesley, Reading, MA,1968.
7. Tao Qing, Liu Xin,Fang Tingjian. A Kind of Neural Network Model for Quadratic Programming Problems with Close Convex Set. Pattern Recognize and Artificial Intelligence 1998, 11(1): 83-87