Cutting plane method for multiple objective stochastic integer linear programming

DOI10.1016/J.EJOR.2002.11.006MaRDI QIDQ2569084zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
• Optimization over stochastic integer efficient set
• An interactive procedure for multiple objective integer linear programming problems
• scientific article; zbMATH DE number 3999655
• Solving the Multiple Objective Integer Linear Programming Problem

Cites work

• scientific article; zbMATH DE number 4202033 (Why is no real title available?)
• scientific article; zbMATH DE number 3978851 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3497598 (Why is no real title available?)
• scientific article; zbMATH DE number 3566554 (Why is no real title available?)
• scientific article; zbMATH DE number 3999655 (Why is no real title available?)
• scientific article; zbMATH DE number 223301 (Why is no real title available?)
• An algorithm for the multiple objective integer linear programming problem
• Linear programming under uncertainty
• Multi‐objective combinatorial optimization problems: A survey
• Partitioning procedures for solving mixed-variables programming problems
• STRANGE: An interactive method for multi-objective linear programming under uncertainty

Cited in

(12)

• Optimization over stochastic integer efficient set
• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
• Stochastic multi-objective optimization: a survey on non-scalarizing methods
• An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems
• Interactive stability cutting-plane algorithm for multiobjective nonlinear programming problems
• A Cutting Plane Approach for Chance Constrained Linear Programs
• Exact method based on solution space cut for bi-objective Seru production
• Optimization of a linear function over the set of stochastic efficient solutions
• Sawing planning using a multicriteria approach
• 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
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569084)