<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Azarbaijan Shahid Madani University</PublisherName>
				<JournalTitle>Communications in Combinatorics and Optimization</JournalTitle>
				<Issn>2538-2128</Issn>
				<Volume></Volume>
				<Issue>Articles in Press</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>03</Month>
					<Day>20</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Robust optimality and duality for bilevel optimization problems under uncertain data</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">14920</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.29950.2236</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Rishabh</FirstName>
					<LastName>Pandey</LastName>
<Affiliation>Department of Mathematics, National Institute of Technology Mizoram,
Aizawl, 796012, Mizoram, India</Affiliation>

</Author>
<Author>
					<FirstName>Yogendra</FirstName>
					<LastName>Pandey</LastName>
<Affiliation>Department of Mathematics, Satish Chandra College, Ballia, 277001, Uttar Pradesh, India</Affiliation>

</Author>
<Author>
					<FirstName>Vinay</FirstName>
					<LastName>Singh</LastName>
<Affiliation>Department of Mathematics, National Institute of Technology Mizoram,
Aizawl, 796012, Mizoram, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>08</Month>
					<Day>15</Day>
				</PubDate>
			</History>
		<Abstract>The exploration of robust bilevel programming problems is a relatively new development in optimization theory. In this study, we examine a bilevel optimization problem in which both the upper-level and lower-level constraints involve uncertainty. By reducing the problem to a single-level, nonlinear and non-smooth program, we explore sufficient optimality conditions and duality theorems for robust optimal solutions of the considered non-smooth uncertain bilevel optimization problem, using Clarke subdifferentials. Leveraging the characteristics of Clarke subdifferentials, we propose Wolfe-type robust dual models. Additionally, we establish various duality theorems, including weak and strong robust duality, in terms of Clarke subdifferentials. Several illustrative examples are presented to confirm the applicability of the results developed.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Bilevel programming</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Robust optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Sufficient optimality conditions</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Duality</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Robust convexity</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_14920_7acb715c7aead146380c5edf9a17dd39.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
