Abstract
We suggest a new approach to solve discrete optimization problems, based on the possibility of presenting a function as a superposition of simpler functions. Such a superposition can be easily represented in the form of a network for which the inputs correspond to variables, intermediate nodes - to functions entering the superposition, and in the final node the function is calculated. Due to such representation the method has been called the method of network programming (in particular, dichotomic). The network programming method is applied for solving nonlinear optimization problems. The concept of a dual problem is implemented. It is proved that the dual problem is a convex programming problem. Necessary and sufficient optimality conditions for a dual problem of integer linear programming are developed.
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.
