Determining k-Most Demanding Products with Maximum Expected Number of Total Customers
Rs4,500.00
10000 in stock
SupportDescription
ABSTRACT :-
In problem of production plans, named k-most demanding products (k-MDP) discovering, is formulated and then production can be can be evaluate in marketing strategies, companies usually need to identify one with the highest utility or value. Then main thing is microeconomics is a branch of economics, which studies how customers and producers make decisions and how they interact in markets. In this part we find that Due to different applications, the studies related to the microeconomic problems can be categorized into three types including the potential customers finding, the product advantages discovery, and the product positioning. When we create given a set of existing products with multiple components, consider the problem of producing better products than existing ones with cooperative companies. Finally we claimed that the utility or value of a production plan can be modeled as a function that reflects the interaction of the company with other agents such as customers and competitors. Accordingly, two greedy algorithms, the SPG algorithm and the IG algorithm, are proposed to find the results approaching the optimal solution. The experiment results demonstrate that the execution time of all the proposed algorithms is much less than that of the exhaustive search approach.
Only logged in customers who have purchased this product may leave a review.
Reviews
There are no reviews yet.