![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Surjeet Kaur Suneja
Person information
- affiliation: University of Delhi, Department of Mathematics
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j13]Surjeet Kaur Suneja, Sunila Sharma, Priyanka Yadav
:
Generalized higher-order cone-convex functions and higher-order duality in vector optimization. Ann. Oper. Res. 269(1-2): 709-725 (2018) - 2014
- [j12]Surjeet Kaur Suneja, Pooja Louhan:
Higher-order symmetric duality under cone-invexity and other related concepts. J. Comput. Appl. Math. 255: 825-836 (2014) - [j11]Surjeet Kaur Suneja, Sunila Sharma, Malti Kapoor:
Modified objective function method in nonsmooth vector optimization over cones. Optim. Lett. 8(4): 1361-1373 (2014) - [j10]Surjeet Kaur Suneja, Pooja Louhan:
Unified duality for vector optimization problem over cones involving support functions. RAIRO Oper. Res. 48(3): 271-302 (2014) - 2013
- [j9]Surjeet Kaur Suneja, Pooja Louhan, Meetu Bhatia Grover
:
Higher-order cone-pseudoconvex, quasiconvex and other related functions in vector optimization. Optim. Lett. 7(4): 647-664 (2013) - 2011
- [j8]Surjeet Kaur Suneja, Seema Khurana, Meetu Bhatia
:
Optimality and duality in vector optimization involving generalized type I functions over cones. J. Glob. Optim. 49(1): 23-35 (2011) - [j7]Surjeet Kaur Suneja, Bhawna Kohli:
Optimality and Duality Results for Bilevel Programming Problem Using Convexifactors. J. Optim. Theory Appl. 150(1): 1-19 (2011)
2000 – 2009
- 2008
- [j6]Surjeet Kaur Suneja, Seema Khurana, Sharma Vani:
Generalized nonsmooth invexity over cones in vector optimization. Eur. J. Oper. Res. 186(1): 28-40 (2008) - 2007
- [j5]Surjeet Kaur Suneja, Meetu Bhatia
:
Cone Convex and Related Functions in Optimization over Topological Vector Spaces. Asia Pac. J. Oper. Res. 24(6): 741-754 (2007) - [j4]Kalpana Dahiya
, Surjeet Kaur Suneja, Vanita Verma:
Convex programming with single separable constraint and bounded variables. Comput. Optim. Appl. 36(1): 67-82 (2007) - 2003
- [j3]Surjeet Kaur Suneja, C. S. Lalitha
, Seema Khurana:
Second order symmetric duality in multiobjective programming. Eur. J. Oper. Res. 144(3): 492-500 (2003) - 2002
- [j2]Surjeet Kaur Suneja, Sunila Aggarwal, Sonia Davar:
Multiobjective symmetric duality involving cones. Eur. J. Oper. Res. 141(3): 471-479 (2002)
1990 – 1999
- 1998
- [j1]Surjeet Kaur Suneja, Sudha Gupta:
Duality in multiobjective nonlinear programming involving semilocally convex and related functions. Eur. J. Oper. Res. 107(3): 675-685 (1998)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint