Abstract
ABSTRACTIn this paper, a second-order dual problem for a non-differentiable minimax complex programming problem is formulated. The weak, strong, and strict converse duality theorems are constructed under generalized Θ-bonvexity assumptions. This means that there are no duality gaps between primary problem and its dual problem.
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 callDisclaimer: 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.
