On abstract duality in mathematical programming

DOI10.1007/BF01917114zbMath0494.90089MaRDI QIDQ3958298

Rainer E. Burkard, Jørgen Tind, Horst W. Hamacher

Publication date: 1982

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

extremal problemsperturbation functionapplications in economicsbottleneck-problemsconditions for strong dualitypurely order theoretic concept

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15) Mathematical programming (90C99)

Related Items

Additively separable duality theory, Convex analysis in groups and semigroups: a sampler, Saddlepoints in group and semigroup minimization, Quasiconvex duality theory by generalized conjugation methods, A generalized duality and applications, A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality for algebraic linear programming
• Linear and combinatorial optimization in ordered algebraic structures
• Cutting-plane theory: Algebraic methods
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Integer programming duality: Price functions and sensitivity analysis
• An elementary survey of general duality theory in mathematical programming
• The value function of an integer program
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Concepts of optimality and their uses
• On $\Phi $-Convexity in Extremal Problems
• Zur theorie der polarfunktionale
• Extensions of Lagrange Multipliers in Nonlinear Programming
• Convex Analysis
• On abstract dual linear programs