منابع مشابه
Second Order Converse Duality for Nonlinear Programming
Chandra and Abha [European J. Oper. Res. 122 (2000), 161-165] considered a nonlinear programming problem over cone constraints and presented the correct forms of its four types of duals formulated by Nanda and Das [European J. Oper. Res. 88 (1996) 572-577]. Yang et al. [Indian J. Pure Appl. Math. 35 (2004), 699-708] considered the same problem and discussed weak and strong duality for its four ...
متن کاملLinear fractional programming and duality
This paper presents a dual of a general linear fractional functions programming problem. Dual is shown to be a linear programming problem. Along with other duality theorems, complementary slackness theorem is also proved. A simple numerical example illustrates the result.
متن کاملDuality in generalized linear fractional programming
This is a generalization of a fractional programming problem (p = 1) which has been investigated quite actively in the last two decades [21 ]. In [20] many of the results in fractional programming are reviewed and extended. An extensive bibliography is given in [22]. An early application of generalized fractional programming (p > 1) is von Neumann's model of an expanding economy [25]. Here the ...
متن کاملOn duality in linear fractional programming
AlcOa'act. In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality tI-.cory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate tI'.e t~eory in this connecti...
متن کاملOn second-order converse duality for a nondifferentiable programming problem
A second-order dual for a nonlinear programming problem was introduced by Mangasarian ([1]). Later, Mond [2] proved duality theorems under a condition which is called “second-order convexity”. This condition is much simpler than that used by Mangasarian. Later, Mond and Weir [3] reformulated the second-order dual. In [4], Mond considered the class of nondifferentiable mathematical programming p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1993
ISSN: 0893-9659
DOI: 10.1016/0893-9659(93)90121-3