DUALITY FOR A CLASS OF MINMAX AND INEXACT PROGRAMMING PROBLEM

被引：9

作者：

BECTOR, CR ^{[1
]}

CHANDRA, S ^{[1
]}

KUMAR, V ^{[1
]}

机构：

[1] INDIAN INST TECHNOL,DEPT MATH,NEW DELHI 110016,INDIA

来源：

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS | 1994年 / 186卷 / 03期

关键词：

D O I：

10.1006/jmaa.1994.1330

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Tanimoto type duality results are presented for a class of minmax programming problems by employing minmax theorems of Game Theory which are more general than the celebrated theorem of von Neumann. This, in turn, enables one to costruct a Mond-Weir type dual and thereby weaken the convexity requirements on the objective and the constraint functions. Applications of this duality to a class of inexact programming problems are also presented. (C) 1994 Academic Press, Inc.

引用

页码：735 / 746

页数：12

共 13 条

[1]

BECTOR CR, 1985, UTILITAS MATHEMATICA, V25, P229

[2] EXACT SOLUTIONS OF INEXACT LINEAR PROGRAMS [J].