Abstract
We apply some advanced tools of quasiconvex analysis to establish Karush–Kuhn–Tucker type necessary and sufficient optimality conditions for non-differentiable semi-infinite programming problems. In addition, we propose a linear characterization of optimality for the mentioned problems. Examples are also designed to analyze and illustrate the results obtained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
