Linear Programming Duality TheoryTong, Lang
in which case the choice of the parameter values may be the main issue to be studied, which can be done through sensitivity analysis.For greater clarity, the first three sections discuss duality theory under the assump- tion that the primal linear programming problem is in our standard form (...
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 ...
Probabilistic Constrained Linear Programming: Duality TheoryKeywords See also Referencesdoi:10.1007/978-0-387-74759-0_526Komáromi
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...
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 ...
If either of two dual linear-programming problems has a solution, then so does the other. McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc. Want to thank TFD for its existence?Tell a friend about us, add a link to this pa...
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...
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...