Abstract
We discuss the basic formulation of constraint propagation problems and extend it to the flexible constraint propagation environment where constraints are represented as fuzzy subsets. Some methods for ordering alternative solutions with respect to a collection of flexible constraints are discussed along with their drawbacks. Among the methods introduced is the Leximin method where we note its lack of an analytic formulation. With the aid of the ordered weighted averaging (OWA) operator we suggest an analytic formulation for the Leximin method. Some properties of this formulation are provided. We then describe the application of this new formulation for the Leximin method to situations in which the constraints are describable in a linear fashion. We show how we can use mixed integer programming techniques to find an optimal solution.
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.
