Year-end Sale % OFF 
Abstract
This paper introduces a mathematical formulation of a binary integer linear program with multi-criteria and multi-constraint levels (MC 2) by using the framework of MC 2 linear programming. A branch-and-bound procedure is developed to solve such MC 2 binary integer linear programming problems. In this branch-and-bound procedure, an MC 2 linear programming problem is adopted for the relaxation of each subproblem in the branches. The upper bound of a subproblem is defined as the expected objective value of its relaxation problem having a probability distribution over parameters of multi-criteria and multi-constraint levels. A numerical example is used to demonstrate the applicability of the proposed method in solving MC 2 binary-integer-linear programming problems.
Published Version
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.
