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 ...

Introduction to the theory and solution methods of linear and nonlinear programming problems, including: linear programming duality, Lagrangian duality, convex programming and Karush-Kuhn-Tucker ...

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 ...

This paper presents an implementation of surrogate constraint duality in mathematical programming. Motivated by the use of linear programming duality for surrogate constraints in integer linear ...

The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.

Some duality results for integer programming based on subadditive functions are presented first for linear programs and then for the group problem. A similar result for the knapsack problem is given ...

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 ...

"Using our previous results, we demonstrated that the duality operators can be realized as unitary linear-depth quantum circuits when supplementing the Hilbert space with ancillary degrees of ...