Cutting plane method for multiple objective stochastic integer linear programming

DOI10.1016/j.ejor.2002.11.006zbMath1083.90030OpenAlexW2002159391MaRDI QIDQ2569084

Moncef Abbas, Fatima Bellahcene

Publication date: 17 October 2005

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2002.11.006

zbMATH Keywords

l-shaped decomposition methodmultiple objective integer programmingstochastic programming by recourse

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Stochastic programming (90C15)

Related Items (8)

A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs ⋮ A sequential nonlinear interval number programming method for uncertain structures ⋮ Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment ⋮ Optimization Over Stochastic Integer Efficient Set ⋮ Interactive stability cutting-plane algorithm for multiobjective nonlinear programming problems ⋮ Stochastic multi-objective optimization: a survey on non-scalarizing methods ⋮ Optimization of a linear function over the set of stochastic efficient solutions ⋮ An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems

Cites Work

• STRANGE: An interactive method for multi-objective linear programming under uncertainty
• Partitioning procedures for solving mixed-variables programming problems
• An algorithm for the multiple objective integer linear programming problem
• Linear Programming under Uncertainty
• Multi‐objective combinatorial optimization problems: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cutting plane method for multiple objective stochastic integer linear programming