default search action
Akshay K. Ojha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Tapas Mondal
, Akshay Kumar Ojha, Sabyasachi Pani:
Geometric Programming Problems with Triangular and Trapezoidal Twofold Uncertainty Distributions. J. Optim. Theory Appl. 200(3): 978-1016 (2024) - 2022
- [j10]Tapas Mondal
Solving geometric programming problems with triangular and trapezoidal uncertainty distributions. RAIRO Oper. Res. 56(4): 2833-2851 (2022) - 2021
- [j9]Pulak Swain
Bi-level optimization approach for robust mean-variance problems. RAIRO Oper. Res. 55(5): 2941-2961 (2021)
2010 – 2019
- 2019
- [j8]Suvasis Nayak
On multi-level multi-objective linear fractional programming problem with interval parameters. RAIRO Oper. Res. 53(5): 1601-1616 (2019) - [j7]Suvasis Nayak
An approach of fuzzy and TOPSIS to bi-level multi-objective nonlinear fractional programming problem. Soft Comput. 23(14): 5605-5618 (2019) - [e2]Jagdish Chand Bansal, Kedar Nath Das, Atulya Nagar, Kusum Deep, Akshay Kumar Ojha:
Soft Computing for Problem Solving - SocProS 2017, Volume 1, Bhubaneswar, India, December 23-24, 2017. Advances in Intelligent Systems and Computing 816, Springer 2019, ISBN 978-981-13-1591-6 [contents] - [e1]Jagdish Chand Bansal, Kedar Nath Das, Atulya Nagar, Kusum Deep, Akshay Kumar Ojha:
Soft Computing for Problem Solving - SocProS 2017, Volume 2, Bhubaneswar, India, December 23-24, 2017. Advances in Intelligent Systems and Computing 817, Springer 2019, ISBN 978-981-13-1594-7 [contents] - 2018
- [j6]Y. Ramu Naidu
A space transformational invasive weed optimization for solving fixed-point problems. Appl. Intell. 48(4): 942-952 (2018) - [j5]Y. Ramu Naidu
Solving Multiobjective Optimization Problems Using Hybrid Cooperative Invasive Weed Optimization With Multiple Populations. IEEE Trans. Syst. Man Cybern. Syst. 48(6): 821-832 (2018) - 2017
- [c3]Suvasis Nayak
Multi-objective Linear Fractional Programming Problem with Fuzzy Parameters. SocProS (1) 2017: 79-90 - 2015
- [j4]Suvasis Nayak
Goal attainment method and Taylor series approximation to solve multi-objective linear fractional programming problem. Int. J. Math. Model. Numer. Optimisation 6(3): 235-249 (2015) - [j3]Akshay K. Ojha, Rashmi Ranjan Ota:
A hybrid method for solving multi-objective geometric programming problem. Int. J. Math. Oper. Res. 7(2): 119-137 (2015) - [j2]Y. Ramu Naidu
A hybrid version of invasive weed optimization with quadratic approximation. Soft Comput. 19(12): 3581-3598 (2015) - [c2]Suvasis Nayak
An Approach to Solve Multi-objective Linear Fractional Programming Problem. SocProS (1) 2015: 711-721 - 2014
- [j1]Akshay K. Ojha, Rashmi Ranjan Ota:
Multi-objective geometric programming problem with Karush-Kuhn-Tucker condition using ϵ-constraint method. RAIRO Oper. Res. 48(4): 429-453 (2014) - [c1]Akshay K. Ojha, Y. Ramu Naidu
Hybridizing Particle Swarm Optimization with Invasive Weed Optimization for Solving Nonlinear Constrained Optimization Problems. SocProS (2) 2014: 595-606 - 2010
- [i7]Akshay K. Ojha, K. K. Biswal:
Posynomial Geometric Programming Problems with Multiple Parameters. CoRR abs/1001.3493 (2010) - [i6]Akshay K. Ojha, Dushmanta Mallick, C. Mallick:
Existence and Global Logarithmic Stability of Impulsive Neural Networks with Time Delay. CoRR abs/1002.1164 (2010) - [i5]Akshay K. Ojha, A. K. Das:
Geometric Programming Problem with Co-Efficients and Exponents Associated with Binary Numbers. CoRR abs/1002.1167 (2010) - [i4]Akshay K. Ojha, A. K. Das:
Multi-Objective Geometric Programming Problem Being Cost Coefficients as Continous Function with Weighted Mean Method. CoRR abs/1002.4002 (2010) - [i3]Akshay K. Ojha, K. K. Biswal:
Multi-objective Geometric Programming Problem With Weighted Mean Method. CoRR abs/1003.1477 (2010)
2000 – 2009
- 2009
- [i2]Akshay K. Ojha, K. K. Biswal:
Lexicographic Multi-objective Geometric Programming Problems. CoRR abs/0912.1832 (2009) - [i1]Akshay K. Ojha, C. Mallick, Dushmanta Mallick:
Logarithmic Barrier Optimization Problem Using Neural Network. CoRR abs/0912.3927 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: