Abstract
In our discussion of Chapter V, we had introduced a special class of disjunctive programs called facial disjunctive programs, examples of which included the zero-one linear integer programming problem and the linear complementarity problem. We had seen that for this special class of problems, it was relatively easy to generate the convex hull of feasible points. In this chapter, we will discuss two finitely convergent schemes which solve facial disjunctive programs by generating facets of the convex hull of feasible points as and when needed, until such time as either a suitable termination criterion is met or the problem is solved through the generation of the entire convex hull.
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.
