DUALITY FOR A CLASS OF MINMAX AND INEXACT PROGRAMMING PROBLEM

[摘要] 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.

[发布日期] 1994-09-15