Energy crop supply in France: a min-max regret approach

DOI10.1057/palgrave.jors.2602284zbMath1143.90019OpenAlexW2149079279MaRDI QIDQ3518831

Daniel Vanderpooten, A. O. Kazakçi, Stelios Rozakis

Publication date: 12 August 2008

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

Full work available at URL: https://ageconsearch.umn.edu/record/24751/files/cp05ka02.pdf

zbMATH Keywords

Franceinterval linear programmingmin-max regretenergy crops

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (5)

Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem ⋮ An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Robustness in operational research and decision aiding: a multi-faceted issue ⋮ Robust pricing for airlines with partial information

This page was built for publication: Energy crop supply in France: a min-max regret approach