Optimality and duality with generalized convexity |
| |
| Authors: | N G Rueda M A Hanson C Singh |
| |
| Institution: | (1) Department of Mathematics and Computer Science, Merrimack College, North Andover, Massachusetts;(2) Department of Statistics, Florida State University, Tallahassee, Florida;(3) Department of Mathematics, St. Lawrence University, Canton, New York |
| |
| Abstract: | Hanson and Mond have given sets of necessary and sufficient conditions for optimality and duality in constrained optimization by introducing classes of generalized convex functions, called type I and type II functions. Recently, Bector defined univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, optimality and duality results for several mathematical programs are obtained combining the concepts of type I and univex functions. Examples of functions satisfying these conditions are given. |
| |
| Keywords: | Generalized convexity duality fractional programming multiobjective programming minmax programming |
| 本文献已被 SpringerLink 等数据库收录！ |
|
