A novel method for optimal solution of fuzzy chance constraint single-period inventory model (Q1787468): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2016/6132768 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2546738698 / rank
 
Normal rank

Latest revision as of 03:01, 20 March 2024

scientific article
Language Label Description Also known as
English
A novel method for optimal solution of fuzzy chance constraint single-period inventory model
scientific article

    Statements

    A novel method for optimal solution of fuzzy chance constraint single-period inventory model (English)
    0 references
    0 references
    0 references
    5 October 2018
    0 references
    Summary: A method is proposed for solving single-period inventory fuzzy probabilistic model (SPIFPM) with fuzzy demand and fuzzy storage space under a chance constraint. Our objective is to maximize the total profit for both overstock and understock situations, where the demand \(\widetilde{D}_j\) for each product \(j\) in the objective function is considered as a fuzzy random variable (FRV) and with the available storage space area \(\widetilde{W}\), which is also a FRV under normal distribution and exponential distribution. Initially we used the weighted sum method to consider both overstock and understock situations. Then the fuzziness of the model is removed by ranking function method and the randomness of the model is removed by chance constrained programming problem, which is a deterministic nonlinear programming problem (NLPP) model. Finally this NLPP is solved by using LINGO software. To validate and to demonstrate the results of the proposed model, numerical examples are given.
    0 references
    0 references
    0 references
    0 references