Abstract
AbstractIn this paper, a new approach to analyze optimality and saddle‐point criteria for a new class of nonconvex variational problems involving invex functions is studied. Namely, the modified objective function method is used for the considered variational problem in order to characterize its optimal solution. In this method, for the considered variational problem, corresponding modified variational problem with the η‐objective function is constructed. The equivalence in the original variational problem and its associated modified variational problem with the η‐objective function is proved under invexity hypotheses. Furthermore, by using the notion of a Lagrangian function, the connection between a saddle‐point in the modified objective function variational problem and an optimal solution in the considered variational problem is presented. Some examples of nonconvex variational problems are also given to verify the results established in the paper.
Sign-in/Register to access full text options 
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 callMore From: International Transactions in Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
