Abstract
There are various methods for finding an approximate solution to a mixed-Boolean programming problem. Obviously, after finding such approximate solutions that corresponding to the value of the objective function, it is necessary to estimate the proximity of this value to the optimal one. For this, the corresponding linear programming problems are usually solved (i.e., the integer condition is discarded). This approach can be ineffective in the case of large dimensions, since the coordinates of the optimal solution and the optimal value of the objective function are determined. Obviously, to find the absolute and relative errors, there is no need to find the coordinates of the optimal solution, however, the approximate values of the functional and its upper bound are needed. For this purpose, in this paper, an algorithm for finding the upper bound of the interval problem of mixed-Boolean programming has been developed. For this, the majorizing function of the Lagrange-type for this problem is minimized.
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.
