A NEW CHARACTERIZATION ON OPTIMALITY AND DUALITY FOR NONDIFFERENTIABLE MINIMAX FRACTIONAL PROGRAMMING PROBLEMS

被引：0
|
作者：
Lai, Hang-Chin [1 ,2 ]
Liu, Jen-Chwan [3 ]
机构：
[1] Chung Yuan Christian Univ, Dept Appl Math, Jhongli, Taiwan
[2] Natl Tsing Hua Univ, Dept Math, Hsinchu, Taiwan
[3] Natl Taiwan Normal Univ, Taipei, Taiwan
来源：
JOURNAL OF NONLINEAR AND CONVEX ANALYSIS | 2011年 / 12卷 / 01期
关键词：
Minimax fractional programming; weak duality theorem; strict converse duality theorem; SUFFICIENT CONDITIONS; THEOREMS;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we employ the elementary method and technique to prove the necessary and sufficient optimality conditions for nondifferentiable minimax fractional programming problem involving convexity. By the process, we deduce the formulation of a one parametric dual problem in which we prove three duality theorems: weak duality, strong duality, and strict converse duality theorem.
引用
收藏
页码：69 / 80
页数：12
相关论文
共 50 条
12345