Conjugate duality and the curse of dimensionality

DOI10.1016/0377-2217(91)90244-PzbMath0734.90109OpenAlexW2081663395MaRDI QIDQ811416

Thomas L. Morin, Cerry M. Klein

Publication date: 1991

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90244-p

zbMATH Keywords

convolutionsconjugate dualityrelaxation techniquediscrete resource allocation

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Dynamic programming (90C39) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A submodular approach to discrete dynamic programming ⋮ Fast value iteration: an application of Legendre-Fenchel duality to a class of deterministic dynamic programming problems in discrete time ⋮ Conjugate duality and the curse of dimensionality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conjugate duality and the curse of dimensionality
• The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
• Functional equations in the theory of dynamic programming. XII: An application of the maximum transform
• Mathematical Programming and the Maximum Transform
• A Survey of Methods for Pure Nonlinear Integer Programming
• The knapsack problem: A survey
• An Algorithm for Nonlinear Knapsack Problems
• Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections
• Contraction Mappings in the Theory Underlying Dynamic Programming
• Discrete Optimization Via Marginal Analysis
• Convex Analysis
• On Conjugate Convex Functions

This page was built for publication: Conjugate duality and the curse of dimensionality