Convex analysis and duality over discrete domains
From MaRDI portal
Publication:1660291
DOI10.1007/s40305-017-0158-2zbMath1413.90184OpenAlexW2598386307MaRDI QIDQ1660291
Publication date: 15 August 2018
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-017-0158-2
integer programmingintegralitydiscrete convex analysisdiscrete Lagrangian dualitydiscrete Slater's conditiondiscrete strong duality
Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)
Related Items
Directional derivatives and subdifferential of convex fuzzy mapping on \(n\)-dimensional time scales and applications to fuzzy programming, Optimization problems with cone constraints in groups and semigroups: an approach based on image space analysis, Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convexity and Steinitz's exchange property
- Handbook of generalized convexity and generalized monotonicity
- Discrete convex analysis
- Notes on L-/M-convex functions and the separation theorems
- Convex optimization on mixed domains
- A note on discrete convexity and local optimality
- Towards strong duality in integer programming
- Convexity in cristallographical lattices
- M-Convex Function on Generalized Polymatroid
- Discrete Convex Analysis
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Convex Analysis
- On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
