Sabyasachi Pani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sabyasachi Pani has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Akshay Kumar Ojha
Indian Institute of Technology Bhubaneswar
5 shared publications - Tapas Mondal
Indian Institute of Technology Bhubaneswar
5 shared publications - Bijaya Kumar Sahu
Department of Mathematics, Chandbali College, Chandbali, Bhadrak 756133, Odisha, India
3 shared publications - Ram Narayan Mohapatra
Department of Mathematics, University of Central Florida, Orlando, USA
3 shared publications - Gayatri Pany
University of Central Florida
2 shared publications - Litismita Jena
North Odisha Univ, Anandapur Coll, Anandapur 758021, Odisha, India
2 shared publications
Latest Publications
- 1 October 2025
- Published by Springer Nature
- p. 325-340
Solving Geometric Programming Problems with Laplace Uncertainty Distribution
- 1 October 2025
- Published by Springer Nature
- p. 325-340
Solving Geometric Programming Problems with Laplace Uncertainty Distribution
- 20 February 2024
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 70 (2) , 1325-1338
Solvability of generalized vector bifunction variational inequality problem
- 20 February 2024
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 70 (2) , 1325-1338
Solvability of generalized vector bifunction variational inequality problem
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 20 (5) , 1772-1801
Profit maximization inventory model with uncertain demand and costs: A geometric programming approach
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.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 20 (5) , 1772-1801
Profit maximization inventory model with uncertain demand and costs: A geometric programming approach
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.
- 15 December 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 200 (3) , 978-1016
Geometric Programming Problems with Triangular and Trapezoidal Twofold Uncertainty Distributions
- 15 December 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 200 (3) , 978-1016
Geometric Programming Problems with Triangular and Trapezoidal Twofold Uncertainty Distributions
- Open Access
Uncertain random geometric programming problems
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 AccessUncertain random geometric programming problems
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.
- 22 June 2023
- Published by Springer Nature in OPSEARCH
- Vol. 60 (4) , 1777-1792
An auxiliary problem principle for the solutions of mixed invex equilibrium problems in Banach spaces
- 22 June 2023
- Published by Springer Nature in OPSEARCH
- Vol. 60 (4) , 1777-1792
An auxiliary problem principle for the solutions of mixed invex equilibrium problems in Banach spaces
- Open Access
Geometric Programming Problems with Triangular and Trapezoidal Two-fold Uncertainty Distributions
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 AccessGeometric Programming Problems with Triangular and Trapezoidal Two-fold Uncertainty Distributions
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.
- 15 September 2020
- Published by Springer Nature in Positivity
- Vol. 25 (2) , 769-789
Existence of solutions for extended generalized complementarity problems
- 15 September 2020
- Published by Springer Nature in Positivity
- Vol. 25 (2) , 769-789
Existence of solutions for extended generalized complementarity problems
- 7 January 2020
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 184 (3) , 810-823
Existence Results for Mixed Equilibrium Problems Involving Set-Valued Operators with Applications to Quasi-Hemivariational Inequalities
- 7 January 2020
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 184 (3) , 810-823
Existence Results for Mixed Equilibrium Problems Involving Set-Valued Operators with Applications to Quasi-Hemivariational Inequalities
- 29 June 2017
- Published by Springer Nature in Soft Computing
- Vol. 22 (8) , 2429-2447
An orthogonal parallel symbiotic organism search algorithm embodied with augmented Lagrange multiplier for solving constrained optimization problems
- 29 June 2017
- Published by Springer Nature in Soft Computing
- Vol. 22 (8) , 2429-2447
An orthogonal parallel symbiotic organism search algorithm embodied with augmented Lagrange multiplier for solving constrained optimization problems