This paper considers fluid analogues for the standard linear programming problem and for a separable nonlinear programming problem. In the former case the usual duality results are demonstrated using ...

Moreover, the weak and strong duality theorems for linear programming with intuitionistic fuzzy variables problems are proved. In the end, the computational procedure of the suggested approach is ...

Recently, linear programming problems with symmetric fuzzy numbers (LPSFN) have considered by some authors and have proposed a new method for solving these problems without converting to the classical ...

ABSTRACT: The Kuhn-Tucker theorem in nondifferential form is a well-known classical optimality criterion for a convex programming problems which is true for a convex problem in the case when a ...

Perold, André, and R. Meidan. "Optimality Conditions and Strong Duality in Abstract and Continuous Time Linear Programming." Journal of Optimization Theory and Applications 40, no. 1 (May 1983): 61–76 ...

W. E. Diewert, A. D. Woodland, Frank Knight's Theorem in Linear Programming Revisited, Econometrica, Vol. 45, No. 2 (Mar., 1977), pp. 375-398 ...

Under second-order invexity and second-order pseudoinvexity, weak, strong and converse duality theorems are established for this pair of dual problems. Special cases are deduced and a pair of dual ...