Next Article in Journal
A Three-Block Inexact Heterogeneous Alternating Direction Method of Multipliers for Elliptic PDE-Constrained Optimization Problems with a Control Gradient Penalty Term
Previous Article in Journal
Necessary and Sufficient Conditions for the Boundedness of Multiple Integral Operators with Super-Homogeneous Kernels in Weighted Lebesgue Space
Previous Article in Special Issue
Generalization of Fermatean Fuzzy Set and Implementation of Fermatean Fuzzy PROMETHEE II Method for Decision Making via PROMETHEE GAIA
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Hybrid Fuzzy Mathematical Programming Approach for Manufacturing Inventory Models with Partial Trade Credit Policy and Reliability

by
Prasantha Bharathi Dhandapani
1,
Kalaiarasi Kalaichelvan
2,
Víctor Leiva
3,*,
Cecilia Castro
4,* and
Soundaria Ramalingam
2
1
Department of Mathematics, Sri Eshwar College of Engineering, Coimbatore 641202, Tamil Nadu, India
2
PG and Research Department of Mathematics, Cauvery College for Women (Autonomous), Bharathidasan University, Tiruchirappalli 620018, Tamil Nadu, India
3
School of Industrial Engineering, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362807, Chile
4
Centre of Mathematics, Universidade do Minho, 4710-057 Braga, Portugal
*
Authors to whom correspondence should be addressed.
Axioms 2024, 13(11), 743; https://doi.org/10.3390/axioms13110743
Submission received: 30 August 2024 / Revised: 5 October 2024 / Accepted: 21 October 2024 / Published: 29 October 2024
(This article belongs to the Special Issue Recent Developments in Fuzzy Control Systems and Their Applications)

Abstract

:
This study introduces an inventory model for manufacturing that prioritizes product quality and cost efficiency. Utilizing fuzzy logic and mathematical programming, the model integrates fuzzy numbers to describe uncertainties associated with manufacturing costs and quality control parameters. The model extends beyond conventional inventory systems by incorporating a dynamic mechanism to halt production, employing fuzzy decision variables to optimize the economic order quantity and minimize total costs. Key innovations include the application of approaches related to graded mean integration for defuzzification and the use of Kuhn–Tucker conditions to ensure optimal solutions under complex constraints. These approaches facilitate the precise management of production rates, inventory levels, and cost factors, which are essential in achieving a balance between supply and demand. A computational analysis validates the model’s effectiveness, demonstrating cost reductions while maintaining optimal inventory levels. This underscores the potential of integrating fuzzy arithmetic with traditional optimization techniques to enhance decision making in inventory management. The model’s adaptability and accuracy indicate its broad applicability across various sectors facing similar challenges, offering a valuable tool for operational managers and decision makers to improve efficiency and reduce waste in production cycles.

1. Introduction

Trade credit policies have emerged as pivotal strategies for manufacturers aiming to stimulate retailer demand and boost product sales, especially in current highly competitive markets. These strategies afford retailers a specified period to settle payments for acquired goods, typically referred to as a single-level credit policy or permissible payment delay [1]. However, manufacturing processes are often imperfect, resulting in the generation of defective items alongside flawless products. Identified during quality inspections, these defective items are generally repaired, thereby recovering potential revenue [2,3,4,5]. A wealth of research has considered inventory models with a focus on contexts related to the reliability of the production process and maintenance policies [6,7,8,9,10,11,12,13,14]. Techniques from biological and mathematical modeling have been successfully applied to these contexts, providing a diverse range of solutions [15,16,17,18,19,20,21,22].
Research on lot-size models with uncertain demand, accounting for skewness and kurtosis and employing stochastic programming, has been applied to complex scenarios such as hospital pharmacies using COVID-19 data [23]. Additionally, inventory management for new products with triangularly distributed demand and lead time has also been studied [24]. Further research has explored the optimization of inventory costs and supply chain success under various complex conditions [25,26,27]. Recent studies have also addressed nonlinear quantity discounts and price-dependent demand, adding valuable insights for the management of inventories [28,29]. In certain circumstances, retailers extend credit facilities to their customers, resulting in a two-level trade credit policy. In such cases, fuzzy set theory provides a robust framework for managing imprecise or vague data by assigning degrees of membership to each object [30,31,32,33,34]. It distinguishes itself from traditional methods through its ability to handle uncertainty in a more nuanced manner. Furthermore, the graded mean integration (GMI) method plays a key role in reducing the uncertainty associated with ambiguous data, making it especially helpful for inventory models and optimization processes in uncertain environments [35,36,37,38,39,40,41]. Recent advancements have demonstrated its utility in diverse applications, including the management of pandemic models [42]. Moreover, contributions have been made in methodologies for the consolidation of the effects of inventory management with serially dependent random demand, offering robust solutions for the optimization of inventory strategies in environments with fluctuating demand [43]. A case study on drug supply further demonstrated the applicability of stochastic programming to effectively manage time-dependent demand [44].
In the current fiercely competitive manufacturing landscape, ensuring product reliability is paramount. To enhance accuracy in handling uncertainties associated with costs and quality controls, fuzzy set theory is an essential tool, offering an improvement over single-valued numbers (traditional or crisp set theory) that may provide exact but less realistic values. Fuzzy methodologies such as those applied in reliability improvement processes [45] and product design systems [46] have proven effective in managing uncertainties in complex industrial systems. For defuzzification, the GMI method can be implemented, allowing for more precise interpretation of fuzzy data. Moreover, hybrid multi-dimensional fuzzy approaches have shown potential to improve reliability and safety in various sectors [47], further proving the applicability of fuzzy logic in enhancing decision-making processes. A notable gap in the literature lies in the development of a manufacturing inventory model that effectively manages deteriorating goods while incorporating price-dependent demands and a production rate that is sensitive to reliability under a partial trade credit policy. The present research aims to address this gap by exploring the complex relationship between reliability and production total cost (TC), providing valuable insights for strategic decision making in inventory management. To achieve this, we employ logistic regression (LR), a powerful supervised machine learning (ML) technique specifically used here to predict the optimal cost conditions of the system. This technique not only supports decision making but also demonstrates the advantage of integrating fuzzy arithmetic with ML to improve the precision and adaptability of inventory management.
Our main objective is to develop a manufacturing inventory model that manages deteriorating products and incorporates price-dependent demands, as well as a production rate sensitive to reliability under a partial trade credit policy. Specifically, we implement an economic order quantity (EOQ) model, a fundamental tool in inventory management [48], and illustrate how fuzzy arithmetic is utilized within the model to handle the inherent complexities of real-world scenarios. Additionally, we apply nonlinear mathematical programming using the Lagrangian method to solve the EOQ model and evaluate its efficiency compared to other techniques. By leveraging the Weka software (version 3.8.6), we analyze the TCs by classifying them into profitable and non-profitable segments based on cycle length, optimizing inventory costs across varying market conditions.
The remainder of this article is organized as follows. Section 2 describes the methodology used to develop the fuzzy inventory model, including background on fuzzy set theory and its application in the model. In Section 3, we detail the mathematical formulation of the TC and optimization methods employed in our methodology. In Section 4, the findings derived from our research are discussed. Section 5 provides the conclusions drawn from the analysis and suggests ideas for future research.

2. Fuzzy Inventory Model

This section presents the methodology for developing a manufacturing inventory model aimed at optimizing costs and managing inventory under uncertain conditions, utilizing fuzzy numbers and nonlinear programming techniques.

2.1. Fuzzy Inventory Model Components

We recall that the primary objective of this study is to develop a manufacturing inventory model that manages deteriorating products and incorporates price-dependent demands, as well as a production rate sensitive to reliability, under a partial trade credit policy. We apply fuzzy set theory to address uncertainties in costs and quality control, using the GMI method for defuzzification to provide more accurate and reliable interpretations of the data. Before presenting the formulation of the proposed model, we state the notations utilized in the model by means of Table 1.
Next, we outline the following primary components of our optimization framework, that is, the decision variable, objective function, and constraints that govern the model:
  • Decision variable (L), which corresponds to the production cycle period;
  • Objective function, which must minimize the TC of the system ( TC ( L ) ), including the ordering cost, carrying cost, deterioration cost, interest paid, and interest earned, which is formulated as
    min { TC ( L ) } = R 0 T + ( d + f + f J c ) ( σ e G t 1 L T ) T + f J c ( 1 o e o ) ( σ e G H ) 2 T ( o 2 ( 1 ϑ ) p 2 ) M J e 2 T ;
  • The constraint is stated as
    t 1 = h L σ e G + 1 2 h σ e G h 2 σ e 2 G L 2 ,
    where 0 t T represents the time constraints ensuring that the production and inventory processes are bounded within the cycle period; σ e G t 1 L T ensures that the production meets or exceeds the demand over the cycle; L > 0 is the cycle period, which must be positive; t 1 0 is the production halt time, which must be non-negative; and 0 α 1 ensures the portion of the purchase price covered by the buyer is between 0 and 1.
The constraint presented in (2) defines the production halt time ( t 1 ), which is essential for balancing the production rate and demand. From a practical standpoint, t 1 represents the time during which the manufacturer halts production to avoid overproduction or accumulation of inventory beyond capacity. In real-world scenarios, manufacturing systems must balance the rates of production and demand fulfillment. For example, in industries where products are perishable or have a limited shelf life, such as pharmaceuticals or food elaboration, producing too much can lead to excessive costs associated with spoilage or storage.
The first term of the constraint presented in (2), h L / σ e G say, shows that the halt time is proportional to the production cycle length (L) and inversely proportional to the production rate (G). As production reliability ( σ e ) improves, the system becomes more efficient, reducing halt times. Conversely, lower reliability requires longer halt periods to minimize defects.
The second term of the constraint stated in (2), ( h / σ e G h 2 / σ e 2 G L 2 ) / 2 namely, introduces nonlinearity into the system, reflecting the increasing marginal cost or effort required to adjust production in response to growing inefficiencies over time. This is particularly relevant in scenarios where the rate of deterioration (⌀) strongly impacts production and storage decisions. Industries that handle fragile goods, such as electronics or high-tech equipment, can leverage this to optimize production cycles and minimize wastage due to quality deterioration over time.
In practical terms, the constraint presented in (2) ensures that the production process is dynamically adjusted according to demand fluctuations, ensuring that the cycle period (L) is aligned with the demand rate and quality control mechanisms. It also ensures that the production halt time ( t 1 ) is non-negative, guaranteeing that the system remains feasible, even under varying production conditions.
The values of the constants in the model (see Table 1), such as ϑ , are generally estimated from empirical data, historical studies, or sensitivity analyses tailored to specific industry contexts. For instance, the constant ϑ reflects the sensitivity of the deterioration rate to credit terms and can be adjusted according to the characteristics of the products (such as perishable goods or electronics) and the observed trade credit policies. In practice, these values may vary depending on the specific operational conditions and can be refined through simulations to match real-world scenarios more closely.
The inventory model relies on various mathematical and fuzzy logic concepts. For fuzzy logic, we use trapezoidal (TFNs), pentagonal (PFNs), and hexagonal (HFNs) fuzzy numbers to represent uncertain variables. These numbers define the boundaries of the fuzzy set, capturing the range of possible values for uncertain variables.
To provide a clearer context, we present a comparison between the proposed model and previous works in Table 2, Table 3 and Table 4. These tables highlight the key contributions and differences, particularly in terms of handling uncertainty, trade credit policies, and inventory management under deteriorating conditions.

2.2. Fuzzy Numbers

Before defining specific fuzzy numbers, it is important to understand the concept of fuzzy sets and membership functions, as well as to establish the difference between fuzzy sets and fuzzy numbers.
Let X be the universe of discourse, which is the set of all possible elements under consideration. In the context of our fuzzy inventory model, X could include elements such as the production rate, holding cost, deterioration rate, sales price, and other key factors listed in Table 1. These elements represent the various parameters that are subject to uncertainty.
To establish membership, a fuzzy set is defined as F { ( x , μ F ( x ) ) : x X } , where μ F ( x ) is the function that assigns a degree of membership in the interval of [ 0 , 1 ] to each element x X .
The support of a fuzzy set ( F ) is the subset of elements with a membership greater than zero, stated as support ( F ) { x X : μ F ( x ) > 0 } . The core of a fuzzy set ( F ) is the subset of elements with a membership equal to one, stated as core ( F ) { x X : μ F ( x ) = 1 } .
A fuzzy number is a specific type of fuzzy set that represents a quantity with uncertainty. Unlike general fuzzy sets, fuzzy numbers are often defined on the real number line and have specific shapes, such as hexagonal, pentagonal, and trapezoidal forms. These shapes are characterized by their membership functions, which define how the degree of membership varies over the range of possible values.
In the context of our inventory model, fuzzy numbers can represent various uncertain parameters, such as the holding cost, deterioration rate, and manufacturing rate. By using these specific forms of fuzzy numbers, we may model and manage the uncertainties in these parameters, leading to more robust decision making.
Different shapes of fuzzy numbers offer varying levels of detail and complexity in representing uncertainty as follows:
  • TFNs provide a good approximation of uncertainty by allowing a plateau of full membership, which can model situations with a more defined range of most likely values.
  • PFNs and HFNs offer even more flexibility, allowing for a more detailed representation of uncertainty, especially in cases where there are multiple levels of probability or asymmetric distributions.
Choosing the appropriate form of fuzzy numbers depends on the specific characteristics of the uncertainty being modeled and the available computational resources. More complex shapes can provide a more accurate representation of uncertainty but at the cost of increased computational complexity. We now proceed to define the L , R -type fuzzy numbers. Let L , R : [ 0 , 1 ] [ 0 , 1 ] be two fixed functions that are both upper semicontinuous and decreasing such that L ( 0 ) = R ( 0 ) = 1 and L ( 1 ) = R ( 1 ) = 0 . A fuzzy number (A) is said to be an L , R -type fuzzy number if the membership function ( μ A ) is given by
μ A ( x ) = L C L x η , if C L η x < C L ; 1 , if C L x C U ; R x C U γ , if C U < x C U + γ ; 0 , otherwise ;
where η and γ are the left and right spreads (widths) of μ A , respectively, and [ C L , C U ] is the core of μ A . An L , R -type fuzzy number is denoted as A { ( C L , C U ; η , γ } .
The membership function μ A describes how each point (x) in the universe of discourse ( X ) is mapped to a degree of membership ranging from zero to one. The left spread ( η ) determines how the membership value decreases from one to zero as x moves from C L to C L η , while the right spread ( γ ) determines how the membership value decreases from one to zero as x moves from C U to C U + γ .
Next, we introduce the generalized TFNs. A quadruple T { ( t 1 , t 2 , t 3 , t 4 ) ; u , μ T , t 1 t 2 t 3 t 4 , t 1 , t 2 , t 3 , t 4 R , u [ 0 , 1 ] } is called a generalized TFN if its membership function is formulated as
μ T ( x ) = μ T L ( x ) , if t 1 x < t 2 ; u , for t 2 x < t 3 ; μ T R ( x ) , if t 3 x t 4 ; 0 , otherwise ;
where μ T L ( x ) = u ( ( x t 1 ) / ( t 2 t 1 ) ) and μ T R ( x ) = u ( ( t 4 x ) / ( t 4 t 3 ) ) . If t 2 = t 3 , then the generalized TFN (T) becomes a generalized TFN and is denoted by the triplet T = { ( t 1 , t 2 , t 3 ) ; u , μ T } .
Next, we define generalized PFNs. A fuzzy subset P { ( p 1 , p 2 , p 3 , p 4 , p 5 ) ; u , u L , u R , μ P } , with p 1 p 2 p 3 p 4 p 5 , and p i R , for i { 1 , , 5 } , and u , u L , u R [ 0 , 1 ] , is called a generalized PFN is its membership function is presented as
μ P ( x ) = μ L 1 ( x ) , if p 1 x < p 2 ; μ L 2 ( x ) , if p 2 x < p 3 ; u , if p 3 x < p 4 ; μ R 2 ( x ) , if p 4 x p 5 ; 0 , otherwise ;
where μ L 1 ( x ) = u L ( ( x p 1 ) / ( p 2 p 1 ) ) , μ L 2 ( x ) = u L + ( u u L ) ( ( x p 2 ) / ( p 3 p 2 ) ) , μ R 2 ( x ) = u R + ( u u R ) ( ( p 5 x ) / ( p 5 p 4 ) , and μ R 1 ( x ) = u R ( ( p 5 x ) / ( p 5 p 4 ) ) are the left lower, left upper, right upper, and right lower legs of P, respectively. A generalized PFN passes through ( p 1 , 0 ) , ( p 2 , u L ) , ( p 3 , u ) , ( p 4 , u R ) , and ( p 5 , 0 ) . Hence, it is denoted by P { ( p 1 , p 2 , p 3 , p 4 , p 5 ) ; u , u L , u R , μ P } .
Now, we define the generalized HFNs. A fuzzy subset H { ( h 1 , h 2 , h 3 , h 4 , h 5 , h 6 ) ; u , u L , u R , μ H } , with h 1 h 2 h 3 h 4 h 5 h 6 , and h i R , for i { 1 , , 6 } , where u , u L , u R [ 0 , 1 ] , is called a generalized HFN if its membership function is stated as
μ H ( x ) = μ L 1 ( x ) , if h 1 x < h 2 ; μ L 2 ( x ) , if h 2 x < h 3 ; u , if h 3 x < h 4 ; μ R 2 ( x ) , if h 4 x < h 5 ; μ R 1 ( x ) , if h 5 x h 6 ; 0 , otherwise ;
where μ L 1 ( x ) = u L ( ( x h 1 ) / ( h 2 h 1 ) ) , μ L 2 ( x ) = u L + ( u u L ) ( ( x h 2 ) / ( h 3 h 2 ) ) , μ R 2 ( x ) = u R + ( u u R ) ( ( h 5 x ) / ( h 5 h 4 ) ) , and μ R 1 ( x ) = u R ( ( h 6 x ) / ( h 6 h 5 ) ) are the left lower, left upper, right upper, and right lower legs of H, respectively. A generalized HFN passes through ( h 1 , 0 ) , ( h 2 , u L ) , ( h 3 , u ) , ( h 4 , u ) , ( h 5 , u R ) , and ( h 6 , 0 ) . Hence, it is denoted by H { ( h 1 , h 2 , h 3 , h 4 , h 5 , h 6 ) ; u , u L , u R , μ H } .

2.3. Defuzzification

Defuzzification is the process of converting a fuzzy quantity into a precise (crisp) value. This process is crucial in practical applications where decisions need to be made based on fuzzy data. For instance, in a fuzzy inventory model, we may have fuzzy numbers representing uncertain parameters like holding cost, production rate, and deterioration rate. To make concrete decisions, such as determining optimal production levels or estimating costs, it is necessary to defuzzify these fuzzy numbers into specific values.
There are various methods of defuzzification, each with its own approach to handling the fuzziness of the data. Some common methods rely on the concept of h levels (also known as h cuts) for GMI. An h-level set of a fuzzy set ( F , where h [ 0 , 1 ] is a real number representing the membership level used to define the cut) is a crisp set that contains all elements (x) for which μ F ( x ) h , and it is defined as F h { x X : μ F ( x ) h } .
For example, consider a TFN (D) representing the deterioration rate of a product defined as D = ( 0.01 , 0.02 , 0.05 , 0.06 ) . For a specific level h, say h = 0.5 , the cut h would be the set of values x where the membership function is μ D ( x ) 0.5 .
The GMI method deals with the weighted average of the membership values along the support of the fuzzy set using a specific weighted average of the cuts h. The two-step process is outlined as follows:
  • Step 1—Determine the left and right boundaries of the fuzzy set at that level ( L 1 ( h ) and R 1 ( h ) , respectively), for each level h.
  • Step 2—Compute a weighted average of the midpoint of the boundaries of Step 1, where each midpoint is weighted by its corresponding level h.
The continuous formula of the GMI method is given by
J ( A ) = 0 w A h L 1 ( h ) + R 1 ( h ) 2 d h 0 w A h d h ,
where L 1 ( h ) and R 1 ( h ) are the inverse functions defining the left and right boundaries of the fuzzy set at level h, respectively, and w A is the width of the support of the fuzzy set (A), which can take any non-negative real value. The GMI method may be applied to various types of fuzzy numbers to obtain a crisp value. We now proceed with the application of the GMI method for TFNs, PFNs, and HFNs.
A TFN of Z { ( y 1 , y 2 , y 3 , y 4 ) } is characterized by the following four points: y 1 (lower limit), y 2 (start of the plateau), y 3 (end of the plateau), and y 4 (upper limit). The membership function μ Z increases linearly from y 1 to y 2 , is constant from y 2 to y 3 , and decreases linearly from y 3 to y 4 . The GMI for a TFN is calculated as J ( Z ) = ( y 1 + 2 y 2 + 2 y 3 + y 4 ) / 6 by considering the weighted average over the support of the fuzzy number. The weights correspond to the areas under the membership function, which can be divided into the following three regions: y 1 to y 2 with increasing membership, y 2 to y 3 with full membership, and y 3 to y 4 with decreasing membership. Points y 2 and y 3 are included twice in the weighted sum because they define the plateau where the membership is equal to one.
A PFN of P { ( y 1 , y 2 , y 3 , y 4 , y 5 ) } has the following five points: y 1 (lower limit), y 2 and y 4 (intermediate points), y 3 (peak), and y 5 (upper limit). The function μ P increases linearly from y 1 to y 2 , then from y 2 to y 3 , whereas it decreases linearly from y 3 to y 4 and from y 4 to y 5 . The GMI for a PFN is calculated as J ( P ) = ( y 1 + 3 y 2 + 4 y 3 + 3 y 4 + y 5 ) / 12 , where the weights correspond to the areas under the membership function as follows: y 1 to y 2 with increasing membership, y 2 to y 3 with increasing membership, y 3 to y 4 with decreasing membership, and y 4 to y 5 with decreasing membership. Points y 2 and y 4 have weights of three each, and the peak at y 3 corresponds to a weight of four because it is the maximum membership.
An HFN of H { ( y 1 , y 2 , y 3 , y 4 , y 5 , y 6 ) } consists of the following six points: y 1 (lower limit), y 2 and y 5 (intermediate points), y 3 and y 4 (peak values), and y 6 (upper limit). The membership function μ H is piecewise linear, with linear increases and decreases in membership. To derive the GMI for HFNs, we need to consider the weighted average over the support of the fuzzy number by applying the expression stated in (3). This involves calculating the areas under the membership function for different segments as follows. From y 1 to y 2 (increasing membership), we have μ H ( x ) = ( x y 1 ) / ( y 2 y 1 ) and therefore L 1 ( h ) = y 1 + h ( y 2 y 1 ) . From y 2 to y 3 (increasing membership), we have μ H ( x ) = ( x y 2 ) / ( y 3 y 2 ) and hence L 1 ( h ) = y 2 + h ( y 3 y 2 ) . From y 3 to y 4 (constant membership), we have μ H ( x ) = 1 ( maximum membership ) , with L 1 ( h ) and R 1 ( h ) being the constants ( y 3 and y 4 ). From y 4 to y 5 (decreasing membership), we have μ H ( x ) = ( y 5 x ) / ( y 5 y 4 ) and therefore R 1 ( h ) = y 5 h ( y 5 y 4 ) . From y 5 to y 6 (decreasing membership), we have μ H ( x ) = ( y 6 x ) / ( y 6 y 5 and thus R 1 ( h ) = y 6 h ( y 6 y 5 ) .
By integrating these functions along h from zero to one, we obtain the weighted average as J ( H ) = ( 0 1 h ( ( L 1 ( h ) + R 1 ( h ) ) / 2 ) d h ) / 0 1 h d h . For each segment, the integral is calculated separately. From y 1 to y 2 , we have 0 1 h ( ( y 1 + h ( y 2 y 1 ) + y 6 h ( y 6 y 5 ) ) / 2 ) d h . From y 2 to y 3 , we have 0 1 h ( ( y 2 + h ( y 3 y 2 ) + y 5 h ( y 5 y 4 ) ) / 2 ) d h . From y 3 to y 4 , we reach 0 1 h ( ( y 3 + y 4 ) / 2 ) d h . From y 4 to y 5 , we attain 0 1 h ( ( y 4 + y 5 h ( y 5 y 4 ) ) / 2 ) d h . From y 5 to y 6 , we obtain 0 1 h ( ( y 5 + y 6 h ( y 6 y 5 ) ) / 2 ) d h . By combining these integrals, we derive the GMI formula for the HFN as J ( H ) = ( y 1 + 3 y 2 + 2 y 3 + 2 y 4 + 3 y 5 + y 6 ) / 12 . Each weight corresponds to the area under the membership function, making points y 2 and y 5 (weights of three each) and peaks y 3 and y 4 (weights of two each) more relevant due to the maximum membership.
The earlier calculations illustrate how the GMI method is applied to different fuzzy numbers to obtain a crisp value that can be used for decision making in practical applications.

3. Cost Optimization and Solution Method

This section outlines the mathematical formulation of the TC and the optimization methods used to solve the inventory model. The Lagrangian method is applied to find the optimal solution, incorporating uncertainties through the use of fuzzy variables.

3.1. Mathematical Formulation of Inventory Total Cost

Consider a manufacturing inventory model with improved reliability and trade credit terms [50]. The producer fabricates non-defective items during the manufacturing process. The inventory starts with zero items. When customer’s demand is met, the manufacturer begins production at rate P at time t = 0 , with 0 < t < T and T being the production cycle duration representing the total time over which production and inventory processes occur.
The TC of the goods includes ordering cost, carrying cost, deterioration cost, interest paid, and interest earned. The goal is to minimize the TC function expressed in (1). The production halt time ( t 1 ), representing the time when production is stopped, is constrained by the expression defined in (2). We determine the optimal cycle period (L) by minimizing the TC while satisfying all constraints. To find the optimal cycle period (L), we differentiate TC ( L ) with respect to L and equate it to zero, yielding
R 0 T 2 + f J c ( 1 o e o ) ( σ e G h ) 2 T 2 ( o 2 p 2 ( 1 ϑ ) ) M h J e 2 T 2 = ( d + f + f J c ) σ e G T 2 L t 1 T t 1 .
By substituting the expression for t 1 from (2) into (4), we reach
R 0 + f J c ( 1 o e o ) ( σ e G ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) M h J e 2 = ( d + f + f J c ) 2 h h 2 σ e G L 2 .
Thus, solving for L, we arrive at
L = 2 R 0 + f J c ( 1 o e o ) ( σ e G ) h θ 2 ( o 2 p 2 ( 1 ϑ ) ) M h J e 2 d + f + f J c h h 2 σ e G .
The manufacturing company halts production at time t = T , ensuring that all customer’s demand is satisfied by the goods produced during the cycle.

3.2. Application of the Kuhn–Tucker Conditions in Optimization

To solve the optimization problem, we employ the Kuhn–Tucker conditions, which ensure the optimality of solutions under both equality and inequality constraints. These conditions include the following:
  • Primal feasibility—The solution must satisfy all the original constraints of the optimization problem.
  • Dual feasibility—The Lagrange multipliers associated with inequality constraints must be non-negative.
  • Complementary slackness—For each inequality constraint, either the constraint is active with a positive multiplier or it is inactive and its multiplier is zero.
  • Stationarity—The gradient of the Lagrangian function, incorporating the objective function and constraints, must be zero at the optimal point.
When dealing with fuzzy variables, fuzzy arithmetic is applied to both the constraints and objective function. This arithmetic expands the feasible solution space and allows the optimization process to account for uncertainty, seeking robust solutions under varying fuzzy parameters.

3.3. Fuzzy Inventory Model for the Total Cost

In the fuzzy inventory model, we convert the variables d, R 0 , f, T, and M from the model formulated in (1) into fuzzy variables, which can be represented as TFNs, PFNs, or HFNs. This fuzzification introduces uncertainty into key parameters such as demand (d), cost components ( R 0 , f, T, and M), and production reliability ( σ e ).
The Kuhn–Tucker conditions, as discussed in Section 3.2, are then applied to ensure that the solution satisfies both equality and inequality constraints. Using the GMI method, we defuzzify the fuzzy values and facilitate optimization, ensuring that the solution is robust under uncertainty. The TC function for the fuzzy inventory system is expressed as
TC ( L ) = 1 6 R 01 T + ( d 1 + f 1 + f 1 J c ) ( σ e G t 1 h L ) T + f 1 J c ( 1 o e o ) ( σ e G h ) 2 T ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T + 2 R 02 T + ( d 2 + f 2 + f 2 J c ) ( σ e G t 1 h L ) T + f 2 J c ( 1 o e o ) ( σ e G h ) 2 T ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T + 2 R 03 T + ( d 3 + f 3 + f 3 J c ) ( σ e G t 1 h L ) T + f 3 J c ( 1 o e o ) ( σ e G h ) 2 T ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T + R 04 T + ( d 4 + f 4 + f 4 J c ) ( σ e G t 1 h L ) T + f 4 J c ( 1 o e o ) ( σ e G h ) 2 T ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T .
To find the optimal value of T, we partially differentiate TC ( L ) , as defined in (5), with respect to L, following the stationarity condition of the Kuhn–Tucker optimality criteria, reaching
TC ( L ) L = 1 6 R 01 T 2 + ( d 1 + f 1 + f 1 J c ) T 2 σ e G L t 1 T t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 2 + 2 R 02 T 2 + ( d 2 + f 2 + f 2 J c ) T 2 σ e G L t 1 T t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 2 + 2 R 03 T 2 + ( d 3 + f 3 + f 3 J c ) T 2 σ e G L t 1 T t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 2 + R 04 T 2 + ( d 4 + f 4 + f 4 J c ) T 2 σ e G L t 1 T t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 2 ,
Hence, by solving the equation obtained when setting this derivative equal to zero, we determine the optimal value of T as given by
T = 2 ( R 01 + 2 R 02 + 2 R 03 + R 04 ) + ( 1 o e o ) J c ( f 1 + 2 f 2 + 2 f 3 + f 4 ) ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h J e ( M 1 + 2 M 2 + 2 M 3 + M 4 ) 2 d 1 + 2 d 2 + 2 d 3 + d 4 + ( f 1 + 2 f 2 + 2 f 3 + f 4 ) + J c ( f 1 + 2 f 2 + 2 f 3 + f 4 ) h h 2 σ e G .

3.4. Lagrangian Method for Solving EOQ Models with Fuzzy Variables

We now explore the Lagrangian method commonly used for optimizing inventory models by finding the optimal solution that minimizes costs and maximizes efficiency [48,49,51]. In this case, the Kuhn–Tucker conditions are used to ensure that the optimal solution respects both the equality and inequality constraints. Specifically, the dual feasibility and complementary slackness conditions ensure that the Lagrange multipliers correctly reflect the impact of the fuzzy constraints in the optimization process.
By applying the Lagrangian method, we determine the average cost for the manufactured product under uncertainty conditions. The procedure involves the following steps:
  • Step 1—Define the TC function stated in (5), including the ordering cost, carrying cost, deterioration cost, interest paid, and interest earned.
  • Step 2—Convert crisp variables to fuzzy variables to account for uncertainty.
  • Step 3—Apply the GMI method to calculate the average cost over subperiods, adjusting the number of subperiods according to the type of fuzzy numbers defined in the previous step (for example, four subperiods for TFNs, five for PFNs, and six for HFNs). The TC function presented in (5) is correspondingly modified for each case.
  • Step 4—Use the Lagrangian function, which integrates the TC minimization objective with the problem constraints (such as production time limits and credit terms) while accounting for the division of the production cycle into subperiods.
  • Step 5—Solve the system of equations obtained from the partial derivatives of the Lagrangian function across the subperiods, ensuring that the solution satisfies both the equality and inequality constraints to find the optimal production cycle period.
  • Step 6—Verify that the solution satisfies all constraints, including the appropriate number of subperiods (4, 5, or 6) depending on the type of fuzzy numbers used.
By following these steps, as illustrated in Figure 1, we ensure that the optimal cycle period is found, satisfying all constraints and minimizing the TC.

3.5. Case of Trapezoidal Fuzzy Numbers

Next, we apply the Lagrangian method to the specific case of TFNs. Let d = ( d 1 , d 2 , d 3 , d 4 ) , R 0 = ( R 01 , R 02 , R 03 , R 04 ) , f = ( f 1 , f 2 , f 3 , f 4 ) , T = ( T 1 , T 2 , T 3 , T 4 ) , and M = ( M 1 , M 2 , M 3 , M 4 ) .
In the fuzzy model formulated in (5), the cycle period (T) is divided into subperiods T 1 , T 2 , T 3 , and T 4 . The function TC ( L ) for the TFNs is expressed as
TC ( L ) = 1 6 R 01 T 4 + ( d 1 + f 1 + f 1 J c ) ( σ e G t 1 h L ) T 4 + f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 4 ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 4 + 2 R 02 T 3 + ( d 2 + f 2 + f 2 J c ) ( σ e G t 1 h L ) T 3 + f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 3 ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 3 + 2 R 03 T 2 + ( d 3 + f 3 + f 3 J c ) ( σ e G t 1 h L ) T 2 + f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 2 ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 2 + R 04 T 1 + ( d 4 + f 4 + f 4 J c ) ( σ e G t 1 h L ) T 1 + f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 1 ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 1 ,
where 0 < T 1 T 2 T 3 T 4 and the cost components (ordering cost, carrying cost, deterioration cost, interest paid, and interest earned) are calculated for each subperiod. These inequalities can be rewritten as T 2 T 1 0 , T 3 T 2 0 , T 4 T 3 0 , and T 1 > 0 . The optimal cycle length ( T * ) is then calculated as follows.
To locate the minimum, we employ the Lagrangian method according to the following four steps:
  • Step 1—Find the minimum of TC ( L ) from
    TC T 1 = 0 T 1 = R 04 + ( 1 o e o ) f 4 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 4 J e 2 d 4 + f 4 + f 4 J c h h 2 σ e G ,
    TC T 2 = 0 T 2 = 2 R 03 + ( 1 o e o ) f 3 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 3 J e 2 d 3 + f 3 + f 3 J c h h 2 σ e G ,
    TC T 3 = 0 T 3 = 2 R 02 + ( 1 o e o ) f 2 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 2 J e 2 d 2 + f 2 + f 2 J c h h 2 σ e G ,
    and
    TC T 4 = 0 T 4 = R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G .
    In the above expressions, we observe that T 1 > T 2 > T 3 > T 4 , which contradicts the required condition of 0 < T 1 T 2 T 3 T 4 . This inconsistency indicates that the constraints or the method must be adjusted to ensure that the solution satisfies the required ordering of the cycle periods. Possible adjustments include revising the Lagrange multipliers or tightening the conditions imposed on the cycle lengths.
  • Step 2—Reformulate the constraint of T 2 T 1 0 as T 2 T 1 = 0 and next apply the Lagrangian function, N ( T 1 , T 2 , T 3 , T 4 , τ ) = TC ( L ) τ ( T 2 T 1 ) say, where τ is the Lagrange multiplier. By taking the partial derivatives of N with respect to the cycle periods T 1 , T 2 , T 3 , T 4 and the Lagrange multiplier τ , we get the system of equations given by
    N T 1 = 1 6 R 01 T 4 2 + ( d 1 + f 1 + f 1 G c ) θ T 4 2 σ e G T 4 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 4 2 + τ = 0 ,
    N T 2 = 1 6 R 02 T 3 2 + ( d 2 + f 2 + f 2 G c ) θ T 3 2 σ e G T 3 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 3 2 τ = 0 ,
    N T 3 = 2 6 R 03 T 2 2 + ( d 3 + f 3 + f 3 G c ) θ T 2 2 σ e G T 2 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 2 2 τ = 0 ,
    N T 4 = 1 6 R 04 T 1 2 + ( d 4 + f 4 + f 4 G c ) θ T 1 2 σ e G T 1 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 1 2 = 0 ,
    and
    N τ = ( T 2 T 1 ) = 0 ,
    obtaining
    T 1 = T 2 = 2 ( R 04 + 2 R 03 ) + ( 1 o e o ) ( f 4 J c + 2 f 3 J c ) ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h ( M 4 J e + 2 M 3 J e ) 2 d 4 + 2 d 3 + ( f 4 + 2 f 3 ) + ( f 4 J c + 2 f 4 J c ) h h 2 σ e G ,
    T 3 = 2 R 02 + ( 1 o e o ) f 2 J c ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h M 2 J e 2 d 2 + f 2 + f 2 J c h h 2 σ e G ,
    and
    T 4 = 2 R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G
    Based on this, we observe that T 3 > T 4 , which indicates that further adjustments to the constraints are required to ensure the correct order of T 1 T 2 T 3 T 4 . These adjustments may involve revising the Lagrange multipliers or modifying the conditions imposed on the system to guarantee compliance with the required sequence.
  • Step 3—Convert the constraints of T 2 T 1 0 and T 3 T 2 0 into T 2 T 1 = 0 and T 3 T 2 = 0 , respectively and then optimize TC ( L ) using the Lagrangian method as
    N ( T 1 , T 2 , T 3 , T 4 , τ 1 , τ 2 ) = TC ( L ) τ 1 ( T 2 T 1 ) τ 2 ( T 3 T 2 ) ,
    where τ 1 and τ 2 are the Lagrange multipliers, with the partial derivatives of N being formulated as
    N T 1 = 1 6 R 01 T 4 2 + ( d 1 + f 1 + f 1 J c ) T 4 2 σ e G T 4 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 4 2 + τ 1 = 0 ,
    N T 2 = 2 6 R 02 T 3 2 + ( d 2 + f 2 + f 2 J c ) T 3 2 σ e G T 3 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 3 2 τ 1 + τ 2 = 0 ,
    N T 3 = 2 6 R 03 T 2 2 + ( d 3 + f 3 + f 3 J c ) T 2 2 σ e G T 2 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 2 2 τ 2 = 0 ,
    N T 4 = 1 6 R 01 T 1 2 + ( d 4 + f 4 + f 4 J c ) T 1 2 σ e G T 1 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 1 2 = 0 ,
    and
    N τ 1 = ( T 2 T 1 ) , N τ 2 = ( T 3 T 2 ) .
    From the above expressions, we obtain
    T 1 = T 2 = T 3 = 2 ( R 04 + 2 R 03 + 2 R 02 ) + ( 1 o e o ) ( f 4 J c + 2 f 3 J c + 2 f 2 J c ) ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) ( M 4 J e + 2 M 3 J e + 2 M 2 J e ) 2 d 2 + 2 d 3 + 2 d 2 + ( f 4 + 2 f 3 + 2 f 2 ) + ( f 4 J c + 2 f 3 J c + 2 f 2 J c ) h h 2 σ e G
    and
    T 4 = 2 R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G ,
    indicating that T 4 > T 1 . Therefore, further adjustments to the constraints are needed to satisfy the required order of cycle periods.
  • Step 4—Convert the constraints of T 2 T 1 0 , T 3 T 2 0 , and T 4 T 3 0 into T 2 T 1 = 0 , T 3 T 2 = 0 , and T 4 T 3 = 0 , respectively, and use the Lagrangian function given by
    N ( T 1 , T 2 , T 3 , T 4 , τ 1 , τ 2 , τ 3 ) = TC ( L ) τ 1 ( T 2 T 1 ) τ 2 ( T 3 T 2 ) τ 3 ( T 4 T 3 ) ,
    where τ 1 , τ 2 , and τ 3 are the Lagrange multipliers, with the partial derivatives of N being presented as
    N T 1 = 1 6 R 01 T 4 2 + ( d 1 + f 1 + f 1 J c ) T 4 2 σ e G T 4 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 4 2 + τ 1 = 0 ,
    N T 2 = 2 6 R 02 T 3 2 + ( d 2 + f 2 + f 2 J c ) T 3 2 σ e G T 3 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 3 2 τ 1 + τ 2 = 0 ,
    N T 3 = 2 6 R 03 T 2 2 + ( d 3 + f 3 + f 3 J c ) T 2 2 σ e G T 2 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 2 2 τ 2 = 0 ,
    N T 4 = 1 6 R 01 T 1 2 + ( d 4 + f 4 + f 4 J c ) T 1 2 σ e G T 1 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 1 2 τ 3 = 0 ,
    and
    N τ 1 = ( T 2 T 1 ) , N τ 2 = ( T 3 T 2 ) , N τ 3 = ( T 4 T 3 ) .
    Then, the cycle periods are given by
    T 1 = T 2 = T 3 = T 4 = 2 ( R 04 + 2 R 03 + 2 R 02 + R 01 ) + ( 1 o e o ) J c ( f 4 + 2 f 3 + 2 f 2 + f 1 ) ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h J e ( M 4 + 2 M 3 + 2 M 2 + M 1 ) 2 d 4 + 2 d 3 + 2 d 2 + d 1 + ( f 4 + 2 f 3 + 2 f 2 + f 1 ) + J c ( f 4 + 2 f 3 + 2 f 2 + f 1 ) h h 2 σ e G .
    Therefore, the solution of T * = ( T 1 , T 2 , T 3 , T 4 ) satisfies all inequality constraints. Thus, we obtain the TC using the nonlinear Lagrangian method for the fuzzy inventory model defined in (5) for the case of TFNs. To summarize and visualize these steps, we present Algorithm 1 and the corresponding flow chart in Figure 2 for better visualization.
Algorithm 1: Lagrangian method for solving EOQ models.
Axioms 13 00743 i001

3.6. Case of Pentagonal Fuzzy Numbers

We now extend the fuzzy inventory model TC to the case of PFNs. Unlike the trapezoidal case, where the cycle period (T) was divided into four subintervals, in the pentagonal case, the cycle length is divided into five subintervals. This affects the overall optimization process and allows for a more granular modeling of uncertainty. The relevant crisp variables are converted into fuzzy variables represented by PFNs, including the cycle length T = ( T 1 , T 2 , T 3 , T 4 , T 5 ) , the demand rate d = ( d 1 , d 2 , d 3 , d 4 , d 5 ) , the setup cost R 0 = ( R 01 , R 02 , R 03 , R 04 , R 05 ) , the holding cost F = ( f 1 , f 2 , f 3 , f 4 , f 5 ) , and the manufacturing cost M = ( M 1 , M 2 , M 3 , M 4 , M 5 ) .
Applying the GMI method to these variables, we reach the expression for the TC stated as
TC ( L ) = 1 6 R 01 T 5 + ( d 1 + f 1 + f 1 J c ) ( σ e G t 1 h L ) T 5 + f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 5 ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 5 + 3 R 02 T 4 + ( d 2 + f 2 + f 2 J c ) ( σ e G t 1 h L ) T 4 + f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 4 ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 4 + 4 R 03 T 3 + ( d 3 + f 3 + f 3 J c ) ( σ e G t 1 h L ) T 3 + f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 3 ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 3 + 3 R 04 T 2 + ( d 4 + f 4 + f 4 J c ) ( σ e G t 1 h L ) T 2 + f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 2 ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 2 + R 05 T 1 + ( d 5 + f 5 + f 5 J c ) ( σ e G t 1 h L ) T 1 + f 5 J c ( 1 o e o ) ( σ e G h ) 2 T 1 ( o 2 ( 1 ϑ ) p 2 ) M 5 h J e 2 T 1 ,
where 0 < T 1 T 2 T 3 T 4 T 5 . The inequality conditions 0 < T 1 T 2 T 3 T 4 T 5 can be expressed as T 2 T 1 0 , T 3 T 2 0 , T 4 T 3 0 , T 5 T 4 0 , and T 1 > 0 . To determine the minimum, we employ the Lagrange method considering the following five steps:
  • Step 1—Consider the results given by
    TC T 1 = 0 T 1 = R 05 + ( 1 o e o ) f 5 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 5 J e 2 d 5 + f 5 + f 5 J c h h 2 σ e G ,
    TC T 2 = 0 , T 2 = 3 R 04 + ( 1 o e o ) f 4 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 4 J e 2 d 4 + f 4 + f 4 J c h h 2 σ e G ,
    TC T 3 = 0 , T 3 = 4 R 03 + ( 1 o e o ) f 3 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 3 J e 2 d 3 + f 3 + f 3 J c h h 2 σ e G ,
    TC T 4 = 0 , T 4 = 3 R 02 + ( 1 o e o ) f 2 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 2 J e 2 d 2 + f 2 + f 2 J c h h 2 σ e G ,
    and
    TC T 5 = 0 , T 5 = R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G .
    From the above results, we obtain T 1 > T 2 > T 3 > T 4 > T 5 , which does not satisfy the required condition of 0 < T 1 T 2 T 3 T 4 T 5 . Therefore, we must adjust the constraints to ensure that the solution satisfies the required ordering. Possible adjustments include revising the Lagrange multipliers or introducing stricter conditions for the cycle lengths to guarantee the required sequence.
  • Step 2—Convert the constraint of T 2 T 1 0 into T 2 T 1 = 0 and use the Lagrangian function given by N ( T 1 , T 2 , T 3 , T 4 , T 5 , τ ) = TC ( L ) τ ( T 2 T 1 ) , where τ is the Lagrange multiplier, to obtain
    N T 1 = 1 6 R 01 T 5 2 + ( d 1 + f 1 + f 1 G c ) T 5 2 σ e G T 5 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 5 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 5 2 + τ = 0 ,
    N T 2 = 3 6 R 02 T 4 2 + ( d 2 + f 2 + f 2 G c ) T 4 2 σ e G T 4 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 4 2 τ = 0 ,
    N T 3 = 4 6 R 03 T 3 2 + ( d 3 + f 3 + f 3 G c ) T 3 2 σ e G T 3 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 3 2 τ = 0 ,
    N T 4 = 3 6 R 04 T 2 2 + ( d 4 + f 4 + f 4 G c ) T 2 2 σ e G T 2 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 2 2 τ = 0 ,
    N T 5 = 1 6 R 05 T 1 2 + ( d 5 + f 5 + f 5 G c ) T 1 2 σ e G T 1 h t 1 h t t 1 f 5 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 5 h J e 2 T 1 2 = 0 ,
    and
    N τ = ( T 2 T 1 ) = 0 ,
    reaching
    T 1 = T 2 = 3 ( R 05 + 2 R 04 ) + ( 1 o e o ) ( f 5 J c + 2 f 4 J c ) ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h ( M 5 J e + 2 M 4 J e ) 2 d 5 + 2 d 4 + ( f 5 + 2 f 4 ) + ( f 5 J c + 2 f 4 J c ) h h 2 σ e G ,
    T 3 = 4 R 03 + ( 1 o e o ) f 3 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 3 J e 2 d 3 + f 3 + f 3 J c h h 2 σ e G ,
    T 4 = 3 R 02 + ( 1 o e o ) f 2 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 2 J e 2 d 2 + f 2 + f 2 J c h h 2 σ e G ,
    and
    T 5 = R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G .
    From the above expressions, we observe that T 4 > T 5 , which violates the required condition of 0 < T 1 T 2 T 3 T 4 T 5 . Thus, it is necessary to further adjust the constraints to ensure that the solution meets the specified conditions.
  • Step 3—Convert the constraints of T 2 T 1 0 , T 3 T 2 0 , T 4 T 3 0 , and T 5 T 4 0 into equalities of T 2 T 1 = 0 , T 3 T 2 = 0 , T 4 T 3 = 0 , and T 5 T 4 = 0 , respectively, and apply the Lagrangian function defined by
    N ( T 1 , T 2 , T 3 , T 4 , T 5 , τ 1 , τ 2 , τ 3 , τ 4 ) = TC ( L ) τ 1 ( T 2 T 1 ) τ 2 ( T 3 T 2 ) τ 3 ( T 4 T 3 ) τ 4 ( T 5 T 4 ) ,
    where τ 1 , τ 2 , τ 3 , and τ 4 are the Lagrange multipliers used, to obtain
    N T 1 = 1 6 R 01 T 5 2 + ( d 1 + f 1 + f 1 J c ) T 5 2 σ e G T 5 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 5 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 5 2 + τ 1 = 0 ,
    N T 2 = 3 6 R 02 T 4 2 + ( d 2 + f 2 + f 2 J c ) T 4 2 σ e G T 4 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 4 2 τ 1 + τ 2 = 0 ,
    N T 3 = 4 6 R 03 T 3 2 + ( d 3 + f 3 + f 3 J c ) T 3 2 σ e G T 3 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 3 2 τ 2 = 0 ,
    N T 4 = 3 6 R 04 T 2 2 + ( d 4 + f 4 + f 4 J c ) T 2 2 σ e G T 2 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 2 2 τ 3 = 0 ,
    N T 5 = 1 6 R 05 T 1 2 + ( d 5 + f 5 + f 5 J c ) T 1 2 σ e G T 1 h t 1 h t t 1 f 5 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 5 h J e 2 T 1 2 τ 4 = 0 ,
    and
    N τ 1 = ( T 2 T 1 ) , N τ 2 = ( T 3 T 2 ) , N τ 3 = ( T 4 T 3 ) , N τ 4 = ( T 5 T 4 ) . ) )
    Then, solving these equations, we get
    T 1 = T 2 = T 3 = 3 ( R 05 + 3 R 04 + 4 R 03 ) + ( 1 o e o ) ( f 5 J c + 3 f 4 J c + 4 f 3 J c ) ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) ( M 5 J e + 3 M 4 J e + 4 M 3 J e ) 2 d 5 + 3 d 4 + 4 d 3 + ( f 5 + 3 f 4 + 4 f 3 ) + ( f 5 J c + 3 f 4 J c + 4 f 3 J c ) h h 2 σ e G ,
    T 4 = 3 R 02 + ( 1 o e o ) f 2 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 2 J e 2 d 2 + f 2 + f 2 J c h h 2 σ e G ,
    and
    T 5 = R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G .
    From the above expressions, we find that T 4 > T 5 , which indicates a violation of the required condition of 0 < T 1 T 2 T 3 T 4 T 5 . Therefore, further adjustments to the constraints are necessary to ensure that the solution meets the required conditions.
  • Step 4—Convert the constraints of T 2 T 1 0 , T 3 T 2 0 , T 4 T 3 0 , and T 5 T 4 0 into equalities of T 2 T 1 = 0 , T 3 T 2 = 0 , T 4 T 3 = 0 , and T 5 T 4 = 0 , respectively, and employ the Lagrangian function given by
    N ( T 1 , T 2 , T 3 , T 4 , T 5 , τ 1 , τ 2 , τ 3 , τ 4 ) = TC ( L ) τ 1 ( T 2 T 1 ) τ 2 ( T 3 T 2 ) τ 3 ( T 4 T 3 ) τ 4 ( T 5 T 4 )
    where τ 1 , τ 2 , τ 3 , and τ 4 are the Lagrange multipliers. Taking the partial derivatives of N with respect to the variables T 1 , T 2 , T 3 , T 4 , T 5 and the multipliers τ 1 , τ 2 , τ 3 , τ 4 , we obtain the system of equations stated as
    N T 1 = 1 6 R 01 T 5 2 + ( d 1 + f 1 + f 1 J c ) T 5 2 σ e G T 5 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 5 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 5 2 + τ 1 = 0 ,
    N T 2 = 3 6 R 02 T 4 2 + ( d 2 + f 2 + f 2 J c ) T 4 2 σ e G T 4 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 4 2 τ 1 + τ 2 = 0 ,
    N T 3 = 4 6 R 03 T 3 2 + ( d 3 + f 3 + f 3 J c ) T 3 2 σ e G T 3 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 3 2 τ 2 = 0 ,
    N T 4 = 3 6 R 04 T 2 2 + ( d 4 + f 4 + f 4 J c ) T 2 2 σ e G T 2 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 2 2 τ 3 = 0 ,
    N T 5 = 1 6 R 05 T 1 2 + ( d 5 + f 5 + f 5 J c ) T 1 2 σ e G T 1 h t 1 h t t 1 f 5 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 5 h J e 2 T 1 2 τ 4 = 0 ,
    and
    N τ 1 = ( T 2 T 1 ) , N τ 2 = ( T 3 T 2 ) , N τ 3 = ( T 4 T 3 ) , N τ 4 = ( T 5 T 4 ) .
    Then, we obtain
    T 1 = T 2 = T 3 = T 4 = 3 ( R 05 + 3 R 04 + 4 R 03 + 3 R 02 ) + ( 1 o e o ) ( f 5 J c + 3 f 4 J c + 4 f 3 J c + 3 f 2 J c ) ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) ( M 5 J e + 3 M 4 J e + 4 M 3 J e + 3 M 2 J e ) 2 d 5 + 3 d 4 + 4 d 3 + 3 d 2 + ( f 5 + 3 f 4 + 4 f 3 + 3 f 2 ) + ( f 5 J c + 3 f 4 J c + 4 f 3 J c + 3 f 2 J c ) h h 2 σ e G ,
    and
    T 5 = R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G .
    From the above expressions, we observe that T 5 > T 1 , which contradicts the requirement of 0 < T 1 T 2 T 3 T 4 T 5 . Therefore, we need to further adjust the constraints to ensure that the solution meets the required conditions.
  • Step 5—Convert the constraints of T 2 T 1 0 , T 3 T 2 0 , and T 4 T 3 0 into equalities of T 2 T 1 = 0 , T 3 T 2 = 0 , and T 4 T 3 = 0 , respectively, and optimize TC ( L ) using the Lagrangian method as
    N ( T 1 , T 2 , T 3 , T 4 , T 5 , τ 1 , τ 2 , τ 3 ) = TC ( L ) τ 1 ( T 2 T 1 ) τ 2 ( T 3 T 2 ) τ 3 ( T 4 T 3 ) .
    generating
    N T 1 = 1 6 R 01 T 5 2 + ( d 1 + f 1 + f 1 J c ) T 5 2 σ e G T 5 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 5 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 5 2 + τ 1 = 0 ,
    N T 2 = 3 6 R 02 T 4 2 + ( d 2 + f 2 + f 2 J c ) T 4 2 σ e G T 4 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 4 2 τ 1 + τ 2 = 0 ,
    N T 3 = 4 6 R 03 T 3 2 + ( d 3 + f 3 + f 3 J c ) T 3 2 σ e G T 3 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 3 2 τ 2 = 0 ,
    N T 4 = 3 6 R 04 T 2 2 + ( d 4 + f 4 + f 4 J c ) T 2 2 σ e G T 2 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 2 2 τ 3 = 0 ,
    N T 5 = 1 6 R 05 T 1 2 + ( d 5 + f 5 + f 5 J c ) T 1 2 σ e G T 1 h t 1 h t t 1 f 5 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 5 h J e 2 T 1 2 = 0 ,
    and
    N τ 1 = ( T 2 T 1 ) , N τ 2 = ( T 3 T 2 ) , N τ 3 = ( T 4 T 3 ) ,
    arriving at
    T 1 = T 2 = T 3 = T 4 = T 5 = 3 ( R 05 + 3 R 04 + 4 R 03 + 3 R 02 + R 01 ) + ( 1 o e o ) J c ( f 5 + 3 f 4 + 4 f 3 + 3 f 2 + f 1 ) ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h J e ( M 5 + 3 M 4 + 4 M 3 + 3 M 2 + M 1 ) 2 d 5 + 3 d 4 + 4 d 3 + 3 d 2 + d 1 + ( f 5 + 3 f 4 + 4 f 3 + 3 f 2 + f 1 ) + J c ( f 5 + 3 f 4 + 4 f 3 + 3 f 2 + f 1 ) h h 2 σ e G
    and
    T 5 = R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G .
    From the above expressions, we observe that T 5 > T 1 , which violates the required condition of 0 < T 1 T 2 T 3 T 4 T 5 . Consequently, it is necessary to further adjust the constraints to ensure that the solution meets the imposed conditions.
  • Step 6—Convert the constraints of T 2 T 1 0 , T 3 T 2 0 , T 4 T 3 0 , and T 5 T 4 0 into equalities of T 2 T 1 = 0 , T 3 T 2 = 0 , T 4 T 3 = 0 , and T 5 T 4 = 0 , respectively, with the corresponding Lagrangian function being expressed as
    N ( T 1 , T 2 , T 3 , T 4 , T 5 , τ 1 , τ 2 , τ 3 , τ 4 ) = TC ( L ) τ 1 ( T 2 T 1 ) τ 2 ( T 3 T 2 ) τ 3 ( T 4 T 3 ) τ 4 ( T 5 T 4 ) ,
    where τ 1 , τ 2 , τ 3 , and τ 4 are the Lagrange multipliers. By taking the partial derivatives of N with respect to the cycle periods ( T 1 , T 2 , T 3 , T 4 , T 5 ) and the Lagrange multipliers ( τ 1 , τ 2 , τ 3 , τ 4 ), we obtain
    N T 1 = 1 6 R 01 T 5 2 + ( d 1 + f 1 + f 1 J c ) T 5 2 σ e G T 5 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 5 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 5 2 + τ 1 = 0 ,
    N T 2 = 3 6 R 02 T 4 2 + ( d 2 + f 2 + f 2 J c ) T 4 2 σ e G T 4 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 4 2 τ 1 + τ 2 = 0 ,
    N T 3 = 4 6 R 03 T 3 2 + ( d 3 + f 3 + f 3 J c ) T 3 2 σ e G T 3 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 3 2 τ 2 = 0 ,
    N T 4 = 3 6 R 04 T 2 2 + ( d 4 + f 4 + f 4 J c ) T 2 2 σ e G T 2 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 2 2 τ 3 = 0 ,
    N T 5 = 1 6 R 05 T 1 2 + ( d 5 + f 5 + f 5 J c ) T 1 2 σ e G T 1 h t 1 h t t 1 f 5 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 5 h J e 2 T 1 2 τ 4 = 0 ,
    and
    N τ 1 = ( T 2 T 1 ) , N τ 2 = ( T 3 T 2 ) , N τ 3 = ( T 4 T 3 ) , N τ 4 = ( T 5 T 4 ) ,
    reaching
    T 1 = T 2 = T 3 = T 4 = T 5 = 3 ( R 05 + 3 R 04 + 4 R 03 + 3 R 02 + R 01 ) + ( 1 o e o ) J c ( f 5 + 3 f 4 + 4 f 3 + 3 f 2 + f 1 ) ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h J e ( M 5 + 3 M 4 + 4 M 3 + 3 M 2 + M 1 ) 2 d 5 + 3 d 4 + 4 d 3 + 3 d 2 + d 1 + ( f 5 + 3 f 4 + 4 f 3 + 3 f 2 + f 1 ) + J c ( f 5 + 3 f 4 + 4 f 3 + 3 f 2 + f 1 ) h h 2 σ e G ,
    Thus, the solution of T * = ( T 1 , T 2 , T 3 , T 4 , T 5 ) satisfies all the inequality constraints, ensuring an optimal cycle period.

3.7. Case of Hexagonal Fuzzy Numbers

Next, we extend the fuzzy inventory model to the case of HFNs. Similar to the trapezoidal and pentagonal cases, the relevant crisp variables are converted into fuzzy variables represented by HFNs. However, in this case, the cycle length (T) is divided into six subintervals, allowing for a finer and more detailed representation of uncertainty and variability. The variables involved in this division include the cycle length T = ( T 1 , T 2 , T 3 , T 4 , T 5 , T 6 ) , the demand rate d = ( d 1 , d 2 , d 3 , d 4 , d 5 , d 6 ) , the setup cost R 0 = ( R 01 , R 02 , R 03 , R 04 , R 05 , R 06 ) , the holding cost F = ( f 1 , f 2 , f 3 , f 4 , f 5 , f 6 ) , and the manufacturing cost M = ( M 1 , M 2 , M 3 , M 4 , M 5 , M 6 ) .
The TC for the manufactured product using HFNs and the GMI method is expressed as
TC ( L ) = 1 6 R 01 T 6 + ( d 1 + f 1 + f 1 J c ) ( σ e G t 1 h L 6 ) T 6 + f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 6 ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 6 + 3 R 02 T 5 + ( d 2 + f 2 + f 2 J c ) ( σ e G t 1 h L 5 ) T 5 + f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 5 ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 5 + 2 R 03 T 4 + ( d 3 + f 3 + f 3 J c ) ( σ e G t 1 h L 4 ) T 4 + f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 4 ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 4 + 2 R 04 T 3 + ( d 4 + f 4 + f 4 J c ) ( σ e G t 1 h L 3 ) T 3 + f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 3 ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 3 + 3 R 05 T 2 + ( d 5 + f 5 + f 5 J c ) ( σ e G t 1 h L 2 ) T 2 + f 5 J c ( 1 o e o ) ( σ e G h ) 2 T 2 ( o 2 ( 1 ϑ ) p 2 ) M 5 h J e 2 T 2 + R 06 T 1 + ( d 6 + f 6 + f 6 J c ) ( σ e G t 1 h L 1 ) T 1 + f 6 J c ( 1 o e o ) ( σ e G h ) 2 T 1 ( o 2 ( 1 ϑ ) p 2 ) M 6 h J e 2 T 1 ,
where 0 < T 1 T 2 T 3 T 4 T 5 T 6 . These inequality conditions can be reformulated as T 2 T 1 0 , T 3 T 2 0 , T 4 T 3 0 , T 5 T 4 0 , T 6 T 5 0 , T 1 > 0 . To determine the minimum value of the TC, we apply the Lagrangian method according to the following six steps:
  • Step 1—Find the minimum of TC ( L ) from
    TC T 1 = 0 T 1 = R 06 + ( 1 o e o ) f 6 J c ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h M 6 J e 2 d 6 + f 6 + f 6 J c h h 2 σ e G ,
    TC T 2 = 0 T 2 = 3 R 05 + ( 1 o e o ) f 5 J c ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h M 5 J e 2 d 5 + f 5 + f 5 J c h h 2 σ e G ,
    TC T 3 = 0 T 3 = 2 R 04 + ( 1 o e o ) f 4 J c ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h M 4 J e 2 d 4 + f 4 + f 4 J c h h 2 σ e G ,
    TC T 4 = 0 T 4 = 2 R 03 + ( 1 o e o ) f 3 J c ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h M 3 J e 2 d 3 + f 3 + f 3 J c h h 2 σ e G ,
    TC T 5 = 0 T 5 = 3 R 02 + ( 1 o e o ) f 2 J c ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h M 2 J e 2 d 2 + f 2 + f 2 J c h h 2 σ e G ,
    and
    TC T 6 = 0 T 6 = R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G .
    From the above expressions, we observe that T 1 > T 2 > T 3 > T 4 > T 5 > T 6 , which does not satisfy the required condition of 0 < T 1 T 2 T 3 T 4 T 5 T 6 .
  • Step 2—Convert the constraint of T 2 T 1 0 into the equality of T 2 T 1 = 0 , with the corresponding Lagrangian function being defined as
    N ( T 1 , T 2 , T 3 , T 4 , T 5 , T 6 , τ ) = TC ( L ) τ ( T 2 T 1 ) ,
    where τ is the Lagrange multiplier, to generate
    N T 1 = 1 6 R 01 T 6 2 + ( d 1 + f 1 + f 1 G c ) θ T 6 2 σ e G T 6 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 6 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 6 2 + τ = 0 ,
    N T 2 = 3 6 R 02 T 5 2 + ( d 2 + f 2 + f 2 G c ) θ T 5 2 σ e G T 5 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 5 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 5 2 τ = 0 ,
    N T 3 = 2 6 R 03 T 4 2 + ( d 3 + f 3 + f 3 G c ) θ T 4 2 σ e G T 4 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 4 2 τ = 0 ,
    N T 4 = 2 6 R 03 T 3 2 + ( d 4 + f 4 + f 4 G c ) θ T 3 2 σ e G T 4 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 3 2 τ = 0 ,
    N T 5 = 3 6 R 04 T 2 2 + ( d 4 + f 4 + f 4 G c ) θ T 2 2 σ e G T 2 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 2 2 τ = 0 ,
    N T 6 = 1 6 R 06 T 1 2 + ( d 6 + f 6 + f 6 G c ) θ T 1 2 σ e G T 1 h t 1 h t t 1 f 6 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 6 h J e 2 T 1 2 = 0 ,
    and
    N τ = ( T 2 T 1 ) = 0 ,
    obtaining
    T 1 = T 2 = ( R 06 + 2 R 05 ) + ( 1 o e o ) ( f 6 J c + 2 f 5 J c ) ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h ( M 6 J e + 2 M 5 J e ) 2 d 6 + 2 d 5 + ( f 6 + 2 f 5 ) + ( f 6 J c + 2 f 5 J c ) h h 2 σ e G ,
    T 3 = 3 R 04 + ( 1 o e o ) f 4 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 4 J e 2 d 4 + f 4 + f 4 J c h h 2 σ e G ,
    T 4 = 2 R 03 + ( 1 o e o ) f 3 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 3 J e 2 d 3 + f 3 + f 3 J c h h 2 σ e G ,
    T 5 = R 02 + ( 1 o e o ) f 2 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 2 J e 2 d 2 + f 2 + f 2 J c h h 2 σ e G ,
    and
    T 6 = 3 R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G .
    From the above expressions, we observe that T 5 > T 6 , which does not satisfy the condition of 0 < T 1 T 2 T 3 T 4 T 5 T 6 .
  • Step 3—Convert the constraints of T 2 T 1 0 , T 3 T 2 0 , T 4 T 3 0 , T 5 T 4 0 , and T 6 T 5 0 into equalities of T 2 T 1 = 0 , T 3 T 2 = 0 , T 4 T 3 = 0 , T 5 T 4 = 0 , and T 6 T 5 = 0 , respectively, with the corresponding Lagrangian function being given by
    N ( T 1 , T 2 , T 3 , T 4 , T 5 , T 6 , τ 1 , τ 2 , τ 3 , τ 4 , τ 5 ) = TC ( L ) τ 1 ( T 2 T 1 ) τ 2 ( T 3 T 2 ) τ 3 ( T 4 T 3 ) τ 4 ( T 5 T 4 ) τ 5 ( T 6 T 5 ) ,
    where τ 1 , τ 2 , τ 3 , τ 4 , and τ 5 are the Lagrange multipliers, attaining at
    N T 1 = 1 6 R 01 T 6 2 + ( d 1 + f 1 + f 1 J c ) T 6 2 σ e G T 6 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 6 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 6 2 + τ 1 = 0 ,
    N T 2 = 3 6 R 02 T 5 2 + ( d 2 + f 2 + f 2 J c ) T 5 2 σ e G T 5 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 5 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 5 2 τ 1 + τ 2 = 0 ,
    N T 3 = 2 6 R 03 T 4 2 + ( d 3 + f 3 + f 3 J c ) T 4 2 σ e G T 4 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 4 2 τ 2 = 0 ,
    N T 4 = 2 6 R 04 T 3 2 + ( d 4 + f 4 + f 4 J c ) T 3 2 σ e G T 3 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 3 2 τ 3 = 0 ,
    N T 5 = 3 6 R 05 T 2 2 + ( d 5 + f 5 + f 5 J c ) T 2 2 σ e G T 2 h t 1 h t t 1 f 5 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 5 h J e 2 T 2 2 τ 4 = 0 ,
    N T 6 = 1 6 R 06 T 1 2 + ( d 1 + f 6 + f 6 J c ) T 1 2 σ e G T 1 h t 1 h t t 1 f 6 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 6 h J e 2 T 1 2 τ 5 = 0 ,
    and
    N τ 1 = ( T 2 T 1 ) , N τ 2 = ( T 3 T 2 ) , N τ 3 = ( T 4 T 3 ) , N τ 4 = ( T 5 T 4 ) ,
    generating
    T 1 = T 2 = T 3 = 3 ( R 06 + 3 R 05 + 2 R 04 ) + ( 1 o e o ) ( f 6 J c + 3 f 5 J c + 2 f 4 J c ) ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) ( M 6 + 3 M 5 J e + 2 M 4 J e ) 2 d 6 + 3 d 5 + 2 d 4 + ( f 6 + 3 f 5 + 2 f 4 ) + ( f 6 J c + 3 f 5 J c + 2 f 4 J c ) h h 2 σ e G .
    T 4 = 2 R 03 + ( 1 o e o ) f 3 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 3 J e 2 d 3 + f 3 + f 3 J c h h 2 σ e G ,
    T 5 = R 02 + ( 1 o e o ) f 2 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 2 J e 2 d 2 + f 2 + f 2 J c h h 2 σ e G ,
    and
    T 6 = 3 R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G .
  • Step 4—Convert the constraints of T 2 T 1 0 and T 3 T 2 0 into equalities of T 2 T 1 = 0 and T 3 T 2 = 0 , respectively, and next optimize TC ( L ) using the Lagrangian method defined as
    N ( T 1 , T 2 , T 3 , T 4 , T 5 , T 6 , τ 1 , τ 2 , τ 3 , τ 4 ) = TC ( L ) τ 1 ( T 2 T 1 ) τ 2 ( T 3 T 2 ) τ 3 ( T 4 T 3 ) τ 4 ( T 5 T 4 ) ,
    where τ 1 , τ 2 , τ 3 , τ 4 are the Lagrange multipliers, attaining at
    N T 1 = 1 6 R 01 T 6 2 + ( d 1 + f 1 + f 1 J c ) T 6 2 σ e G T 6 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 6 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 6 2 + τ 1 = 0 ,
    N T 2 = 3 6 R 02 T 5 2 + ( d 2 + f 2 + f 2 J c ) T 5 2 σ e G T 5 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 5 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 5 2 τ 1 + τ 2 = 0 ,
    N T 3 = 2 6 R 03 T 4 2 + ( d 3 + f 3 + f 3 J c ) T 4 2 σ e G T 4 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 4 2 τ 2 = 0 ,
    N T 4 = 2 6 R 04 T 3 2 + ( d 4 + f 4 + f 4 J c ) T 3 2 σ e G T 3 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 3 2 τ 3 = 0 ,
    N T 5 = 3 6 R 05 T 2 2 + ( d 5 + f 5 + f 5 J c ) T 2 2 σ e G T 2 h t 1 h t t 1 f 5 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 5 h J e 2 T 2 2 τ 4 = 0 ,
    N T 6 = 1 6 R 06 T 1 2 + ( d 6 + f 6 + f 6 J c ) T 1 2 σ e G T 1 h t 1 h t t 1 f 6 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 6 h J e 2 T 1 2 = 0 ,
    and
    N τ 1 = ( T 2 T 1 ) , N τ 2 = ( T 3 T 2 ) , N τ 3 = ( T 3 T 3 ) , N τ 4 = ( T 5 T 4 ) .
    obtaining
    T 1 = T 2 = T 3 = T 4 = 3 ( R 06 + 3 R 05 + 2 R 04 + 2 R 03 ) + ( 1 o e o ) ( f 6 J c + 3 f 5 J c + 2 f 4 J c + 2 f 3 J c ) ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) ( M 6 + 3 M 5 J e + 2 M 4 J e + 2 M 3 J e ) 2 d 6 + 3 d 5 + 2 d 4 + 2 d 3 ( f 6 + 3 f 5 + 2 f 4 + 2 f 3 ) + ( f 6 J c + 3 f 5 J c + 2 f 4 J c + 2 f 3 J c ) h h 2 σ e G ,
    T 5 = R 02 + ( 1 o e o ) f 2 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 2 J e 2 d 2 + f 2 + f 2 J c h h 2 σ e G ,
    and
    T 6 = R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G .
    From the above expressions, we observe that T 6 > T 1 , which violates the condition of 0 < T 1 T 2 T 3 T 4 T 5 T 6 .
  • Step 5—Convert the constraints of T 2 T 1 0 , T 3 T 2 0 , T 4 T 3 0 , T 5 T 4 0 , and T 6 T 5 0 into equalities of T 2 T 1 = 0 , T 3 T 2 = 0 , T 4 T 3 = 0 , T 5 T 4 = 0 , and T 6 T 5 = 0 , respectively, then optimize TC ( L ) using the Lagrangian method defined as
    N ( T 1 , T 2 , T 3 , T 4 , T 5 , T 6 , τ 1 , τ 2 , τ 3 , τ 4 , τ 5 ) = TC ( L ) τ 1 ( T 2 T 1 ) τ 2 ( T 3 T 2 ) τ 3 ( T 4 T 3 ) τ 4 ( T 5 T 4 ) τ 5 ( T 6 T 5 ) ,
    where τ 1 , τ 2 , τ 3 , τ 4 , τ 5 are the Lagrange multipliers, to obtain
    N T 1 = 1 6 R 01 T 6 2 + ( d 1 + f 1 + f 1 J c ) T 6 2 σ e G T 6 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 6 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 6 2 + τ 1 = 0 ,
    N T 2 = 3 6 R 02 T 5 2 + ( d 2 + f 2 + f 2 J c ) T 5 2 σ e G T 5 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 5 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 5 2 τ 1 + τ 2 = 0 ,
    N T 3 = 2 6 R 03 T 4 2 + ( d 3 + f 3 + f 3 J c ) T 4 2 σ e G T 4 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 4 2 τ 2 = 0 ,
    N T 4 = 2 6 R 04 T 3 2 + ( d 4 + f 4 + f 4 J c ) T 3 2 σ e G T 3 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 3 2 τ 3 = 0 ,
    N T 5 = 3 6 R 05 T 2 2 + ( d 5 + f 5 + f 5 J c ) T 2 2 σ e G T 2 h t 1 h t t 1 f 5 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 5 h J e 2 T 2 2 τ 4 = 0 ,
    N T 6 = 1 6 R 06 T 1 2 + ( d 6 + f 6 + f 6 J c ) T 1 2 σ e G T 1 h t 1 h t t 1 f 6 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 6 h J e 2 T 1 2 τ 5 = 0 ,
    and
    N τ 1 = ( T 2 T 1 ) , N τ 2 = ( T 3 T 2 ) , N τ 3 = ( T 4 T 3 ) , N τ 4 = ( T 5 T 4 ) , N τ 5 = ( T 6 T 5 ) ,
    generating
    T 1 = T 2 = T 3 = T 4 = T 5 = 3 ( R 06 + 3 R 05 + 2 R 04 + 2 R 03 + 3 R 02 ) + ( 1 o e o ) ( f 6 J c + 3 f 5 J c + 2 f 4 J c + 2 f 3 J c + 3 f 2 J c ) ( σ e G h ) θ 2 ( o 2 p 2 ( 1 ϑ ) ) ( M 6 + 3 M 5 J e + 2 M 4 J e + 2 M 3 J e + 3 M 2 J e ) 2 d 6 + 3 d 5 + 2 d 4 + 2 d 3 + 3 d 2 + ( f 6 + 3 f 5 + 2 f 4 + 2 f 3 + 3 f 2 ) + ( f 6 J c + 3 f 5 J c + 2 f 4 J c + 2 f 3 J c + 3 f 2 J c ) h h 2 σ e G
    and
    T 6 = R 01 + ( 1 o e o ) f 1 J c ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h M 1 J e 2 d 1 + f 1 + f 1 J c h h 2 σ e G .
    From the above expressions, we observe that T 6 > T 1 , which indicates the need for further adjustment of the constraints to ensure that the solution meets the required conditions.
  • Step 6—Convert the constraints of T 2 T 1 0 , T 3 T 2 0 , T 4 T 3 0 , T 5 T 4 0 , and T 6 T 5 0 into equalities of T 2 T 1 = 0 , T 3 T 2 = 0 , T 4 T 3 = 0 , T 5 T 4 = 0 , and T 6 T 5 = 0 , respectively, and get the corresponding Lagrangian function expressed as
    N ( T 1 , T 2 , T 3 , T 4 , T 5 , T 6 , τ 1 , τ 2 , τ 3 , τ 4 , τ 5 ) = G ( TC ( L ) ) τ 1 ( T 2 T 1 ) τ 2 ( T 3 T 2 ) τ 3 ( T 4 T 3 ) τ 4 ( T 5 T 4 ) τ 5 ( T 6 T 5 ) .
    Hence, we attain
    N T 1 = 1 6 R 01 T 6 2 + ( d 1 + f 1 + f 1 J c ) T 6 2 σ e G T 6 h t 1 h t t 1 f 1 J c ( 1 o e o ) ( σ e G h ) 2 T 6 2 + ( o 2 ( 1 ϑ ) p 2 ) M 1 h J e 2 T 6 2 + τ 1 = 0 ,
    N T 2 = 3 6 R 02 T 5 2 + ( d 2 + f 2 + f 2 J c ) T 5 2 σ e G T 5 h t 1 h t t 1 f 2 J c ( 1 o e o ) ( σ e G h ) 2 T 5 2 + ( o 2 ( 1 ϑ ) p 2 ) M 2 h J e 2 T 5 2 τ 1 + τ 2 = 0 ,
    N T 3 = 2 6 R 03 T 4 2 + ( d 3 + f 3 + f 3 J c ) T 4 2 σ e G T 4 h t 1 h t t 1 f 3 J c ( 1 o e o ) ( σ e G h ) 2 T 4 2 + ( o 2 ( 1 ϑ ) p 2 ) M 3 h J e 2 T 4 2 τ 2 = 0 ,
    N T 4 = 2 6 R 04 T 3 2 + ( d 4 + f 4 + f 4 J c ) T 3 2 σ e G T 3 h t 1 h t t 1 f 4 J c ( 1 o e o ) ( σ e G h ) 2 T 3 2 + ( o 2 ( 1 ϑ ) p 2 ) M 4 h J e 2 T 3 2 τ 3 = 0 ,
    N T 5 = 3 6 R 05 T 2 2 + ( d 5 + f 5 + f 5 J c ) T 2 2 σ e G T 2 h t 1 h t t 1 f 5 J c ( 1 o e o ) ( σ e G h ) 2 T 2 2 + ( o 2 ( 1 ϑ ) p 2 ) M 5 h J e 2 T 2 2 τ 4 = 0 ,
    N T 6 = 1 6 R 06 T 1 2 + ( d 6 + f 6 + f 6 J c ) T 1 2 σ e G T 1 h t 1 h t t 1 f 6 J c ( 1 o e o ) ( σ e G h ) 2 T 1 2 + ( o 2 ( 1 ϑ ) p 2 ) M 6 h J e 2 T 1 2 τ 5 = 0 ,
    and
    N τ 1 = ( T 2 T 1 ) , N τ 2 = ( T 3 T 2 ) , N τ 3 = ( T 4 T 3 ) , N τ 4 = ( T 5 T 4 ) , N τ 5 = ( T 6 T 5 ) ,
    obtaining T 1 = T 2 = T 3 = T 4 = T 5 = T 6 , where
    T 6 = 3 ( R 06 + 3 R 05 + 2 R 04 + 2 R 03 + 3 R 02 + R 01 ) + ( 1 o e o ) J c ( f 6 + 3 f 5 + 2 f 4 + 2 f 3 + 3 f 2 + f 1 ) ( σ e G h ) 2 ( o 2 p 2 ( 1 ϑ ) ) h J e ( M 6 + 3 M 5 + 2 M 4 + 2 M 3 + 3 M 2 + M 1 ) 2 d 6 + 3 d 5 + 2 d 4 + 2 d 3 + 3 d 2 + d 1 + ( f 6 + 3 f 5 + 2 f 4 + 2 f 3 + 3 f 2 + f 1 ) + J c ( f 6 + 3 f 5 + 2 f 4 + 2 f 3 + 3 f 2 + f 1 ) h h 2 σ e G .
    Thus, the solution of T * = ( T 1 , T 2 , T 3 , T 4 , T 5 , T 6 ) satisfies all the inequality constraints for the respective fuzzy number cases. By applying the nonlinear Lagrangian method, we calculate the TC for the model stated in (5). As fuzzy parameters are incorporated, the precision of the optimal solution improves. This calculation is systematically adapted for different fuzzy number types, ensuring that the solution respects the distinct subperiod divisions.

4. Results

In this section, we present the results of our study, demonstrating how advanced ML techniques were integrated with our novel inventory modeling strategy to evaluate various inventory management scenarios.

4.1. Machine Learning Methodology for Inventory Analysis

ML techniques offer powerful tools for analyzing and optimizing inventory. Weka, a comprehensive data mining platform, offers a wide range of algorithms that can be applied to practical inventory-related challenges. It supports data classification, clustering, preprocessing, regression, plotting, association rules, and other key functionalities.
In our analysis, we used a CSV file containing 12,291 rows with 18 parameters to calculate the values of TC and EOQ for both crisp and fuzzy inventory models. The TC was categorized as ‘profit’ and ‘non-profit’ based on the cycle length, where shorter cycle lengths increased profit and longer cycle lengths decreased profit.
To classify the dataset, LR was employed, which is a robust technique for classifying observations and identifying the most influential variables. It was chosen for its suitability in handling the probabilistic nature of our dataset, which encompasses various scenarios within the retailer supply chain. Recognized for its simplicity, efficiency, and effectiveness in managing large datasets with high variability and uncertainty, LR was ideal for our initial exploration.
While other classifiers such as support vector machines (SVMs), k-nearest neighbors (KNN), and random forest (RF) offer robust classification capabilities, their computational complexity depends on the data and tuning parameters. For this study, LR was chosen for its balance between predictive performance and computational efficiency. Its probabilistic and statistical outputs also provide straightforward interpretation, which is beneficial for decision makers.
Future studies could investigate the application of SVMs, KNN, RF, and other advanced techniques to our model, potentially offering deeper insights and improved predictive accuracy.
The methodological process adopted in our study is outlined in Figure 3 and includes the following steps:
  • Step 1—Create a comprehensive dataset reflecting various scenarios within the retail supply chain, including demand data, production costs, and other parameters.
  • Step 2—Fuzzify parameters, transforming deterministic values into fuzzy numbers to better represent uncertainties and variabilities in the supply chain.
  • Step 3—Convert he dataset into attribute-relation file format (ARFF) format for compatibility with Weka.
  • Step 4—Classify the dataset using the LR to categorize supply chain scenarios into ‘profitable’ and ‘non-profitable’.
  • Step 5—Defuzzify the fuzzy results to crisp values for clearer interpretation.
  • Step 6—Analyze the classification and defuzzification outcomes to evaluate model accuracy and applicability in real-world retail supply chain management.
Stratified cross-validation was employed to enhance the reliability of our findings, ensuring that each fold of the dataset accurately represented the overall distribution.

4.2. Classification Results for Trapezoidal Fuzzy Numbers Using Weka

Table 5 presents the results of classification using Weka and LR for TFNs. Table 6 reports the detailed accuracy by class, and Table 7 shows the confusion matrix.
From Table 5, note that the model correctly classified 11,924 instances (99.9748% of accuracy), and incorrectly classified 3 instances (0.0252% of error). The Kappa statistic of 0.9988 indicates almost perfect agreement between the predicted and observed classifications. The mean absolute error (MAE) is 0.0004, and the root mean squared error (RMSE) is 0.0125, indicating high precision and low error rates. Relative metrics such as the relative absolute error (0.2043%) and root relative squared error (3.9112%) further demonstrate the model’s accuracy.
Table 5. Results from LR for TFNs.
Table 5. Results from LR for TFNs.
MetricValuePercentage
Correctly classified instances11,92499.9748%
Incorrectly classified instances30.0252%
Kappa statistic0.9988
Mean absolute error0.0004
Root mean squared error0.0125
Relative absolute error0.2043%
Root relative squared error3.9112%
Total number of instances11,927
Table 6 provides a detailed breakdown of the accuracy by class, showing that the TP rate is 1.000 for both ‘non-profit’ and ‘profit’ classes, which means that the model correctly classified every instance in each class. Similarly, the FP rate of 0.000 indicates that there were no misclassifications between the classes, that is, none of the ‘non-profit’ instances were mistakenly classified as ‘profit’ and vice versa. From Table 6, note that precision, recall, and F-measure scores are all exceptionally high (1.000 for ‘profit’ and 0.999 for ‘non-profit’), indicating that the model not only accurately classified the instances but that it also did so with minimal variance. The F-measure, a harmonic mean of precision and recall, confirms the model’s robustness in handling both classes without bias. Also from Table 6, observe that the Matthews correlation coefficient (MCC) of 0.999 further supports this, showing near-perfect correlation between predicted and observed classifications. The MCC is particularly helpful in situations with imbalanced datasets, as it takes into account TP, FP, and FN values. Here, it demonstrates the model’s ability to correctly classify instances in both classes equally well. The receiver operating characteristic (ROC) area is 1.000, indicating perfect sensitivity and specificity, meaning the model is able to distinguish between the ‘profit’ and ‘non-profit’ classes without error, even as classification thresholds vary. Similarly, the precision–recall curve (PRC) area is 1, showing that the model maintains high precision and recall, which is particularly helpful when there is class imbalance. These metrics underscore the model’s exceptional ability to balance TP and FP rates across different classification thresholds, confirming its robustness in a variety of scenarios.
Table 6. Detailed accuracy by class.
Table 6. Detailed accuracy by class.
ClassTP RateFP RatePrecisionRecallF-MeasureMCCROC AreaPRC Area
Non-profit1.0000.0000.9981.0000.9990.9991.0001.000
Profit1.0000.0001.0001.0001.0000.9991.0001.000
Weighted average1.0000.0001.0001.0001.0000.9991.0001.000
The confusion matrix presented in Table 7 further illustrates the model’s performance. Out of 1378 instances classified as ‘non-profit’, all were correctly classified, with no misclassifications. Similarly, out of 10,549 instances classified as ‘profit’, 10,546 were correctly classified, with only 3 instances misclassified as ‘non-profit’. This strong performance indicates the LR model’s effectiveness in distinguishing between ‘profit’ and ‘non-profit’.
Table 7. Confusion matrix.
Table 7. Confusion matrix.
Classified asNon-Profit (a)Profit (b)
Non-Profit (a)13780
Profit (b)310,546
By analyzing the results reported in Table 5, Table 6 and Table 7, we can conclude that the LR model with TFNs performs exceptionally well in distinguishing between ‘profit’ and ‘non-profit’ classes. The high accuracy, low error rates, and strong performance metrics across both classes highlight the model’s effectiveness for this classification task.

4.3. Classification Results for Pentagonal Fuzzy Numbers Using Weka

Table 8 presents the results of classification using Weka and LR for PFNs. Table 9 reports the detailed accuracy by class, and Table 10 shows the confusion matrix.
Table 8 reports the model correctly classified 11,759 instances, corresponding to an accuracy of 98.5914%, while incorrectly classifying 168 instances, leading to an error rate of 1.4086%. The Kappa statistic of 0.9294 indicates strong agreement between the predicted and observed classifications, although it is less than the Kappa observed for TFNs. This may suggest that the increased complexity introduced by PFNs impacts the model’s ability to classify with the same level of precision as with TFNs.
Also from Table 8, note that the MAE of 0.0359 and the RMSE of 0.1202 remain acceptable, but the relative absolute error (17.5687%) and root relative squared error (37.5965%) are notably greater than for TFNs, indicating high variability and reduced precision in the model’s predictions when dealing with PFNs.
Table 8. Results from LR for PFNs.
Table 8. Results from LR for PFNs.
MetricValuePercentage
Correctly classified instances11,75998.5914%
Incorrectly classified instances1681.4086%
Kappa statistic0.9294
Mean absolute error0.0359
Root mean squared error0.1202
Relative absolute error17.5687%
Root relative squared error37.5965%
Total number of instances11,927
Table 9 details the accuracy by class, highlighting TP rates of 0.911 for the ‘non-profit’ class and 0.996 for the ‘profit’ class. The lower TP rate for the ‘non-profit’ class suggests that the model struggles more to correctly classify instances in this class, which is further evidenced by the FP rate of 0.089 for ‘profit’. Precision, recall, and F-measure remain high for both classes, reflecting a generally robust performance, although improvements could be made for the ‘non-profit’ class.
Table 9. Detailed accuracy by class.
Table 9. Detailed accuracy by class.
ClassTP RateFP RatePrecisionRecallF-MeasureMCCROC AreaPRC Area
Non-profit0.9110.0040.9650.9110.9370.9300.9870.962
Profit0.9960.0890.9890.9960.9920.9300.9870.997
Weighted average0.9860.0790.9860.9860.9860.9300.9870.993
The confusion matrix presented in Table 10 further illustrates the classification performance. Out of 1378 instances classified as ‘non-profit’, 1256 were correctly classified, while 122 were misclassified as ‘profit’. In contrast, out of 10,549 instances classified as ‘profit’, 10,503 were correctly classified, with 46 misclassifications as ‘non-profit’. This difference in misclassification rates between the two classes should be addressed in future research, as the misclassification of ‘non-profit’ instances may have practical implications for inventory management decisions.
Table 10. Confusion matrix.
Table 10. Confusion matrix.
Classified asNon-Profit (a)Profit (b)
Non-Profit (a)1256122
Profit (b)4610,503
In summary, from Table 8, Table 9 and Table 10, the performance metrics suggest that while the LR model is effective for PFNs, it does face challenges with the ‘non-profit’ class, which may warrant further refinement of the model or exploration of alternative ML techniques to enhance classification accuracy for more complex fuzzy numbers. By analyzing these results, we can conclude that the LR model with PFNs performs adequately in distinguishing between ‘profit’ and ‘non-profit’ classes. While the model demonstrates high accuracy and strong performance metrics for the ‘profit’ class, the lower TP rate and higher misclassification rate for the ‘non-profit’ class suggest that there is room for improvement in handling more complex scenarios. Overall, the LR model remains effective for this classification task, but further refinement may enhance its performance in future studies.

4.4. Classification Results for Hexagonal Fuzzy Numbers Using Weka

Table 11 presents the results of classification using Weka and LR for HFNs. Table 12 reports the detailed accuracy by class, and Table 13 shows the confusion matrix.
From Table 11, observe that the model correctly classified 11,608 instances, which corresponds to 97.3254% accuracy, and incorrectly classified 319 instances, corresponding to 2.6746% error. The Kappa statistic of 0.8739 indicates substantial agreement between the predicted and observed classifications. The MAE is 0.0946, and the RMSE is 0.1817, indicating good precision and acceptable error rates. Relative metrics such as the relative absolute error (46.2914%) and root relative squared error (56.8264%) further demonstrate the model’s accuracy.
Table 11. Results from LR for HFNs.
Table 11. Results from LR for HFNs.
MetricValuePercentage
Correctly classified Instances11,60897.3254%
Incorrectly classified Instances3192.6746%
Kappa statistic0.8739
Mean absolute error0.0946
Root mean squared error0.1817
Relative absolute error46.2914%
Root relative squared error56.8264%
Total number of instances11,927
Table 12 details the accuracy by class, showing TP rates of 0.928 for the ‘non-profit’ class and 0.979 for the ‘profit’ class, with corresponding FP rates of 0.021 and 0.072, respectively. Precision, recall, and F-measure are also high, demonstrating the model’s robust performance across different classes. The weighted averages reflect the overall performance metrics, which are strong and consistent.
Table 12. Detailed accuracy by class.
Table 12. Detailed accuracy by class.
ClassTP RateFP RatePrecisionRecallF-MeasureMCCROC AreaPRC Area
Non-profit0.9280.0210.8530.9280.8890.8750.9780.825
Profit0.9790.0720.9910.9790.9850.8750.9780.997
Weighted average0.9730.0660.9750.9730.9740.8750.9780.977
The confusion matrix presented in Table 13 further illustrates the model’s performance, showing that out of 1378 instances classified as ‘non-profit’, 1279 were correctly classified and 99 were misclassified as ‘profit’. Similarly, out of 10,549 instances classified as ‘profit’, 10,329 were correctly classified, with 220 instances misclassified as ‘non-profit’.
Table 13. Confusion matrix.
Table 13. Confusion matrix.
Classified asNon-Profit (a)Profit (b)
Non-Profit (a)127999
Profit (b)22010,329
In summary, from Table 11, Table 12 and Table 13, we can conclude that the LR model with HFNs performs well in distinguishing between ‘profit’ and ‘non-profit’ classes. However, the slightly lower accuracy, higher misclassification rates, and decreased performance metrics for the ‘non-profit’ class, as reflected by the confusion matrix and class-specific metrics, indicate that the model faces limitations in correctly classifying certain instances. Despite these limitations, the model remains effective overall, but further refinements could improve its ability to handle the variability inherent in the ‘non-profit’ class.

4.5. Results of Cross-Validation Techniques

Next, we present the results of the classification task using three types of fuzzy numbers, namely TFNs, PFNs, and HFNs. For each case, cross-validation techniques were applied, and the performance of the LR classifier was evaluated. Figure 4 shows the box plots of the resupply order cost for the ‘profit’ and ‘non-profit’ categories, comparing the three fuzzy number types (TFNs, PFNs, and HFNs). The plot indicates that resupply order costs are much higher for ‘profit’ instances across all fuzzy number types. In particular, PFNs exhibit the highest median resupply order cost, at 2061, compared to 689 for ‘non-profit’ instances. Moreover, TFNs display more variability within the ‘profit’ category, with an interquartile range (IQR) of 1006, suggesting greater cost dispersion.
Figure 5 illustrates the box plots of manufacturing costs by ‘profit’ and ‘non-profit’ categories. Production costs are notably higher for ‘profit’ instances, with PFNs showing the highest median manufacturing cost of 517, while TFNs and HFNs have comparable medians around 507 and 499, respectively, in the ‘profit’ category. For ‘non-profit’ instances, the range of costs is lower and more consistent across all fuzzy number types, with a minimum value of 50 for each type.
Figure 6 shows the production cost by ‘profit’ and ‘non-profit’ category. The results reveal that ‘profit’ instances have substantially higher production costs across all fuzzy number types. PFNs show the highest median production cost of 411, compared to 63 for ‘non-profit’ instances. Additionally, the variability in production costs is more pronounced in ‘profit’ instances, with TFNs showing an IQR of 273, while PFNs and HFNs have an IQR of 272, indicating wider cost dispersion in profitable scenarios.
Overall, Figure 4, Figure 5 and Figure 6 demonstrate clear differences in resupply order, manufacturing, and production costs between ‘profit’ and ‘non-profit’ categories. The comparison between fuzzy number types (TFNs, PFNs, and HFNs) highlights how each method captures uncertainty and affects cost variability. PFNs generally exhibit the highest costs across all categories, while TFNs show the most variability in profit-making scenarios.
The second part of this analysis presents the results of a classification task using three types of cross-validation, namely TFNs, PFNs, and HFNs, along with their respective performance metrics. Trapezoidal cross-validation yields the highest accuracy and the lowest error rates compared to pentagonal and hexagonal cross-validations. Specifically, trapezoidal cross-validation achieved an accuracy of 99.97%, with an MAE of 0.0004 and an RMSE of 0.0125. These metrics demonstrate that the model predictions are highly accurate and precise. Moreover, the detailed accuracy by class shows perfect performance in classifying both ‘non-profit’ and ‘profit’ instances, with high precision, recall, and F-measure values for both classes. Pentagonal and hexagonal cross-validations exhibit slightly lower accuracies and higher error rates compared to trapezoidal cross-validation. Pentagonal cross-validation achieved an accuracy of 98.59%, with an MAE of 0.0359 and an RMSE of 0.1202, while hexagonal cross-validation yielded an accuracy of 97.33%, with an MAE of 0.0946 and an RMSE of 0.1817. Although these performance metrics indicate good results, they are not as strong as those of trapezoidal cross-validation. The superior performance of trapezoidal cross-validation can be attributed to its ability to delineate decision boundaries between classes more precisely, possibly due to the specific characteristics of TFNs, which may better capture the underlying patterns in the data than PFNs and HFNs. Consequently, trapezoidal cross-validation outperforms pentagonal and hexagonal cross-validations in terms of accuracy and error rates, making it the preferred choice for this classification task. The near-perfect classification results highlight its effectiveness in distinguishing between ‘non-profit’ and ‘profit’ instances, making it an optimal choice for similar tasks.
In summary, while the LR model performed well for all fuzzy number types, the TFN method achieved the highest performance, likely due to its ability to represent uncertainties in a more controlled and precise manner. The comparison between TFNs, PFNs, and HFNs underscores how different fuzzification approaches affect model performance, with the trapezoidal approach proving the most advantageous in this classification task.

5. Discussion and Conclusions

This study examined a manufacturing inventory model for deteriorating products, focusing on price-dependent demand and production rates associated with reliability under partial trade credits. The analysis highlighted the relevance of product reliability and trade credit policies in optimizing total production costs in competitive industrial environments.
The results of numerical simulations revealed that when the credit period extended to customers surpasses both the business cycle and the supplier’s credit term, the system’s total cost reaches its minimum. This is particularly relevant for industries dealing with perishable or short-lived products, such as pharmaceuticals, food products, and high-tech electronics, where efficient inventory management is critical for maintaining product quality and minimizing costs.
The proposed model assumes constant values for the deterioration rate and the production reliability factor. Although this assumption is common in inventory models, it may not fully capture the fluctuations observed in dynamic industrial settings. However, it provides a practical solution for scenarios where these rate and factor exhibit moderate variability. Additionally, the model focused on a single stock-keeping unit, which is appropriate for industries where high turnover or deterioration-sensitive products are central. Extending this model to accommodate multiple stock-keeping units would introduce substantial complexity and was intentionally excluded to maintain the clarity of the current analysis.
In terms of trade credit policies, a simplified approach was used, assuming a uniform credit period throughout the production cycle. While this reflects common industrial practices, future studies could explore more complex credit terms to account for variability in specific contexts. The assumptions and simplifications of the model make it well-suited for a broad range of industrial scenarios, particularly those prioritizing efficiency, predictability, and cost control in systems with deteriorating products and price-sensitive demand. These scenarios were rigorously addressed, and the proposed extensions aim to broaden the model’s applicability in more complex and dynamic environments.
The model is particularly relevant for industries dealing with perishable or deteriorating goods, such as pharmaceuticals and food production, where managing spoilage and maintaining product quality are critical. Minimizing production costs while balancing demand and ensuring reliability is essential in these sectors. The model is also applicable to industries that utilize partial trade credit policies, such as retail and consumer electronics, where fluctuating demand and cost control present important challenges. The inclusion of fuzzy logic to manage uncertainties in demand, reliability, and credit policies enhances the model’s practical applicability in such scenarios.
Future research could extend the model to handle multiple stock-keeping units, necessitating adjustments to the cost function to account for interactions between products. Managing multiple products introduces added complexity, as each stock-keeping unit may have distinct deterioration rates, demand patterns, and reliability factors. Optimizing both individual and interdependent costs, as well as shared resources, would require the development of sophisticated algorithms. This extension would enhance the model’s relevance for industries with diverse product lines, such as retail chains and manufacturing sectors.
Additionally, exploring more advanced fuzzy numbers, such as the spherical case [52,53], could better model uncertainties in complex scenarios. While trapezoidal and pentagonal fuzzy numbers balance simplicity and computational efficiency in the current model, more intricate uncertainty patterns might benefit from advanced techniques. Incorporating varying deterioration rates or fluctuating production reliability would further enhance the model’s realism, making it more applicable to industries with varying environmental conditions or production capabilities. Moreover, integrating advanced machine learning techniques, such as deep neural networks or ensemble models [54], could improve the model’s predictive accuracy and its ability to handle highly uncertain inventory scenarios. In some cases, quantile regression could serve as an alternative to median-based methods to better capture the distribution of key variables [55].
Exploring reliability models beyond the inventory domain, such as epidemic models or hybrid systems, could also broaden the model’s applicability, providing deeper insights into the role of reliability in diverse contexts.
In conclusion, this study presented a novel approach to managing inventory systems with deteriorating goods under partial trade credit policies. By incorporating fuzzy numbers to address uncertainties in production costs, reliability, and demand, the model demonstrated high accuracy in decision making under uncertainty. The primary contributions of this research lie in its integration of fuzzy logic for uncertainty management and its applicability to real-world scenarios, particularly in industries dealing with perishable goods and fluctuating demand.

Author Contributions

Conceptualization: P.B.D., K.K., V.L., C.C. and S.R.; data curation: P.B.D., K.K. and C.C.; formal analysis: P.B.D., K.K., V.L., C.C. and S.R.; investigation: P.B.D., K.K., V.L., C.C. and S.R.; methodology: P.B.D., K.K., V.L., C.C. and S.R.; writing—original draft: P.B.D., K.K. and S.R.; writing—review and editing: V.L. and C.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partially supported by the Vice-rectorate for Research, Creation, and Innovation—VINCI—of the Pontificia Universidad Católica de Valparaíso—PUCV—, Chile, under grants VINCI 039.470/2024—regular research—, VINCI 039.493/2024—interdisciplinary associative research—, VINCI 039.309/2024—PUCV centenary—, and FONDECYT 1200525 (V.L.) of the National Agency for Research and Development—ANID—of the Chilean government under the Ministry of Science, Technology, Knowledge, and Innovatio; and by Portuguese funds through the CMAT—Research Centre of Mathematics of University of Minho, Portugal, within projects UIDB/00013/2020—https://doi.org/10.54499/UIDB/00013/2020—and UIDP/00013/2020—https://doi.org/10.54499/UIDP/00013/2020—(C.C.).

Data Availability Statement

The data and codes used in this study are available in the present article and can be requested from the authors.

Acknowledgments

The authors would like to thank the editors and three anonymous reviewers for their valuable comments and suggestions, which helped us to improve the quality of this article.

Conflicts of Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this article.

References

  1. Lee, H.L.; Rosenblatt, M.J. Simultaneous determination of production cycle and inspection schedules in a production system. Manag. Sci. 1987, 33, 125–1136. [Google Scholar] [CrossRef]
  2. Urban, T.L. Deterministic inventory models incorporating marketing decisions. Comput. Ind. Eng. 1992, 22, 85–93. [Google Scholar] [CrossRef]
  3. Pal, P.; Bhunia, A.K.; Goyal, S.K. On optimal partially integrated production and marketing policy with variable demand under flexibility and reliability considerations via genetic algorithm. Appl. Math. Comput. 2007, 188, 525–537. [Google Scholar] [CrossRef]
  4. Panda, G.C.; Khan, M.A.A.; Shaikh, A.A. A credit policy approach in a two-warehouse inventory model for deteriorating items with price-and stock-dependent demand under partial backlogging. J. Ind. Eng. Int. 2019, 15, 147–170. [Google Scholar] [CrossRef]
  5. Guchhait, P.; Maiti, M.K.; Maiti, M. Production-inventory models for a damageable item with variable demands and inventory costs in an imperfect production process. Int. J. Prod. Econ. 2013, 144, 180–188. [Google Scholar] [CrossRef]
  6. Singh, S.; Gupta, V.; Gupta, P. Three stage supply chain model with two warehouse, imperfect production, variable demand rate and inflation. Int. J. Ind. Eng. Comput. 2013, 4, 81–92. [Google Scholar] [CrossRef]
  7. Sarkar, B.; Mandal, P.; Sarkar, S. An EMQ model with price and time dependent demand under the effect of reliability and inflation. Appl. Math. Comput. 2014, 231, 414–421. [Google Scholar] [CrossRef]
  8. Sarkar, B.; Gupta, H.; Chaudhuri, K.; Goyal, S.K. An integrated inventory model with variable lead time, defective units and delay in payments, inflation. Appl. Math. Comput. 2014, 237, 650–658. [Google Scholar]
  9. Singh, S.R.; Sharma, S. A production reliable model for deteriorating products with random demand and inflation. Int. J. Syst. Sci. Oper. Logist. 2017, 4, 330–338. [Google Scholar] [CrossRef]
  10. Rahman, M.S.; Manna, A.K.; Shaikh, A.A.; Bhunia, A.K. An application of interval differential equation on a production inventory model with interval-valued demand via center-radius optimization technique and particle swarm optimization. Int. J. Intellect. Syst. 2020, 35, 1280–1326. [Google Scholar] [CrossRef]
  11. Das, S.C.; Zidan, A.M.; Manna, A.K.; Shaikh, A.A.; Bhunia, A.K. An application of preservation technology in inventory control system with price dependent demand and partial backlogging. Alex. Eng. J. 2020, 59, 1359–1369. [Google Scholar]
  12. Shaikh, A.S.; Shaikh, I.N.; Nisar, K.S. A mathematical model of COVID-19 using fractional derivative: Outbreak in india with dynamics of transmission and control. Adv. Differ. Equ. 2020, 2020, 373. [Google Scholar] [CrossRef]
  13. Kumar, S.; Kumar, R.; Singh, J.; Nisar, K.S.; Kumar, D. An efficient numerical scheme for fractional model of HIV-1 infection of CD4+ T-cells with the effect of antiviral drug therapy. Alex. Eng. J. 2020, 59, 2053–2064. [Google Scholar] [CrossRef]
  14. Khan, M.A.A.; Shaikh, A.A.; Panda, G.C.; Konstantaras, I.; Taleizadeh, A.A. Inventory system with expiration date: Pricing and replenishment decisions. Comput. Ind. Eng. 2019, 132, 232–247. [Google Scholar] [CrossRef]
  15. Ahmed, N.; Rafiq, M.; Baleanu, D.; Rehman, M.A.U.; Khan, I.; Ali, M.; Nisar, K.S. Structure preserving algorithms for mathematical model of auto-catalytic glycolysis chemical reaction and numerical simulations. Eur. Phys. J. Plus 2020, 135, 522. [Google Scholar] [CrossRef]
  16. Khater, M.M.; Attia, R.A.; Abdel-Aty, A.H.; Alharbi, W.; Lu, D. Abundant analytical and numerical solutions of the fractional microbiological densities model in bacteria cell as a result of diffusion mechanisms. Chaos Solitons Fract. 2020, 136, 109824. [Google Scholar] [CrossRef]
  17. Owyed, S.; Abdou, M.A.; Abdel-Aty, A.H.; Ibraheem, A.A.; Nekhili, R.; Baleanu, D. New optical soliton solutions of space-time fractional nonlinear dynamics of microtubules via three integration schemes. J. Intell. Fuzzy Syst. 2020, 38, 2859–2866. [Google Scholar] [CrossRef]
  18. Park, C.; Khater, M.M.; Abdel-Aty, A.H.; Attia, R.A.; Lu, D. On new computational and numerical solutions of the modified Zakharov-Kuznetsov equation arising in electrical engineering. Alex. Eng. J. 2020, 59, 1099–1105. [Google Scholar] [CrossRef]
  19. Abdel-Aty, A.H.; Khater, M.M.; Attia, R.A.; Abdel-Aty, M.; Eleuch, H. On the new explicit solutions of the fractional nonlinear space-time nuclear model. Fractals 2020, 28, 2040035. [Google Scholar] [CrossRef]
  20. Elgendy, A.E.T.; Abdel-Aty, A.H.; Youssef, A.A.; Khder, M.A.; Lotfy, K.; Owyed, S. Exact solution of Arrhenius equation for non-isothermal kinetics at constant heating rate and n-th order of reaction. J. Math. Chem. 2019, 58, 922–938. [Google Scholar] [CrossRef]
  21. Soliman, A.; Abdou, M.A. An extended expansion scheme for nonlinear evolution equations in fractal order. Numer. Comput. Methods Sci. Eng. 2019, 1, 13–18. [Google Scholar]
  22. Ereu, J.; Gimenez, J.; Perez, L. On solutions of nonlinear integral equations in the space of functions of shiba-bounded variation. Appl. Math. Inf. Sci. 2020, 14, 393–404. [Google Scholar]
  23. Rojas, F.; Leiva, V.; Huerta, M.; Martin-Barreiro, C. Lot-size models with uncertain demand considering its skewness/kurtosis and stochastic programming applied to hospital pharmacy with sensor-related COVID-19 data. Sensors 2021, 21, 5198. [Google Scholar] [CrossRef] [PubMed]
  24. Wanke, P.; Ewbank, H.; Leiva, V.; Rojas, F. Inventory management for new products with triangularly distributed demand and lead-time. Comput. Oper. Res. 2016, 69, 97–108. [Google Scholar] [CrossRef]
  25. Rojas, F.; Wanke, P.; Leiva, V.; Huerta, M.; Martin-Barreiro, C. Modeling inventory cost savings and supply chain success factors: A hybrid robust compromise multi-criteria approach. Mathematics 2022, 10, 2911. [Google Scholar] [CrossRef]
  26. Rangasamy, M.; Chesneau, C.; Martin-Barreiro, C.; Leiva, V. On a novel dynamics of SEIR epidemic models with a potential application to COVID-19. Symmetry 2022, 14, 1436. [Google Scholar] [CrossRef]
  27. Rangasamy, M.; Alessa, N.; Dhandapani, P.B.; Loganathan, K. Dynamics of a novel IVRD pandemic model of a large population over a long time with efficient numerical methods. Symmetry 2022, 14, 1919. [Google Scholar] [CrossRef]
  28. Alejo-Reyes, A.; Mendoza, A.; Cuevas, E.; Alcaraz-Rivera, M. A mathematical model for an inventory management and order quantity allocation problem with nonlinear quantity discounts and nonlinear price-dependent demand. Axioms 2023, 12, 547. [Google Scholar] [CrossRef]
  29. Ventura, J.A.; Lu, Q. Optimizing supplier selection and order lot-sizing decisions in a two-stage supply chain. Axioms 2023, 12, 615. [Google Scholar] [CrossRef]
  30. Naveed, M.; Rafiq, M.; Raza, A.; Ahmed, N.; Khan, I.; Nisar, K.S.; Soori, A.H. Mathematical analysis of novel coronavirus (2019-nCov) delay pandemic model. Comput. Mater. Contin. 2020, 64, 1401–1414. [Google Scholar] [CrossRef]
  31. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  32. Zimmermann, H.J. Description and optimization of fuzzy systems. Int. J. Gen. Syst. 1976, 2, 209–215. [Google Scholar] [CrossRef]
  33. Dhandapani, P.B.; Baleanu, D.; Thippan, J.; Sivakumar, V. Fuzzy type RK4 solutions to fuzzy hybrid retarded delay differential equations. Front. Phys. 2019, 7, 168. [Google Scholar] [CrossRef]
  34. Dhandapani, P.B.; Thippan, J.; Martin-Barreiro, C.; Leiva, V.; Chesneau, C. Numerical solutions of a differential system considering a pure hybrid fuzzy neutral delay theory. Electronics 2022, 11, 1478. [Google Scholar] [CrossRef]
  35. Chen, S.H.; Wang, S.T.; Chang, S.M. Some properties of graded mean integration representation of LR type fuzzy numbers. Tamsui Oxf. J. Math. Sci. 2006, 22, 185–208. [Google Scholar]
  36. Deb, M.; De, P.K. Optimal solution of a fully fuzzy linear fractional programming problem by using graded mean integration representation method. Appl. Appl. Math. Int. J. 2015, 10, 296–308. [Google Scholar]
  37. Kusumadewi, S.; Wahyuningsih, H.; Sofyan, S. Graded mean integration representation and intuitionistic fuzzy weighted arithmetic mean for similarity measures in case-based reasoning. Int. J. Comput. Intell. Syst. 2024, 26, 1802–1826. [Google Scholar] [CrossRef]
  38. Chiao, K.P. Ranking interval type 2 fuzzy sets using parametric graded mean integration representation. In Proceedings of the 2016 International Conference on Machine Learning and Cybernetics, Jeju, Republic of Korea, 10–13 July 2016; Volume 2, pp. 606–611. [Google Scholar]
  39. Nagamani, M.; Balaji, G. A fuzzy inventory model with adequate shortage using graded mean integral value method. J. Algebr. Stat. 2022, 13, 2692–2697. [Google Scholar]
  40. Kaufmann, M.; Gupta, M. Introduction to Fuzzy Arithmetic Theory and Applications; Van Nostrand, Reinhold: New York, NY, USA, 1985. [Google Scholar]
  41. Delgado, E.; Cabezas, X.; Martin-Barreiro, C.; Leiva, V.; Rojas, F. An equity-based optimization model to solve the location problem for healthcare centers applied to hospital beds and COVID-19 vaccination. Mathematics 2022, 10, 1825. [Google Scholar] [CrossRef]
  42. Palanivelu, K.U.B.; Leiva, V.; Dhandapani, P.B.; Castro, C. On fuzzy and crisp solutions of a novel fractional pandemic model. Fractal Fract. 2023, 7, 528. [Google Scholar] [CrossRef]
  43. Huerta, M.; Leiva, V.; Rojas, F.; Wanke, P.; Cabezas, X. A methodology for consolidation effects of inventory management with serially dependent random demand. Processes 2023, 11, 2008. [Google Scholar] [CrossRef]
  44. Rojas, F.; Leiva, V.; Wanke, P.; Lillo, C.; Pascual, J. Modeling lot-size with time-dependent demand based on stochastic programming and case study of drug supply in Chile. PLoS ONE 2019, 14, e0212768. [Google Scholar] [CrossRef]
  45. Gojković, R.; Đurić, G.; Tadić, D.; Nestić, S.; Aleksić, A. Evaluation and selection of the quality methods for manufacturing process reliability improvement—Intuitionistic fuzzy sets and genetic algorithm approach. Mathematics 2021, 9, 1531. [Google Scholar] [CrossRef]
  46. Chin, K.S.; Chan, A.; Yang, J.B. Development of a fuzzy FMEA based product design system. Int. J. Adv. Manuf. Technol. 2008, 36, 633–649. [Google Scholar] [CrossRef]
  47. Mohandes, S.R.; Durdyev, S.; Sadeghi, H.; Mahdiyar, A.; Hosseini, M.R.; Banihashemi, S.; Martek, I. Towards enhancement in reliability and safety of construction projects: Developing a hybrid multi-dimensional fuzzy-based approach. Eng. Constr. Archit. Manag. 2023, 30, 2255–2279. [Google Scholar] [CrossRef]
  48. Kalaiarasi, K.; Soundaria, R.; Nasreen, K.; Aydi, H.; Alsamir, H. Optimization of the average monthly cost of an EOQ inventory model for deteriorating items in machine learning using Python. Therm. Sci. 2021, 25, S347–S358. [Google Scholar] [CrossRef]
  49. Das, S.; Khan, M.A.A.; Mahmoud, E.E.; Abdel-Aty, A.H.; Abualnaja, K.M.; Shaikh, A.A. A production inventory model with partial trade credit policy and reliability. Alex. Eng. J. 2021, 60, 1325–1338. [Google Scholar] [CrossRef]
  50. Chen, S.H.; Hsieh, C.H. Graded mean integration representation of generalized fuzzy number. J. Chin. Fuzzy Syst. 1999, 5, 1–7. [Google Scholar]
  51. Hamdy, A.T. Operations Research Introduction; Pearson Publisher: London, UK, 2008. [Google Scholar]
  52. Sarfraz, M. A few Maclaurin symmetric mean aggregation operators for spherical fuzzy numbers based on Schweizer-Sklar operations and their use in artificial intelligence. J. Intell. Syst. Control 2024, 3, 1–20. [Google Scholar] [CrossRef]
  53. Nguyen, P.H. Fully completed spherical fuzzy approach-based Z numbers (PHI Model) for enhanced group expert consensus. Comput. Mater. Contin. 2024, 80, 1655–1675. [Google Scholar] [CrossRef]
  54. Palacios, C.A.; Reyes-Suarez, J.A.; Bearzotti, L.A.; Leiva, V.; Marchant, C. Knowledge discovery for higher education student retention based on data mining: Machine learning algorithms and case study in Chile. Entropy 2021, 23, 485. [Google Scholar] [CrossRef] [PubMed]
  55. Sanchez, L.; Leiva, V.; Galea, M.; Saulo, H. Birnbaum-Saunders quantile regression and its diagnostics with application to economic data. Appl. Stoch. Model. Bus. Ind. 2021, 37, 53–73. [Google Scholar] [CrossRef]
Figure 1. Flow chart of the Lagrangian method for solving EOQ models with fuzzy variables.
Figure 1. Flow chart of the Lagrangian method for solving EOQ models with fuzzy variables.
Axioms 13 00743 g001
Figure 2. Flow chart for the Lagrangian method to solve EOQ models.
Figure 2. Flow chart for the Lagrangian method to solve EOQ models.
Axioms 13 00743 g002
Figure 3. Flow chart of the proposed process.
Figure 3. Flow chart of the proposed process.
Axioms 13 00743 g003
Figure 4. Resupply order cost by profit/non-profit category for the type of indicated fuzzy numbers.
Figure 4. Resupply order cost by profit/non-profit category for the type of indicated fuzzy numbers.
Axioms 13 00743 g004
Figure 5. Manufacturing cost by profit/non-profit categories for the type of indicated fuzzy numbers.
Figure 5. Manufacturing cost by profit/non-profit categories for the type of indicated fuzzy numbers.
Axioms 13 00743 g005
Figure 6. Production cost by profit/non-profit category for the type of indicated fuzzy numbers.
Figure 6. Production cost by profit/non-profit category for the type of indicated fuzzy numbers.
Axioms 13 00743 g006
Table 1. Notations used in the inventory model.
Table 1. Notations used in the inventory model.
SymbolDescriptionUnit
α Portion of the purchase price covered by the buyer, where 0 α 1 proportion
dHolding cost per unit per time$/unit
eRequirement scale componentconstant
fRegular production cost$/unit
GManufacturing rateunits/time
HProduction capacity or target production levelunits
hEfficiency factor affecting production halt timeconstant
J c Interest charged by the producer$/unit year
J e Manufacturer interest earned$/unit
J ( t ) Inventory rate function at time t, where 0 t T units/time
LCycle periodyears
MSale price$/unit
oSupplier trade credit periodyears
Exponentially growing deterioration rateconstant
ϑ Adjustment factor for deterioration or efficiency in credit termsconstant
pRetailer credit term period for customersyears
R 0 Resupply cost per order$/unit
ρ Supply-limiting factorconstant
σ e Reliability rate for production of quality goodspercentage
t 1 Manufacturer halt periodyears
TC ( L ) Total cost of the system as a function of the cycle period L$/year
Table 2. Comparison of proposed the fuzzy inventory model with previous works (part 1).
Table 2. Comparison of proposed the fuzzy inventory model with previous works (part 1).
CriteriaLee and Rosenblatt (1987) [1]Urban (1992) [2]Panda et al. (2019) [4]
Objective and methodologyJoint control of production cycles and maintenance by inspection (deterministic approach)Optimal lot size, price mark-up, and advertising expenditure (separable programming)Two-warehouse inventory model with price- and stock-dependent demand (solved using Lingo software, version 10.0)
Demand type and deteriorationConstant; no deteriorationPrice-dependent deterministic; no deteriorationPrice- and stock-dependent; deterioration considered with partial backlogging
Trade credit policyNot consideredNot consideredPartial trade credit incorporated
Fuzzy logic and reliabilityNo fuzzy logic or reliability consideredNo fuzzy logic or reliability consideredNo fuzzy logic or reliability considered
Optimization techniqueApproximation to cost functionSeparable programmingNonlinear mathematical modeling (Lingo software)
Table 3. Comparison of proposed fuzzy inventory model with previous works (part 2).
Table 3. Comparison of proposed fuzzy inventory model with previous works (part 2).
CriteriaSarkar et al. (2014) [7]Singh and Sharma (2017) [9]Das et al. (2021) [49]
Objective and methodologyEconomic manufacturing quantity with imperfect production and reliability (Euler–Lagrange method)Decaying items with stochastic demand and inflation effects (stochastic programming)Production inventory with partial trade credit and reliability (Lagrangian method)
Demand type and deteriorationTime-dependent demand; deterioration consideredStochastic demand; deterioration consideredNot explicitly specified; reliability integrated into inventory management
Trade credit policyNot explicitly specifiedNot explicitly specifiedPartial trade credit incorporated
Fuzzy logic and reliabilityReliability considered; no fuzzy logicReliability considered; no fuzzy logicReliability and fuzzy logic both considered
Optimization techniqueEuler–Lagrange methodStochastic programmingLagrangian method (fuzzy set theory)
Table 4. Comparison of proposed fuzzy inventory model (part 3).
Table 4. Comparison of proposed fuzzy inventory model (part 3).
CriteriaProposed Model
Objective and methodologyDevelop fuzzy inventory model for deteriorating products, price-dependent demand, and partial trade credit with reliability (fuzzy set theory, GMI, LR, and ML)
Demand type and deteriorationPrice-dependent with fuzzy uncertainty; deterioration adjusted by reliability factor ( ϑ )
Trade credit policyPartial trade credit policy incorporated
Fuzzy logic and reliabilityFuzzy logic and reliability both considered
Optimization techniqueNonlinear mathematical programming, Lagrangian method, and fuzzy logic integration
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Dhandapani, P.B.; Kalaichelvan, K.; Leiva, V.; Castro, C.; Ramalingam, S. A Hybrid Fuzzy Mathematical Programming Approach for Manufacturing Inventory Models with Partial Trade Credit Policy and Reliability. Axioms 2024, 13, 743. https://doi.org/10.3390/axioms13110743

AMA Style

Dhandapani PB, Kalaichelvan K, Leiva V, Castro C, Ramalingam S. A Hybrid Fuzzy Mathematical Programming Approach for Manufacturing Inventory Models with Partial Trade Credit Policy and Reliability. Axioms. 2024; 13(11):743. https://doi.org/10.3390/axioms13110743

Chicago/Turabian Style

Dhandapani, Prasantha Bharathi, Kalaiarasi Kalaichelvan, Víctor Leiva, Cecilia Castro, and Soundaria Ramalingam. 2024. "A Hybrid Fuzzy Mathematical Programming Approach for Manufacturing Inventory Models with Partial Trade Credit Policy and Reliability" Axioms 13, no. 11: 743. https://doi.org/10.3390/axioms13110743

APA Style

Dhandapani, P. B., Kalaichelvan, K., Leiva, V., Castro, C., & Ramalingam, S. (2024). A Hybrid Fuzzy Mathematical Programming Approach for Manufacturing Inventory Models with Partial Trade Credit Policy and Reliability. Axioms, 13(11), 743. https://doi.org/10.3390/axioms13110743

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop