OPTIMALITY AND DUALITY WITH GENERALIZED CONVEXITY

被引:51
|
作者
RUEDA, NG
HANSON, MA
SINGH, C
机构
[1] FLORIDA STATE UNIV,DEPT STAT,TALLAHASSEE,FL 32306
[2] ST LAWRENCE UNIV,DEPT MATH,CANTON,NY 13617
关键词
GENERALIZED CONVEXITY; DUALITY; FRACTIONAL PROGRAMMING; MULTIOBJECTIVE PROGRAMMING; MINMAX PROGRAMMING;
D O I
10.1007/BF02192091
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Hanson and Mend 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.
引用
收藏
页码:491 / 500
页数:10
相关论文
共 50 条