Department of Computer Science & Engineering

&ldquo;IIT Jodhpur is committed to impart quality education to facilitate the creation of qualified, competent and responsible human resources to meet the emerging technological challenges of the world. It is working towards creating an equitable learning platform that is positive, accessible and effective in the face of the modern societal and scientific advancements.

Flexibility in curriculum, in all its academic programs, encompassing elements of teaching, research, creativity, innovation and entrepreneurship is the most unique feature of IIT Jodhpur. The Department of Science and Technology (DST), under the National Mission on Cyber Physical Systems, has identified IIT Jodhpur as a Technology &amp; Innovation Hub in the area of Augmented Reality and Virtual Reality. The institute has also been nominated as the coordinator for the Jodhpur City and Knowledge Cluster by the Office of Principal Scientific Adviser, Government of India.

The sprawling 852-acre IIT Jodhpur campus is a majestic tribute to the deep-rooted diverse cultural heritage of the region. The campus is an architectural masterpiece, which is slated to become an international exemplar of sustainability with net-zero energy, and advanced water and waste management strategies.&rdquo;

IIT Jodhpur

School of Artificial Intelligence and Data Science (AIDE)

In this paper, a very recently introduced class of convexlike functions known as the generalized pre-invex function is studied. It is demonstrated that among convexlike functions the generalized pre-invex functions are important since they can be profitably used in sufficiency conditions in vector optimization. Various properties of the class of generalized pre-invex function are also studied.

Asia-Pacific Journal of Operational Research

On generalized pre-invex functions

In this article we present a simple method to deduce necessary conditions for weak minimisation of a convex vector program in a Banach space. Our main tool here will be the generalised Jabcobian of Ralph.

Fulltext

Bulletin of the Australian Mathematical Society

On convex vector optimisation

We introduce the notion of semi-invex function (non-smooth) and the associated subdifferential. We study their properties and establish the conditions for optimality in constrained and unconstrained minimisation problems.

World University root node

Semi-invex functions and their subdifferentials

The equivalence between saddle points and optima and duality theorem (without constraint qualification) are established for a large class of non-smooth and non-convex programs.