1 citations · 1 across the 5 of their papers we have counts for
5 papers
PRP, HS and LS Conjugate Gradient Methods for Interval-Valued Multiobjective Optimization Problems
Tapas Mondal, Debdulal Ghosh, Zai-Yun Peng +1
In this article, we develop an efficient algorithm based on three special variants of the nonlinear conjugate gradient method, namely, the Polak--Ribiere--Polyak, Hestenes--Stiefel…
Newton Method for Multiobjective Optimization Problems of Interval-Valued Maps
Tapas Mondal, Debdas Ghosh, Do Sang Kim
In this article, we propose a Newton-based method for solving multiobjective interval optimization problems (MIOPs). We first provide a connection between weakly Pareto optimal poi…
Nonlinear Conjugate Gradient Method for Multiobjective Optimization Problems of Interval-Valued Maps
Tapas Mondal, Debdas Ghosh, Jingxin Liu +1
In this article, we propose an algorithm for the nonlinear conjugate gradient method to find a Pareto critical point of unconstrained multiobjective interval optimization problems.…
Uncertain random geometric programming problems
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 rando…
Geometric Programming Problems with Triangular and Trapezoidal Two-fold Uncertainty Distributions
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 pa…