Abstract
Theoretical results are developed for zero–one linear multiple objective programs. Initially a simpler program, having as a feasible set the vertices of the unit hypercube, is studied. For the main problem an algorithm, computational experience, parametric analysis and indifference sets are presented. The mixed integer version of the main problem is briefly discussed.
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.
