Abstract
In this paper, we mainly study one convex mixed-integer nonlinear programming problem with partial differentiability and establish one outer approximation algorithm for solving this problem. With the help of subgradients, we use the outer approximation method to reformulate this convex problem as one equivalent mixed-integer linear program and construct an algorithm for finding optimal solutions. The result on finite steps convergence of the algorithm is also presented.
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 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.
