A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
type: Item
instance of: scholarly article
title: A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
zbMATH Open document ID: 0998.90058
DOI: 10.1016/S0377-2217(98)00118-0
author: Helmut Mausser
author: Manuel Laguna
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1829871
zbMATH Keywords: probabilistic programming
zbMATH Keywords: heuristics
zbMATH Keywords: interval programming
zbMATH Keywords: regret
describes a project that uses: CPLEX
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q4403606
cites work: Regret in Decision Making under Uncertainty
cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
cites work: Q4354785
cites work: A robustness approach to international sourcing
cites work: Minimax regret solution to linear programming problems with an interval objective function
cites work: Optimization by Simulated Annealing
cites work: Algorithms for robust single and multiple period layout planning for manufacturing systems
cites work: Robust Optimization of Large-Scale Systems
cites work: Necessary conditions for min-max problems and algorithms by a relaxation procedure
description: scientific article; zbMATH DE number 1829871