the significance of duality theory of linear programming
M. Kafrawy has written: 'A geometrical proof for the duality theorem in linear programming' -- subject(s): Duality theory (Mathematics), Linear programming
Monge is the duality in linear programming. Its basic theory comprises of the Kantorovich problem of optimally rearranging the measure.
I. I. Eremin has written: 'Theory of linear optimization' -- subject(s): Convex programming, Linear programming
Paul R. Thie has written: 'An introduction to linear programming and game theory' -- subject(s): Linear programming, Game theory 'An Introduction To Analysis'
Abraham M. Glicksman has written: 'Fundamentals for advanced mathematics' -- subject(s): Mathematics 'An introduction to linear programming and the theory of games' -- subject(s): Linear programming, Game theory
Nothing, but it has significance in graph-theory.
Spivey Boulding has written: 'Linear programming and the theory of the firm'
Brian D. Bunday has written: 'An introduction to queueing theory' -- subject(s): Queuing theory 'Optimisation methods in Pascal' -- subject(s): Pascal (Computer program language) 'Basic linear programming' -- subject(s): Linear programming 'Linear programming in Pascal' -- subject(s): Linear programming, Data processing, Pascal (Computer program language)
Yes, in linear programming, the dual of the dual problem is equivalent to the primal problem. This relationship is a fundamental concept in the theory of duality, which states that every linear program has a corresponding dual program, and taking the dual twice will return you to the original primal formulation. This equivalence is useful for understanding the solutions and relationships between primal and dual problems.
Evar D. Nering has written: 'Linear algebra and matrix theory' -- subject(s): Linear Algebras 'Linear programs and related problems' -- subject(s): Linear programming
Ernst Herrmann has written: 'Spieltheorie und lineares Programmieren' -- subject(s): Game theory, Linear programming