{"type":"ScholarlyArticle","title":"On Constrained Boolean Pareto Optimization","authors":[{"name":"Chao Qian","slug":"chao-qian","given":"Chao","family":"Qian","affiliation":""},{"name":"Yang Yu","slug":"yang-yu","given":"Yang","family":"Yu","affiliation":""},{"name":"Zhi-Hua Zhou","slug":"zhi-hua-zhou","given":"Zhi-Hua","family":"Zhou","affiliation":""}],"abstract":"Pareto optimization solves a constrained optimization task by reformulating the task as a bi-objective problem. Pareto optimization has been shown quite effective in applications; however, it has little theoretical support. This work theoretically compares Pareto optimization with a penalty approach, which is a common method transforming a constrained optimization into an unconstrained optimization. We prove that on two large classes of constrained Boolean optimization problems, minimum matroid optimization (P-solvable) and minimum cost coverage (NP-hard), Pareto optimization is more efficient than the penalty function method for obtaining the optimal and approximate solutions, respectively. Furthermore, on a minimum cost coverage instance, we also show the advantage of Pareto optimization over a greedy algorithm.","doi":null,"url":"https://ijcai.org/proceedings/2015/61","pdf":"https://ijcai.org/proceedings/2015/0061.pdf","markdown":"https://ijcai.org/proceedings/2015/61.md","bibtex":"https://ijcai.org/proceedings/2015/bibtex/61","volume":{"slug":"2015","title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2015","url":"https://ijcai.org/proceedings/2015/","year":2015,"location":"Buenos Aires, Argentina","dates":"25–31 July 2015","editors":"Qiang Yang and Michael Wooldridge","isbn":"978-1-57735-738-4","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraints, Satisfiability, and Search","track":"Main Track","number":61,"pages":{"first":389,"last":394},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}