Pemodelan Berbasis Graf untuk Strategi Optimal dalam Pembelian Online

Abstract

Discount is a type of purchase promotion that is presented based on the total value of consumer purchases. In this study, the problem of optimizing online pur- chases is examined, where a buyer is interested in buying several items (x 2) by considering the total value discounts from different retailers, so that result in significant cost savings. The comparison shopping websites can be an alternative for consumers to find and compare information on items they want to buy from many online retailers. An integer programming formulation is proposed to obtain a near-optimal model of the online purchase problem. Then this formulation was developed into a graph-based modeling which was presented to build an optimiza- tion model (OptiGraph). The OptiGraph model obtained consists of the OptiNode set (subgraph) SGa, SGb, SGc (retailer a, b, and c which contains nodes m1 and m2 in each subgraph representing the item to be purchased) and the OptiEdge set which describes the relationship between nodes in the subgraph. All nodes and edges contain the constraint function properties of the integer programming formulation of the online purchase problem with discount.