Discrete OptimizationCutting plane method for multiple objective stochastic integer linear programming
Introduction
Consider the multiple objective stochastic linear programming (MOSLP) problem defined by:where Ck, T, h are random matrices of respective dimensions (1 × n), (m0 × n) and (m0 × 1) defined on some probability space (Ω, E, P); A and b are deterministic matrices of dimensions (m × n) and (m × 1), respectively.
The (MOSLP) methodologies has been few in number, undoubtedly due to the addition of uncertainty to the difficulty of multicriteria. Some of the popular approaches concerning this problem first transform it into a deterministic multiple objective program which is then solved via an interactive method as in PROTRADE of Goicoechea et al. [4], STRANGE of Teghem et al. [11] and PROMISE of Urli and Nadeau [15]. These methods have been successfully tested in real world contexts.
In this paper, we will discuss solutions to (MOSLP) problems with the additional complication brought about by the incorporation of integer variables:The presence of integer variables in (MOSLP) structure introduce new difficulties to characterize efficient solutions [9], [13], [14] and to develop interactive methods. Many of the difficulties inherent to the general multiple objective stochastic integer linear programming (MOSILP) problems already show up when we consider what theoretical features of multiple objective integer linear programming (MOILP) [5], [8], [10], [12], [16] contribute to the success of (MOSLP). The road to computational success for (MOSILP) problems is in general through the exploitation of special structure. To our knowledge there exist today only one interactive method for (MOSILP) problem: the STRANGE-MOMIX which is developed by Teghem [12].
We propose an algorithm that combines the cutting plane technique developed by Abbas and Moulai in [1] and the L-shaped decomposition method described in [7]. Note that the L-shaped method is known as “Benders” decomposition [2] in other areas of mathematical programming and its original goal was to solve unicriterion mixed integer programming problems.
This paper is organized as follows: in Section 2 we shall transform the problem (P1) into an equivalent deterministic (MOILP) problem. Section 3 introduces notations, definitions and some results concerning the L-shaped decomposition method. Section 4 investigates in detail the solution procedure. Every step of the method will be illustrated in Section 5 by a numerical example. Section 6 concludes the paper.
Section snippets
Associate deterministic problem
Assume that we have a joint finite discrete probability distribution (ξr, pr), r = 1, …, R, of the random data.
• In the first step, for each realisation ξr of ξ we associate a criterion Zkr = Ck(ξr)x, a matrix T(ξr) and a vector h(ξr) to take into account the different scenarios affecting the K objectives and the stochastic constraints.
• The second step is to coming back exactly to the idea of recourse used in single-criterion stochastic programming [3], [6], [7]. Of course, we assume that the
Notations and basic definitions
In this section we pay attention to some basic results which can help the reader to understand the algorithm of the next section.
Solution method
The procedure is to generate all the efficient solutions of problem (P3) by solving a sequence of progressively more constrained single objective integer linear programming problems. The additional constraints exclude previously generated efficient points and ensure that newly generated solutions will be efficient.
Step 1: As said in Section 3, the algorithm starts with θ = −∞ and without feasibility and optimality cuts. The objective is minimized under the deterministic constraints.
An illustrative example
Let us consider the following example with a similar structure to that of problem (P1), K = 3, n0 = 4, m0 = m = n = 2.
Deterministic constraints:Two scenarios (R = 2) affect the three objectives and the stochastic constraints.
Conclusion
In this paper, we have considered multiple objective stochastic linear programming problem with the additional complication brought about by the incorporation of integer variables. The stochastic data are treated by recourse approach to obtain an equivalent deterministic two-stage (MOILP) program. An algorithm that generates the set of all integer efficient solutions of this equivalent program is presented. This approach has the advantage to give the decision maker two informations: the
References (16)
- et al.
An algorithm for the multiple objective integer linear programming problem
European Journal of Operational Research
(1982) - et al.
STRANGE: Interactive method for multiobjective linear programming under uncertainty
European Journal of Operational Research
(1986) Integer programming with multiple objectives
Annals of Discrete Mathematics
(1977)- et al.
Solving multiple objective integer linear programming
Ricerca Operativa
(1999) Partitioning procedures for solving mixed-variables programming problems
Numerische Mathematik
(1962)Linear programming under uncertainty
Management Science
(1955)- A. Goicoechea, L. Dukstein, R.L. Bulfin, Multiobjective stochastic programming the PROTRADE-method. Operation Research...
- et al.
Multi-criteria integer linear programming problem
Cahiers de CERO
(1992)
Cited by (33)
An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems
2010, European Journal of Operational ResearchCitation Excerpt :To solve multi-objective stochastic linear programming problems Hulsurkar et al. (1997) has proposed a fuzzy programming approach. Abbas and Bellahcene (2006) provided a cutting plane technique to solve multi-objective stochastic linear programming. Hu et al. (2007) proposed a generalized varying-domain optimization method for fuzzy goal programming (FGP) incorporating multiple priorities, which balances the two conflict factors in goal programming problem, namely general equilibrium and optimization.
A sequential nonlinear interval number programming method for uncertain structures
2008, Computer Methods in Applied Mechanics and EngineeringUncertain optimization of composite laminated plates using a nonlinear interval number programming method
2008, Computers and StructuresStochastic Multi-Objective Programming Problem: A Two-Phase Weighted Coefficient Approach
2021, Mathematical Modelling of Engineering ProblemsTwo-Stage Mean-Risk Stochastic Mixed Integer Optimization Model for Location-Allocation Problems under Uncertain Environment
2021, Journal of Industrial and Management OptimizationA compromise solution method for the multiobjective minimum risk problem
2021, Operational Research