Manuscript Number : IJSRST196190
A Survey on Determining k-Most Demanding Products
Authors(5) :-Payal Deshmukh, Jaya Paytode, Shweta Tambulkar, Akshata Mahalle, Swati Gurnule It is routinely indispensable for makers to pick what products to deliver with the objective that they can extend their market share in a relentlessly wild market. To pick which products to deliver, makers need to break down the consumers' necessities and how consumers settle on their purchase decisions so the new products will be forceful in the market. In this paper, an issue of generation courses of action, named k-most demanding products (k-MDP) finding, is framed. Given an arrangement of customers demanding a specific kind of products with different traits, an arrangement of existing products of the sort, an arrangement of competitor products that can be offered by an association, and a positive whole number k, we have to help the association to pick k products from the applicant products to such an extent that the typical number of the total customers for the k products is supported. We show the issue is NP-hard when the amount of qualities for a thing is at least 3. One covetous calculation is proposed to find estimated respond in due order regarding the issue. We likewise attempt to find the ideal course of action of the issue by assessing the upper bound of the typical number of the total clients for an arrangement of k applicant products for reducing the hunt space of the ideal game plan. A correct calculation is then given to find the ideal course of action of the issue by using this pruning technique. To deal with this issue, we likewise propose a powerful covetous based estimation calculation, called as 'Top k correct calculation' with a provable game plan guarantee. Using this calculation, we can find the most demanding products that can be given to the customers.
Payal Deshmukh K-MDP, Decision Support, Production Plan, Consumer Behaviour Publication Details
Published in : Volume 6 | Issue 1 | January-February 2019 Article Preview
BE, Department of Computer Science and Engineering, Shrimati Rajshree Mulak College of Engineering, Nagpur, Maharashtra, India
Jaya Paytode
BE, Department of Computer Science and Engineering, Shrimati Rajshree Mulak College of Engineering, Nagpur, Maharashtra, India
Shweta Tambulkar
BE, Department of Computer Science and Engineering, Shrimati Rajshree Mulak College of Engineering, Nagpur, Maharashtra, India
Akshata Mahalle
BE, Department of Computer Science and Engineering, Shrimati Rajshree Mulak College of Engineering, Nagpur, Maharashtra, India
Swati Gurnule
BE, Department of Computer Science and Engineering, Shrimati Rajshree Mulak College of Engineering, Nagpur, Maharashtra, India
Date of Publication : 2019-02-28
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 500-505
Manuscript Number : IJSRST196190
Publisher : Technoscience Academy
Journal URL : https://ijsrst.com/IJSRST196190
Citation Detection and Elimination |
|
| BibTeX | RIS | CSV