Optimality and duality for vector optimization problem with non-convex feasible set

S. K. Suneja (), Sunila Sharma () and Priyanka Yadav ()
Additional contact information
S. K. Suneja: University of Delhi
Sunila Sharma: University of Delhi
Priyanka Yadav: University of Delhi

OPSEARCH, 2020, vol. 57, issue 1, No 1, 12 pages

Abstract: Abstract The Karush–Kuhn–Tucker (KKT) optimality conditions are necessary and sufficient for a convex programming problem under suitable constraint qualification. Recently, several papers (Dutta and Lalitha in Optim Lett 7(2):221–229, 2013; Lasserre in Optim Lett 4(1):1–5, 2010; Suneja et al. Am J Oper Res 3(6):536–541, 2013) have appeared wherein the convexity of constraint function has been replaced by convexity of the feasible set. Further, Ho (Optim Lett 11(1):41–46, 2017) studied nonlinear programming problem with non-convex feasible set. We have used this modified approach in the present paper to study vector optimization problem over cones. The KKT optimality conditions are proved by replacing the convexity of the objective function with convexity of strict level set, convexity of feasible set is replaced by a weaker condition and no condition is assumed on the constraint function. We have also formulated a Mond–Weir type dual and proved duality results in the modified setting. Our results directly extend the work of Ho (2017) Suneja et al. (2013) and Lasserre (2010).

Keywords: Vector optimization; Cones; Level sets; KKT conditions; Duality; 90C26; 90C29; 90C30; 90C46 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-019-00401-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:57:y:2020:i:1:d:10.1007_s12597-019-00401-3

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-019-00401-3

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().