Professional Documents
Culture Documents
Abstract
The crop planning problem is often formulated as a linear programming problem. But, in many actual cases, the
profit coefficients for agricultural products are not certain values because of the influence of the future weather, so a
linear programming model with constant coefficients does not describe the environment of decision making properly.
Therefore, we propose a model of crop planning with uncertain (stochastic) values which may support decision making
of agricultural farms. In this paper, we treat such uncertain elements as the values with the fuzziness and randomness.
r 2002 Elsevier Science B.V. All rights reserved.
Keywords: Crop planning; Linear programming problem; Fuzzy constraint; Discrete random variable
is so difficult and costly for them to identify the c21 x1 þ c22 x2 þ ? þ c2n xn XR; ð2Þ
density functions and/or distribution functions.
Their actual approach may be to guess the profit ^
coefficients as discrete random variables empiri- cm1 x1 þ cm2 x2 þ ? þ cmn xn XR; ð3Þ
cally from limited information such as the past
weather. Moreover, some farms hope ‘‘low risks’’ x1 ; x2 ; y; xn ; RX0:
and some do ‘‘high returns’’. However, as the profit coefficients come
In this paper, we deal with the case when profit to ci with probability pi ; constraints (1)–(3)
coefficients are assumed to be discrete random do not have to be satisfied strictly. We think
variables, and propose a more realistic and flexible it is proper to regard each constraint as the
model to maximize the minimum value of all the fuzzy constraint C; ‘‘ci1 x1 þ ci2 x2 þ ? þ cin xn is
total gains corresponding to real values of the roughly larger than R according to pi ’’ (Dubois
random variables. We use the fuzzy concept in this and Prade, 1980; Yager, 1982; Zimmermann,
model (Kruse and Dieter, 1987; Zadeh, 1965; 1991). Therefore, we reformulate the problem as
Zimmermann et al., 1984). follows:
Maximize R
subject to x1 þ x2 þ ? þ xn pL
2. Problem formulation ðLand ConstraintÞ;
We assume that the number of producible w1 x1 þ w2 x2 þ ? þ wn xn pW
kinds of crops is n and the profit coefficients ðLabor ConstraintÞ;
for them are ci1 ; ci2 ; y; cin per unit area with mC ðc11 x1 þ c12 x2 þ ? þ c1n xn ÞXp1 ;
the probability pi : We set ci ¼ ðci1 ; ci2 ; y; cin Þt : mC ðc21 x1 þ c22 x2 þ ? þ c2n xn ÞXp2 ;
The decision variable xj and the element wj of w
denote the cultivation area for crop j and the work ^
time for growing crop j at the unit area, mC ðcm1 x1 þ cm2 x2 þ ? þ cmn xn ÞXpm ;
respectively. As the land of a farm is limited, x1 þ x1 ; x2 ; y; xn ; RX0;
x2 þ ? þ xn has to be less than or equal to a
certain L (the gross of farm’s land). We call it where p1 þ p2 þ ? þ pm ¼ 1 and mC ðtÞ is the
‘‘Land Constraint’’. The total length of working membership function of the fuzzy constraint C:
time is limited, w1 x1 þ w2 x2 þ ? þ wn xn has to be We define the function
ð0ptoR % dÞ;
8
less than or equal to a certain W ; also. We call it >
> 0;
‘‘Labor Constraint’’. t%R
>
<
Since the set of profit coefficients is an n- mC ðtÞ ¼ þ 1; ðR % dptoRÞ;
> d
dimensional discrete random variable, the farm
>
ðRptÞ;
>
1;
:
will maximize the minimum value among the total
gains corresponding to all real values in considera- where d is a constant value given by the decision
tion of the worst case. Then, the following maker.
problem is considered:
Table 1
Profit coefficients and work times