Continuous-time fractional Minmax programming

被引:5
作者
Husain, I [1 ]
Jabeen, Z [1 ]
机构
[1] Reg Engn Coll, Dept Math, Srinagar 190006, Kashmir, India
关键词
continuous-time fractional minmax programming; optimality conditions; Schaible-type dual; duality theorems; generalized convex functionals;
D O I
10.1016/j.mcm.2003.10.055
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Necessary and sufficient optimality conditions for a continuous-time fractional minmax programming problem are derived. Subsequently, these optimality conditions are utilized as a basis for formulating a dual, and appropriate duality theorems are proved in the framework of generalized convex functionals. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:701 / 710
页数:10
相关论文
共 13 条
[1]  
BECTOR CR, 1992, ASIA PAC J OPER RES, V9, P55
[2]  
BECTOR CR, 1985, UTILITAS MATHEMATICA, V27, P229
[4]   DUALITY IN FRACTIONAL MINIMAX PROGRAMMING [J].
CHANDRA, S ;
KUMAR, V .
JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1995, 58 :376-386
[5]  
Danskin J.M., 1967, THEORY MAX MIN ITS A, DOI [10.1007/978-3-642-46092-0, DOI 10.1007/978-3-642-46092-0]
[6]  
Dem'yanoy V.F., 1974, INTRO MINIMAX
[7]   FRACTIONAL PROGRAMMING I, DUALITY [J].
SCHAIBLE, S .
MANAGEMENT SCIENCE, 1976, 22 (08) :858-867
[8]   SIMPLE DERIVATION OF NECESSARY CONDITIONS FOR STATIC MIN-MAX PROBLEMS [J].
SCHMITENDORF, WE .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1979, 70 (02) :486-489
[9]  
SCHMITENDORF WE, 1977, J MATH ANAN APPL, V57, P686
[10]   NECESSARY CONDITIONS FOR MIN-MAX PROBLEMS AND ALGORITHMS BY A RELAXATION PROCEDURE [J].
SHIMIZU, K ;
AIYOSHI, E .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1980, 25 (01) :62-66