Translate this page into:
Multi-product, multi-venders inventory models with different cases of the rational function under linear and non-linear constraints via geometric programming approach
⁎Corresponding author at: Department of Statistics and Operations Researches, College of Science, King Saud University, P.O. Box 22452, Riyadh 11495, Saudi Arabia. melwakeel@ksu.edu.sa (Mona F. El-Wakeel)
-
Received: ,
Accepted: ,
This article was originally published by Elsevier and was migrated to Scientific Scholar after the change of Publisher.
Peer review under responsibility of King Saud University.
Abstract
This research deal the probabilistic multi-product multi-vendor inventory model include varying order cost and zero lead-time under linear and non-linear constraints for the number of periods , the first linear constraint on the expected holding cost, the second nonlinear constraint on the buffer stock and the third linear constraint on the storage space. The goal is to limit the expected holding cost by an upper limit , the limit for the buffer stock by an upper limit and the limit for the storage space by an upper limit . The searchers’ aim is to determine the minimum expected total cost, the optimal number of period and the optimal maximum inventory level by using a geometric programming approach. Then, applying the results of the models by a numerical example and graphs. Also, two special cases are deduced.
Keywords
Multi-product
Multi-venders inventory
Geometric programming approach-maximum inventory level
Procurement cost
Zero lead-time
Linear and non-linear constraints
1 Introduction
Many studies and research have emerged since more than ninety years to study the inventory. Harris (1915) was one of the first who managed to formulate effective inventory system by deriving the simple lot size formula and named (Wilson Formula) Proportion to Wilson who has published in 1930 in a way independent from Harris.
A lot of studies appeared to studying the unconstrained probabilistic inventory models, the first study in 1960’s by Hadley and Whitin (1963) has Followed by many researches and studies. Duffin et al. (1967) debated the basic theories on GP with application in their book.
In 1965’s Fabrycky and Banks (1965, 1967) treated some probabilistic inventory models and used the classical optimization for studied. It was Kotchenberger (1971) the first person who used Optimization by geometric programming on inventory problems. Zener (1971) used a geometric programming technique to solved a specific sort of non-linear problems. In 1989 Cheng (1989a, 1989b) used a geometric programming to studied an EOQ model and develop some inventory models. Ben-Daya and Raoyf (1994) presented unconstrained inventory model through GP method.
Also, appeared the more studies and researches for the probabilistic inventory models under linear and non linear constraints. Hariri and Abou-El-Ata (1995), Abou-El-Ata et al. (2003) and Fergany (2005) used a geometric programming approach to treated some of the constrained probabilistic inventory models with varying order cost. Similarly, Fergany and El-Wakeel (2004) applied geometric programming approach to studied the probabilistic inventory system with varying order cost. In (1997) Abou-el-ata and Kotb (1997) progress the restriction crisp inventory model by GP method. Teng and Yang (2007) treated deterministic Inventory Lot Size Models with time-Varying demand and Balkhi and Tadj (2008) were made a more dynamic models through the derivation of the EOQ model. Also El-Sodany (2011) studied the probabilistic safety stock model with varying holding cost by geometric programming approach. Islam (2015), applied a geometric programming approach to solved the multi-item, multi- criteria and multi-constraint level economic production planning inventory problem under the constraints of space capacity and the total allowable shortage cost.
In this paper we will discuss three probabilistic multi-product multi-vendor inventory models include varying order cost and zero lead-time under linear and nonlinear constraints for the number of periods , the first linear constraint on the holding cost, the second nonlinear constraint on the buffer stock and the third linear constraint on the storage space. The aim of the search to determine the minimum expected total cost, the optimal number of period and the optimal maximum inventory level by using a geometric programming approach (GPP). We discussed the model I in the case for the probabilistic MIMS inventory model, and we got the same formulas for policy variables contained in Fabrycky and Banks (1967) in the same case for the probabilistic SISS inventory models, this mean that the model I for the MIMS inventory models is a generalization of the probabilistic SISS inventory model for Fabrycky and Banks (1967). Also, we discussed the model II in the case for the probabilistic MIMS inventory model, and we got the same formulas for policy variables contained in Fabrycky and Banks (1967) in the same case for the probabilistic SISS, this mean that the model II for the MIMS inventory models is a generalization of the probabilistic SISS inventory model for Fabrycky and Banks (1967). The model III, we discussed it in the case for the probabilistic MIMS inventory model and determined the optimal policy variables, and we deduced the optimal policy variables for the model I and model II as special cases from model III. Next, applying a numerical example for the three models, and finally, comparisons are done and conclusion is deduced.
2 Model's parameters and evolution
We adopted assumptions and notations for the model as follows
The production (purchase) cost for the
product and
vendor.
The varying procurement cost for the
product per cycle and
vendor.
The holding cost for the
product per period.
The annual demand rate for the
product per period. (Units)
The probability density function of the Demand with known average
.
The expected level inventory for unit period. (Units/period)
The maximum demand for the
product during cycle. (Units/cycle)
The maximum inventory level of the
product and
vendor (Units)
The number of periods per cycle of the
product and
vendor, the review of the stock level of the
product is made every
period.
The expected total cost function.
The expected annual holding cost.
The expected annual procurement cost.
The expected annual purchase cost.
The limitation on the expected holding cost. (Units)
The limitation on the expected buffer cost. (Units)
The limitation on the area. (meter square
)
MIMS
Multi product (item), Multi-vendor. (source)
3 Assumptions for the model
-
A survey of stock level each periods.
-
An amount is ordered, so return the stock level to its initial posture specified .
-
Suppose that is a random variable representing the order amount of the item and source or vendor through cycle.
-
Shortages are not allowed.
-
The maximum inventory level of the item and source is , as follows:
-
The procurement cost per unit is a varying function of , has the from:
4 Probabilistic (MIMS) inventory model with zero lead time under three constraints and varying order cost
We define the expected total cost for the period, that is the sum of the expected purchase cost for the period, the expected procurement cost for the period and the expected holding cost for the period as follows:
The expected level inventory is given by:
Now the holding cost component is given by:
where
is the relational function just mentioned .The main variables for this model are
and
, then, we rewritten the total expected cost for the period as follows:
4.1 Model I: Consider the case
Substituting in the expected level inventory and the expected holding cost are given by:
Also, the expected total cost in Eq. (1) is obtained as:
Subject to:
The term
is constant, then the expected total cost (2) can be written as following from:
Subject to:
Applying the geometric programming technique to the Eqs. (3) and (4), we obtain the primal geometric function:
By solving the above equation, we get:
The dual function is given by substitution from Eq. (6) into Eq. (5) as follows:
Now, take the logarithm of Eq. (7) and equate the first partial derivatives of
to zero, respectively to calculate
which maximize
, we can obtain:
It could easily prove that this means that are three roots . Any method such as the trial and error method could be used to calculate this root .We can verify that any root calculated from Eqs. (8)–(10) maximize respectively.
This is done by the second derivatives that verify Hessian matrix always negative as follows:
Therefore from the Hessian matrix, we get:
Thus the roots calculated from Eqs. (8)–(10) maximize the dual function and the optimal solutions are where are obtained from Eqs. (8)–(10) respectively.
To find the optimal expected number of periods per cycle use the following relations due to Duffin and Peterson's theorem (Duffin et al., 1967) of geometric programming as follows:
By solving the above equations, then substituting the values of
we get the optimal number of period per cycle
as follows:
Then, the maximum inventory level
is given by:
Substituting the value of
from Eq. (11) into Eq. (3) after adding the constant term:
4.2 Model II: The case where
The expected total cost in Eq. (1) will be:
Now, we defined the optimal minimum expected total cost under the following constraints:
Then Eq. (14) can be rewritten the annual expected total cost as following Whereas the term
and
are constants:
Subject to:
Applying the geometric programming technique to the Eq. (15) and (16), where
are the weights that achieve orthogonal and natural condition whereas
and
, we get:
Now, take the logarithm of Eq. (17) and equate the first partial derivatives of
to zero, respectively to calculate
,
which maximize
, we get:
It could easily prove that this means that are three roots . Any method such as the trial and error method could be used to calculate this root .We can verify that any root calculated from Eqs. (18)–(20) maximize respectively. This is done by the second derivative that verify Hessian matrix always negative as follows: Then:
thus the roots calculated from Eqs. (18)–(20) maximize the dual function and the optimal solution is where , are obtained from Eqs. (18)–(20).
By using the relations for Duffin and Peterson's theorem (Duffin et al., 1967) of geometric programming to find the optimal number of periods per cycle
we get:
Then, the maximum inventory level
as follows:
Substituting the value of
from Eq. (21) into Eq. (15) after adding the constant term to get the minimum expected total cost as follows:
4.3 Model III: The case where
The expected total cost in Eq. (1) will be:
The optimal minimum E(TC) under the following constraints:
Then can be rewritten the annual expected total cost as following whereas the term
and
are constants:
Subject to:
Applying the geometric programming technique to the Eqs. (25) and (26), where
are the weights that achieve orthogonal and natural condition, we get:
Now, take the logarithm of Eq. (27) and equate the first partial derivatives of
to zero, respectively to calculate
which maximize
,we obtain:
It could easily prove that this means that are three roots . Any method such as the trial and error method could be used to calculate this root .We can verify that any root calculated from Eqs. (28)–(30) maximize respectively. This is done by the second derivative that verify Hessian matrix always negative as follows:
The Hessian matrix:
thus the roots calculated from Eqs. (28)–(30) maximize the dual function and the optimal solution is where are obtained from Eqs. (28)–(30) respectively.
By using the relations for Duffin and Peterson's theorem (Duffin et al., 1967) of geometric programming to find the optimal number of periods per cycle
we get:
Then, the maximum inventory level
is given by:
Substituting the value of
from Eq. (31) into Eq. (25) after adding the constant term to get the minimum expected total cost as follows:
5 Special cases
5.1 Case 1
Substituting from in Eqs. (31)–(33) respectively we get the optimal policy variables for the model I
5.2 Case 2
Substituting from in Eqs. (31)–(33) respectively we get:
These are the optimal policy variables for the model II.
6 Numerical application and analysis
A manager of probabilistic restricted MIMS inventory system considers the consequence of the minimum procurement cost and inventory policy of system involving three items and three vendors (sources). Source 1 and source 2 are manufacturing or remanufacturing alternatives while sources 3 are either vendors or intra firm transfer possibilities. The item dependent parameter of demand of the item is holding cost
parameters that depend upon the item as well as the source,
, and also, the demand has uniform distribution with expected value for each item are given in Table 1. Addition parameters values needed are:
The blank cells denote that the item is not available from the source indicated.
Item
1
Source 1
50
20.12
0.27
3
Source 2
65.35
30.10
Source 3
—
—
2
Source 1
85
16.30
0.17
6
Source 2
—
—
Source 3
40.12
18.50
3
Source 1
15
14.20
0.24
4
Source 2
15.35
11.08
Source 3
19.30
9.2
By applying Eqs. (11)–(13) for the model I, Eqs. (21)–(23) for the model II and Eqs. (31)–(33) for the model III to each item and source, the minimum expected total cost as given in the Tables 2–4.
Source
Item 1
Item 2
Item 3
0.1
1
2.349
77.529
103.521
2.669
176.122
161.518
1.152
50.684
81.619
2
2.695
88.928
139.997
–
–
–
1.166
51.291
69.442
3
–
–
–
1.830
120.787
153.888
1.312
57.723
65.14
0.2
1
2.306
76.105
105.599
2.635
173.888
165.177
1.088
47.88
81.788
2
2.665
87.932
142.798
–
–
–
1.102
48.485
69.631
3
–
–
–
1.772
116.966
155.364
1.248
54.915
65.545
0.3
1
2.238
73.863
107.843
2.573
169.842
169.221
1.012
44.529
81.876
2
2.607
86.033
145.888
–
–
–
1.026
45.124
69.739
3
–
–
–
1.694
111.821
156.884
1.170
51.473
65.885
0.4
1
2.137
70.514
110.237
2.474
163.299
173.657
0.921
40.532
81.843
2
2.511
82.876
149.269
–
–
–
0.938
41.284
69.726
3
–
–
–
1.591
104.979
158.404
1.074
47.265
66.117
0.5
1
1.990
65.677
112.729
2.323
153.327
178.448
0.813
45.788
81.631
2
2.363
77.977
152.91
–
–
–
0.826
36.327
69.536
3
–
–
–
1.454
95.972
159.844
0.958
42.143
66.175
0.6
1
1.783
58.852
115.199
2.101
138.68
183.462
0.686
30.203
81.156
2
2.142
70.678
156.703
–
–
–
0.697
30.690
69.080
3
–
–
–
1.276
84.237
161.059
0.817
35.959
65.961
0.7
1
1.497
49.417
117.392
1.784
117.754
188.356
0.539
23.735
80.289
2
1.822
60.122
160.382
–
–
–
0.549
24.143
68.229
3
–
–
–
1.048
69.154
161.784
0.650
28.597
65.315
0.8
1
1.112
36.710
118.767
1.344
88.709
192.314
0.375
16.485
78.831
2
1.373
45.310
163.131
–
–
–
0.381
16.785
66.778
3
–
–
–
0.761
50.229
161.523
0.457
20.089
63.979
0.9
1
0.6196
20.448
118.081
0.7632
50.368
193.302
0.204
8.992
76.441
2
0.774
25.549
163.929
–
–
–
0.208
9.155
64.377
3
–
–
–
0.422
27.833
159.255
0.249
10.958
61.489
Source
Item 1
Item 2
Item 3
0.1
1
10.724
65.172
79.865
12.559
141.354
124.645
5.204
64.816
73.454
2
12.347
70.04
113.382
–
–
–
5.267
65.068
61.048
3
–
–
–
8.460
116.756
132.745
5.942
67.768
54.318
0.2
1
11.366
67.097
81.457
13.428
146.568
126.19
5.298
65.192
73.855
2
13.189
72.566
113.21
–
–
–
5.366
65.460
61.459
3
–
–
–
8.848
119.088
133.745
6.094
68.376
55.122
0.3
1
11.984
68.951
83.550
14.298
151.788
129.473
5.341
65.364
74.903
2
14.029
75.086
115.925
–
–
–
5.414
65.656
62.526
3
–
–
–
9.193
121.157
135.399
6.195
68.780
56.108
0.4
1
12.502
70.505
86.257
15.081
156.480
133.323
5.297
65.188
75.891
2
14.779
77.336
119.291
–
–
–
5.374
65.497
63.534
3
–
–
–
9.433
122.598
138.36
6.201
68.804
57.346
0.5
1
12.771
71.312
89.937
15.599
159.594
140.809
5.110
64.440
77.161
2
15.266
78.797
123.915
–
–
–
5.189
64.756
64.833
3
–
–
–
9.456
122.739
140.089
6.045
68.180
58.955
0.6
1
12.508
70.524
95.324
15.499
158.994
145.323
4.688
62.752
78.934
2
15.145
78.435
130.755
–
–
–
4.766
63.064
66.646
3
–
–
–
9.065
120.389
143.455
5.613
66.452
61.217
0.7
1
11.189
66.566
98.030
14.094
150.564
154.641
3.888
59.552
79.207
2
137.748
74.243
144.09
–
–
–
3.958
59.832
66.939
3
–
–
–
7.911
113.466
147.827
4.721
62.884
61.742
0.8
1
7.830
56.489
105.571
10.055
126.330
167.721
2.492
53.968
81.053
2
9.787
62.361
152.532
–
–
–
2.540
54.160
68.838
3
–
–
–
5.378
98.268
153.620
3.074
56.296
64.253
0.9
1
0.575
34.724
122.348
0.756
70.530
196.062
0.165
44.660
85.727
2
0.734
35.202
167.119
–
–
0.168
44.672
73.638
3
–
–
–
0.382
68.292
167.015
0.207
44.828
70.410
Source
Item 1
Item 2
Item 3
0.1
1
6.215
69.358
86.227
7.278
151.157
134.027
3.016
67.523
77.112
2
7.155
74.859
118.733
–
–
–
3.053
67.811
64.751
3
–
–
–
4.903
123.36
139.064
3.444
70.860
58.496
0.2
1
6.398
70.429
88.112
7.559
154.439
137.052
2.982
67.263
77.770
2
7.424
76.432
121.074
–
–
–
3.021
67.563
65.424
3
–
–
–
4.981
124.278
140.692
3.431
70.760
59.334
0.3
1
6.533
71.221
90.383
7.795
157.201
140.739
2.912
66.712
78.512
2
7.648
77.740
123.924
–
–
–
2.952
67.023
66.184
3
–
–
–
5.012
124.641
142.615
3.378
70.342
60.294
0.4
1
6.579
71.488
93.143
7.937
158.857
145.285
2.788
65.745
79.349
2
7.778
78.499
127.432
–
–
–
2.828
66.060
67.043
3
–
–
–
4.964
124.08
144.903
3.263
69.455
61.395
0.5
1
6.465
70.823
96.528
7.897
158.40
150.014
2.587
64.180
80.287
2
7.729
78.214
131.794
–
–
–
2.627
64.492
68.007
3
–
–
–
4.788
122.014
147.637
3.061
67.872
62.652
0.6
1
6.076
68.547
100.701
7.529
154.091
158.063
2.278
61.765
81.322
2
7.357
76.039
137.266
–
–
–
2.315
62.060
69.074
3
–
–
–
4.404
117.527
150.906
2.727
65.269
64.077
0.7
1
5.221
63.542
105.856
6.577
142.945
167.055
1.815
58.153
82.431
2
6.415
70.527
144.163
–
–
–
1.847
58.407
70.220
3
–
–
–
3.691
109.189
154.794
2.203
61.182
65.655
0.8
1
3.591
54.009
112.207
4.612
119.956
178.451
1.143
52.915
83.556
2
4.489
59.260
152.879
–
–
–
1.165
53.088
71.390
3
–
–
–
2.467
94.862
159.36
1.410
54.999
67.341
0.9
1
0.726
37.249
121.748
0.954
77.164
195.831
0.208
45.625
85.198
2
0.926
38.420
166.149
–
–
–
0.213
45.659
73.096
3
–
–
–
0.482
71.641
166.089
0.262
46.043
69.791
We can determine the optimal policy variables of the minimum total cost as Table 5:
Item
source
Model I
2.349
77.529
103.521
1
1
1.830
120.787
153.888
2
3
1.312
57.723
65.14
3
3
Model II
10.724
65.172
79.865
1
1
12.559
141.354
124.645
2
1
5.942
67.768
54.318
3
3
Model III
6.215
69.358
86.227
1
1
7.278
151.157
134.027
2
1
3.444
70.860
58.496
3
3
For the model I, the number of periods and the maximum inventory level for each item each source are decreasing whenever
increased as Table 2, but the expected order cost is increasing whenever
increased. The minimum expected total cost for item 1 is increasing whenever the value of the
increased for each source. The minimum expected total cost for item 2 source 1 is increasing whenever the value of the increased and the minimum expected total cost for item 2 source 2 is increasing in
but it is decreasing in
.The expected total cost for item 3 is decreasing whenever the value of the
increased for each source as show Fig. 1 and Table 2. In general, for the model I, the number of periods and the maximum inventory level are decreasing whenever
increased but the expected order cost and the optimal minimum expected total cost for the three items are increasing whenever the value of the
increased, also, we deduced the optimal policy variables of the model I when
.Expected total cost for Model I at different values of
.
For the model II, the minimum expected total cost for each items each source is increasing whenever the value of the
increased as show Fig. 2 and Table 3.Expected total cost for Model II at different values of
.
The expected number of periods and the maximum inventory level for item1 and item 2 are increasing in but they are decreasing in for each source. For item 3 (source1 –source2) the expected number of periods and the maximum inventory level are increasing in but they are decreasing in , also for item 3 (source3) the expected number of periods and the maximum inventory level are increasing in but they are decreasing in . In general, for the model II, the expected number of periods and the maximum inventory level are varying whenever increased. The expected order cost and the minimum expected total cost are increasing whenever increased for each item each source, we obtained the optimal policy variables of the model II when .
For the model III, the expected number of periods and the maximum inventory level for item 1 are increasing
in
but they are decreasing in
for each source as Table 5. For item2 (source 1), the expected number of periods and the maximum inventory level are increasing in
but they are decreasing in
, also, they are increasing in
but they are decreasing in
for source3 as Table 5. For item 3 each source, the expected number of periods and the maximum inventory level are decreasing whenever the value of the increased as Table 5.The minimum expected total cost for each items each source is increasing whenever the value of the
increased as show in Fig. 3 and Table 4, also, the optimal expected total cost for each items obtained when
. In general, for the model III, the expected number of periods and the maximum inventory level are varying whenever β increased but the expected order cost and the minimum expected total cost are
increasing whenever the value of the increased for each item each source. Also the expected number of periods is decreasing whenever
increased but the maximum inventory level, the expected order cost and the minimum expected total cost are increasing whenever increased. We deduced the optimal policy variables of the III model III when
.Expected total cost for Model III at different values of
.
Finally, the minimum expected total cost of the model is equal to the summation of the minimum expected total cost for each item. Thus, , and . From these results we can say that the model (II) is the best model of the three models because it has the optimal minimum expected total cost for the three items.
Furthermore, we can compare the optimal results of the three probabilistic MIMS inventory models without varying order cost(denoted crisp models) and the three probabilistic MIMS inventory models with varying order cost. For the crisp models: , and . One can deduce that the optimal expected total cost of the crisp model I and crisp model are better than models I and III with varying order cost, but the optimal expected total cost of the model II with varying order cost is better than the crisp model II. Now, we can conclude that the variation on the order cost increases the minimum expected total cost for the model I and model III but it reduces the minimum expected total cost for the model II. Also, the increasing values of the parameters lead to increase the expected total cost of the three probabilistic MIMS inventory models.
7 Conclusion
In this paper we assumed three probabilistic multi-item multi-vender inventory models with varying order cost and zero lead-time under linear and nonlinear constraints for the number of periods , the first linear constraint on the holding cost, the second nonlinear constraint on the buffer stock and the third linear constraint on the storage space. Our objective is determining the minimum expected total cost. Using geometric programming approach (GPP), the exact solution of the optimal number of period and the optimal maximum inventory level are obtained for the three models. Next, we deduced some special simple SISS inventory models had been discussed by Fabrycky and Banks (1967).
For model III, we solved it and we figured out that it is a generalization of the models I and model II, and they can be special cases from model III. Finally, applying a numerical application to the three models, comparisons, analysis are done and as a result the system manager can use model II to obtain the minimization of the expected total cost for the given data of the items and vendors. We tend to use new methods like fuzzy numbers, SWARM and etc., to discover and decide which the best model of them is.
Acknowledgments
This research project was supported by a grant from the “Research Center of the Female Scientific and Medical Colleges”, Deanship of Scientific Research, King Saud University.
Conflict of interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
References
- Probabilistic multi-item inventory model with varying order cost under two restrictions: a geometric programming approach. Intl. J. Product. Econ.. 2003;83:223-231.
- [Google Scholar]
- Multi-item EOQ inventory model with varying holding cost under two restrictions: ageometric programming approach. Prod. Plann. Control. 1997;8:608-611.
- [Google Scholar]
- A generalized economic order quantity model with deteriorating items and time varying demand, deterioration, and costs. Int. Trans. Oper. Res.. 2008;15:509-517.
- [Google Scholar]
- Inventory models involving lead-time as a decision variable. J. Oper. Res. Soc.. 1994;45:579-582.
- [Google Scholar]
- An economic production quantity model with flexibility and reliability considerations. Eur. J. Oper. Res.. 1989;39:174-179.
- [Google Scholar]
- An economic production quantity model with demand-dependent unit cost. Eur. J. Oper. Res.. 1989;40:252-256.
- [Google Scholar]
- Geometric Programming-Theory and Application. New York: John Wiley; 1967.
- Periodic Review Probabilistic Multi-Item Inventory System with Zero Lead Time under Constraint and Varying Holding Cos. J. Math. Stat.. 2010;7(1):12-19. 2011, ISSN 1549-3644© 2010 Science Publications
- [Google Scholar]
- Fabrycky, W.J., Banks, J., 1965. Procurement and inventory theory valume III-The multi-item, multi-source Concept. Oklahoma State University Engineering Research Bulletin No. 146.
- Procurement and Inventory Systems: Theory and Analysis. USA: Reinhold Publishing Corportion; 1967.
- Periodic review probabilistic multi-Item inventory system with zero lead Time under constraints and varying order cost. Am. J. Applied Sci.. 2005;2(1213):1217.
- [Google Scholar]
- Probabilistic single-item inventory problem with varying order cost under two linear constraints. J. Egypt Math Soc. 2004;12(1):71-81.
- [Google Scholar]
- Analysis of Inventory Systems. Englewood Cliffs: N.J. Prentice-Hall; 1963.
- Multi-item production lot size inventory model with varying order cost under a restriction: a geometric programming approach. Prod. PlannControl. 1995
- [Google Scholar]
- Operations and cost. (Factory Management Series). Chicago: A.W. Shaw Co.; 1915. pp. 48–52
- Multi-item, multi- criteria and multi-constraint level economic production planning inventory problem: a geometric programming approach. Int. J. Math. Arch.. 2015;6(2):209-223.
- [Google Scholar]
- Inventory models: optimization by geometric programming. Decis. Sci.. 1971;2:193-205.
- [Google Scholar]
- Deterministic inventory lot-size models with time-varying demand and cost under generalized holding costs. Inf. Manage. Sci.. 2007;2:113-125.
- [Google Scholar]
- Engineering Design by Geometric Programming. New York: John Wiley & Sons; 1971.