A Proposal of Well-Balanced Menu Planning by Using Rough Sets and Set Covering

Abstract

Recently, eating habits are changing with diverse lifestyles. Unbalanced diet, dietary obesity and undermine the faith in the safety of the food are causing a lot of problems. In this study we propose a well-balanced menu planning. Then, it is considered as the set covering problems that are a typical combinational optimization problem and it is known that NP is difficult. After, in order to take in an individual taste, we perform rule extraction by a rough set. And well-balanced menu are created.