Abstract
We suggest the second-order symmetric and self dual programs in multiobjective nonlinear programming. For these second-order symmetric dual programs, we prove the weak, strong, and converse duality theorems under convexity and concavity conditions. Also, we prove the self duality theorem for these second-order self dual programs and illustrate its example.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
