activity
20092025
most citedPosynomial Geometric Programming Problems with Multiple Parameters

11 citations · 39 across the 13 of their papers we have counts for

collaborators

13 papers

math.OC2025

Solution of Robust Linear Optimization Problems

Parthasarathi Mondal, Akshay Kumar Ojha

Robust optimization(RO) is an important tool for handling optimization problem with uncertainty. The main objective of RO is to solve optimization problems due to uncertainty assoc…

math.OC2023

Feasibility Conditions of Robust Portfolio Solutions under Single and Combined Uncertainties

Pulak Swain, Akshay Kumar Ojha

In this paper, we derive the feasibility conditions for the robust counterparts of the uncertain Markowitz model. Our study is based on ellipsoidal, box, polyhedral uncertainty set…

math.OC2023

Robust Portfolio Optimization under Ambiguous Chance Constraints

Pulak Swain, Akshay Kumar Ojha

In this paper, we discuss the ambiguous chance constrained based portfolio optimization problems, in which the perturbations associated with the input parameters are stochastic in…

math.OC2023★ 1 cited

Chance Constrained Robust Portfolio Optimization when the Perturbations Follow Normal and Exponential Distributions

Pulak Swain, Akshay Kumar Ojha

In this paper, we consider the chance constrained based uncertain portfolio optimization problem in which the uncertain parameters are stochastic in nature. The primary goal of the…

math.OC2023★ 1 cited

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…

math.OC2023

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…

math.NA2010★ 7 cited

Multi-objective Geometric Programming Problem With Weighted Mean Method

A. K. Ojha, K. K. Biswal

Geometric programming is an important class of optimization problems that enable practitioners to model a large variety of real-world applications, mostly in the field of engineeri…

cs.DS2010★ 7 cited

Multi-Objective Geometric Programming Problem Being Cost Coefficients as Continous Function with Weighted Mean Method

A. K. Ojha, A. K. Das

Geometric programming problems occur frequently in engineering design and management. In multiobjective optimization, the trade-off information between different objective function…

math.NA2010★ 5 cited

Geometric Programming Problem with Co-Efficients and Exponents Associated with Binary Numbers

A. K. Ojha, A. K. Das

Geometric programming (GP) provides a power tool for solving a variety of optimization problems. In the real world, many applications of geometric programming (GP) are engineering…

cs.NE2010

Existence and Global Logarithmic Stability of Impulsive Neural Networks with Time Delay

A. K. Ojha, Dushmanta Mallick, C. Mallick

The stability and convergence of the neural networks are the fundamental characteristics in the Hopfield type networks. Since time delay is ubiquitous in most physical and biologic…

cs.DS2010★ 11 cited

Posynomial Geometric Programming Problems with Multiple Parameters

A. K. Ojha, K. K. Biswal

Geometric programming problem is a powerful tool for solving some special type non-linear programming problems. It has a wide range of applications in optimization and engineering…

math.NA2009

Logarithmic Barrier Optimization Problem Using Neural Network

A. K. Ojha, C. Mallick, D. Mallick

The combinatorial optimization problem is one of the important applications in neural network computation. The solutions of linearly constrained continuous optimization problems ar…

cs.DS2009★ 7 cited

Lexicographic Multi-objective Geometric Programming Problems

Dr. A. K. Ojha, K. K. Biswal

A Geometric programming (GP) is a type of mathematical problem characterized by objective and constraint functions that have a special form. Many methods have been developed to sol…