default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVivek Laha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]R. N. Mohapatra
, Prachi Sachan, Vivek Laha:
Optimality Conditions for Mathematical Programs with Vanishing Constraints Using Directional Convexificators. Axioms 13(8): 516 (2024)- [j11]Shashi Kant Mishra, Vivek Laha, Mohd Hassan:
On Quasiconvex Multiobjective Optimization and Variational Inequalities Using Greenberg-Pierskalla Based Generalized Subdifferentials. J. Optim. Theory Appl. 202(3): 1169-1186 (2024) - [j10]Vivek Laha, Harsh Narayan Singh, Ram N. Mohapatra:
On multiobjective fractional programs with vanishing constraints. RAIRO Oper. Res. 58(6): 4701-4716 (2024) - 2023
- [j9]Vivek Laha, Harsh Narayan Singh:
On quasidifferentiable mathematical programs with equilibrium constraints. Comput. Manag. Sci. 20(1): 30 (2023) - [j8]Harsh Narayan Singh, Vivek Laha:
On minty variational principle for quasidifferentiable vector optimization problems. Optim. Methods Softw. 38(2): 243-261 (2023) - 2021
- [j7]Pushkar Jaisawal, Tadeusz Antczak, Vivek Laha:
On sufficiency and duality for semi-infinite multiobjective optimisation problems involving V-invexity. Int. J. Math. Oper. Res. 18(4): 465-483 (2021)
2010 – 2019
- 2016
- [j6]Shashi Kant Mishra, Vinay Singh, Vivek Laha:
On duality for mathematical programs with vanishing constraints. Ann. Oper. Res. 243(1-2): 249-272 (2016) - [j5]Shashi Kant Mishra, Vivek Laha:
On minty variational principle for nonsmooth vector optimization problems with approximate convexity. Optim. Lett. 10(3): 577-589 (2016) - [j4]Bader Al-Shamary, Shashi Kant Mishra, Vivek Laha:
On approximate starshapedness in multiobjective optimization. Optim. Methods Softw. 31(2): 290-304 (2016) - 2014
- [j3]Vivek Laha, Bader Al-Shamary, Shashi Kant Mishra:
On nonsmooth V-invexity and vector variational-like inequalities in terms of the Michel-Penot subdifferentials. Optim. Lett. 8(5): 1675-1690 (2014) - 2013
- [j2]Shashi Kant Mishra, Vivek Laha:
On Approximately Star-Shaped Functions and Approximate Vector Variational Inequalities. J. Optim. Theory Appl. 156(2): 278-293 (2013) - [j1]Shashi Kant Mishra, Vivek Laha:
A Note on the Paper "On Approximately Star-Shaped Functions and Approximate Vector Variational Inequalities". J. Optim. Theory Appl. 159(2): 554-557 (2013)
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-11-27 21:25 CET 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:
