Experiments with dynamic programming algorithms for nonseparable problems

DOI10.1016/0377-2217(93)90060-ZzbMath0778.90082OpenAlexW2157429513MaRDI QIDQ2367363

Moshe Sniedovich, Alleli Domingo

Publication date: 25 August 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90060-z

zbMATH Keywords

nonlinear fractional knapsacknonseparable objective functionsnonseparable problemsparametric Lagrangian search method

Mathematics Subject Classification ID

Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

HYPER SENSITIVITY ANALYSIS OF PORTFOLIO OPTIMIZATION PROBLEMS

Cites Work

• Unnamed Item
• C-programming and the minimization of pseudolinear and additive concave functions
• A machine executable generalized inner product and its applications
• Generalized dynamic programming for multicriteria optimization
• C-programming. An outline
• A class of nonseparable dynamic programming problems
• The shortest path problem with two objective functions
• Utility, probabilistic constraints, mean and variance of discounted rewards in Markov decision processes
• C-programming: A nonlinear parametric optimization method
• Analysis of a class of fractional programming problems
• Mean, variance and probabilistic criteria in finite Markov decision processes: A review
• A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
• Preference Order Stochastic Knapsack Problems: Methodological Issues
• Technical Note—Dynamic Programming and Probabilistic Constraints
• A Solution Strategy for a Class of Nonlinear Knapsack Problems