首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Optimality criteria in E-convex programming
Institution:1. Center for Partial Differential Equations, East China Normal University, 500 Dong Chuan Road, Minhang, 200241, Shanghai, China;2. School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, 221116, Jiangsu Province, China;3. Department of Mathematics, School of Science, Tianjin University, 300072, Tianjin, China;1. School of EEE, Nanyang Technological University (NTU), Singapore 639798, Singapore;2. DNV-KEMA Clean Technology Center, Singapore;3. Key Laboratory of Power System Intelligent Dispatch and Control (Shandong University), Ministry of Education, Jinan 250061, China;1. Instituto Politécnico Nacional – CITEDI, Ave. del Parque 1310, Mesade Otay, Tijuana B.C. 22510, México;2. Department of Computer Science, CICESE, Carretera Ensenada-Tijuana 3918, Ensenada B.C. 22860, México;3. Instituto Tecnológico de Tijuana, Blvd. Industrial y Ave. ITR TijuanaS/N, Mesa de Otay, Tijuana B.C. 22500, México;4. National Ignition Facility, Lawrence Livermore National Laboratory, Livermore, CA 94551, USA;1. Departamento de Matemática Aplicada, Ciencia e Ingenieria de los Materiales y Tecnologia Electrónica, Universidad Rey Juan Carlos, Móstoles, 28933, Madrid, Spain;2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, RO-014700, Bucharest, Romania
Abstract:Necessary and sufficient optimality criteria in nonlinear programming are discussed for a class of E-convex programming problems which is considered more general than a class of convex programming problems. We also modify the Fritz John and the Kuhn–Tucker problems to E-Fritz John and E-Kuhn–Tucker problems.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号