Documente Academic
Documente Profesional
Documente Cultură
1A Page 351
Two products are manufactured on two sequential
machines. The following table gives the machining
times in minutes per unit for the two products:
Machining Time in min
Machine Product 1 Product2
1 5 3
2 6 2
The daily production quota for the two products are 80
and 60 units, respectively. Each machine runs 8 hours
a day. Overtime though not desirable may be used if
necessary to meet the production quota. Formulate the
problem as a goal programming model.
Let x1 be the number of units of product1 and
x2 be the number of units of product2 produced
daily.
We thus have the following four goals:
Subject to x1 80
x2 60
5 x1 3x2 s3 s3 480
6 x1 2 x2 s4 s4 480
Now we solve this by the usual simplex method.
We have to use artificial variable technique as the
first 2 constraints are type.
Thus we have to solve the LPP
Minimize z s s3 4
Subject to x1 R1 s1 80
x2 R2 s2 60
5 x1 3x2 s s 480
3 3
6 x1 2 x2 s s 480
4 4