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

Parametric Duality Models for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η,ρ)-Invex Functions
引用本文:G.J. Zalmai Qing-hong Zhang. Parametric Duality Models for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η,ρ)-Invex Functions[J]. 应用数学学报(英文版), 2007, 23(3): 353-376. DOI: 10.1007/s10255-007-0377-0
作者姓名:G.J. Zalmai Qing-hong Zhang
作者单位:Department of Mathematics and Computer Science, Northern Michigan University, Marquette, Michigan 49855,USA
摘    要:A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.

关 键 词:二元性 参数 数学 程序设计
收稿时间:2005-12-30
修稿时间:2005-12-302006-11-23

Parametric Duality Models for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η,ρ)-Invex Functions
G. J. Zalmai,Qing-hong Zhang. Parametric Duality Models for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η,ρ)-Invex Functions[J]. Acta Mathematicae Applicatae Sinica, 2007, 23(3): 353-376. DOI: 10.1007/s10255-007-0377-0
Authors:G. J. Zalmai  Qing-hong Zhang
Affiliation:(1) Department of Mathematics and Computer Science, Northern Michigan University, Marquette, Michigan 49855, USA
Abstract:Abstract A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of parametric duality results under various generalized (η, ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.
Keywords:Semi-infinite programming   discrete minmax fractional programming   generalized invex functions  infinitely many equality and inequality constraints   parametric duality models   duality theorems
本文献已被 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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