Linear Programming Duality TheoryTong, Lang
Probabilistic Constrained Linear Programming: Duality TheoryKeywords See also Referencesdoi:10.1007/978-0-387-74759-0_526Komáromi
very useful in both theory and practice, we believe that DWEC and our results on it are of independent interest. Second, we use the LP-technique to prove a general sufficient condition for the multilog network to be f-cast nonblocking under the so-called window algorithm. To the best ...
We develop a general duality-theory framework for revenue maximization in additive Bayesian auctions. The framework extends linear programming duality and complementarity to constraints with partial derivatives. The dual system reveals the geometric nature of the problem and highlights its connection with ...
Chapter3Dualitytheory AnimportantdiscoveryintheearlydevelopmentofLP isDualityTheory. EachLPproblem,referredtoas“aprimalproblem”is associatedwithanotherLPproblemcalled“adual problem”. Oneofthekeyusesofdualitytheoryliesinthe interpretationandimplementationofsensitivityanalysis. TheessenceofDualityTheoryTheessenceof...
It is discovered that for linear elastic structures, first-level optimization is a typical Knapsack problem, which is considered to be NP-complete in computer science. However, by using canonical duality theory, this well-known problem can be solved analytically to obtain exact integer solution. A...
In some additive number theory applications it would be nice to perturb f slightly so that Fourier transform f^ vanishes at a_1,...,a_k, while additive properties are left intact. In the present paper, we show that even if we are unsuccessful in this, we can at least say something ...
On the Theory of Semi-Infinite Programming and a Generalization of the Kuhn-Tucker Saddle Point Theorem for Arbitrary Convex Functions We first present a survey on the theory of semi-infinite programming as a generalization of linear programming and convex duality theory. By the pairing of a finit...
Wang, C.Y., Yang, X.Q., Yang, X.M.: Nonlinear augmented Lagrangian and duality theory. Mathematics of Operations Research 38(4), 740–760 (2013) 33. Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization. Wiley Series in Discrete Mathematics and Optimization. Wiley (...
in the terms of the Fermat-Weber sum. The theorem is proved by applying a general duality theorem of Rockafellar. As applications, a dual is found for the multi-facility location problem and a nonlinear dual is obtained for a linear programming problem with a priori bounds for the variables....