On abstract duality in mathematical programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3137856 (Why is no real title available?)
- scientific article; zbMATH DE number 3964820 (Why is no real title available?)
- scientific article; zbMATH DE number 3759934 (Why is no real title available?)
- scientific article; zbMATH DE number 3632232 (Why is no real title available?)
- An elementary survey of general duality theory in mathematical programming
- Concepts of optimality and their uses
- Convex Analysis
- Cutting-plane theory: Algebraic methods
- Duality for algebraic linear programming
- Extensions of Lagrange Multipliers in Nonlinear Programming
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Integer programming duality: Price functions and sensitivity analysis
- Linear and combinatorial optimization in ordered algebraic structures
- On $\Phi $-Convexity in Extremal Problems
- On abstract dual linear programs
- On the existence of optimal solutions to integer and mixed-integer programming problems
- The value function of an integer program
- Zur theorie der polarfunktionale
Cited in
(6)- Saddlepoints in group and semigroup minimization
- A generalized duality and applications
- Convex analysis in groups and semigroups: a sampler
- Additively separable duality theory
- A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
- Quasiconvex duality theory by generalized conjugation methods
This page was built for publication: On abstract duality in mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3958298)
