TMTapas Mondal

Tapas Mondal

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Tapas Mondal has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Profit maximization inventory model with uncertain demand and costs: A geometric programming approach

    by Tapas Mondal, Akshay Kumar Ojha, Sabyasachi Pani

    In this paper, we formulate a new profit maximization inventory model in which demand is a power function of selling price, marketing expenditure, and service expenditure, and unit cost is a power function of order quantity. In reality, the exponents of selling price, marketing expenditure, and service expenditure in a demand function and the exponent of order quantity in a unit cost function may not be exact. So, we consider the model in an uncertain-based framework with the assumption that the exponents of selling price, marketing expenditure, and service expenditure in a demand function and the exponent of order quantity in a unit cost function are uncertain. Based on uncertainty theory, we develop a method to find the equivalent crisp model. In addition, we use the geometric programming method to solve the crisp model. Furthermore, we give a suitable numerical example to show how the proposed methodology can be used to solve the model for different uncertainty distributions at different uncertainty levels. In the numerical example, we use five different uncertainty distributions and figure out the selling price, marketing cost, service cost, order quantity, and profit with respect to the uncertainty level for each uncertainty distribution. Finally, we perform a sensitivity analysis for a better understanding of the proposed model.


  • Open Access

    Uncertain random geometric programming problems

    by Tapas Mondal, Akshay Kumar Ojha, Sabyasachi Pani

    In this paper, we introduce a deterministic formulation for the geometric programming problem, wherein the coefficients are represented as independent linear-normal uncertain random variables. To address the challenges posed by this combination of uncertainty and randomness, we introduce the concept of an uncertain random variable and present a novel framework known as the linear-normal uncertain random variable. Our main focus in this work is the development of three distinct transformation techniques: the optimistic value criteria, pessimistic value criteria, and expected value criteria. These approaches allow us to convert a linear-normal uncertain random variable into a more manageable random variable. This transition facilitates the transformation from an uncertain random geometric programming problem to a stochastic geometric programming problem. Furthermore, we provide insights into an equivalent deterministic representation of the transformed geometric programming problem, enhancing the clarity and practicality of the optimization process. To demonstrate the effectiveness of our proposed approach, we present a numerical example.


  • Open Access

    Geometric Programming Problems with Triangular and Trapezoidal Two-fold Uncertainty Distributions

    by Tapas Mondal, Akshay Kumar Ojha, Sabyasachi Pani

    Geometric programming (GP) is a well-known optimization tool for dealing with a wide range of nonlinear optimization and engineering problems. In general, it is assumed that the parameters of a GP problem are deterministic and accurate. However, in the real-world GP problem, the parameters are frequently inaccurate and ambiguous. This paper investigates the GP problem in an uncertain environment, with the coefficients as triangular and trapezoidal two-fold uncertain variables. In this paper, we introduce uncertain measures in a generalized version and focus on more complicated two-fold uncertainties to propose triangular and trapezoidal two-fold uncertain variables within the context of uncertainty theory. We develop three reduction methods to convert triangular and trapezoidal two-fold uncertain variables into single-fold uncertain variables using optimistic, pessimistic, and expected value criteria. Reduction methods are used to convert the GP problem with two-fold uncertainty into the GP problem with single-fold uncertainty. Furthermore, the chance-constrained uncertain-based framework is used to solve the reduced single-fold uncertain GP problem. Finally, a numerical example is provided to demonstrate the effectiveness of the procedures.

  • Open Access

    Solving geometric programming problems with triangular and trapezoidal uncertainty distributions

    by Tapas Mondal, Akshay Kumar Ojha, Sabyasachi Pani

    The geometric programming problem is an important optimization technique that is often used to solve different nonlinear optimization problems and engineering problems. The geometric programming models that are commonly used are generally based on deterministic and accurate parameters. However, it is observed that in real-world geometric programming problems, the parameters are frequently inaccurate and ambiguous. In this paper, we consider chance-constrained geometric programming problems with uncertain coefficients and with geometric programming techniques in the uncertain-based framework. We show that the associated chance-constrained uncertain geometric programming problem can be converted into a crisp geometric programming problem by using triangular and trapezoidal uncertainty distributions for the uncertain variables. The main aim of this paper is to provide the solution procedures for geometric programming problems under triangular and trapezoidal uncertainty distributions. To show how well the procedures and algorithms work, two numerical examples and an application in the inventory model are given.