A Survey on Determining k-Most Demanding Products

It is regularly vital for makers to choose what products to produce with the goal that they can expand their market share in an inexorably wild market. To choose which products to produce, producers need to break down the consumers' necessities and how consumers settle on their buy decisions so that the new products will be aggressive in the market. In this paper, an issue of production arrangements, named k-most demanding products (k-MDP) discovering, is formed. Given a set of clients demanding a certain sort of products with various attributes, a set of existing products of the sort, a set of candidate products that can be offered by an organization, and a positive integer k, we need to help the organization to choose k products from the candidate products such that the normal number of the aggregate clients for the k products is boosted. We demonstrate the issue is NP-hard when the quantity of attributes for an item is 3 or more. One greedy algorithm is proposed to discover approximate answer for the issue. We likewise endeavor to discover the optimal arrangement of the issue by evaluating the upper bound of the normal number of the aggregate customers for a set of k candidate products for diminishing the search space of the optimal arrangement. An exact algorithm is then given to discover the optimal arrangement of the issue by utilizing this pruning method. To handle this issue, we also propose an effective greedy-based approximation algorithm, called as 'Top k exact algorithm' with a provable arrangement ensure. Utilizing this algorithm, we can discover the most demanding products that can be given to the clients.