Claim Missing Document
Check
Articles

Found 2 Documents
Search

Systematic Literature Review on Adjustable Robust Shortest Path Problem Wida Nurul Fauziyah; Diah Chaerani; Herlina Napitupulu
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 7, No 4 (2023): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Universitas Islam Negeri Maulana Malik Ibrahim Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/ca.v7i4.17648

Abstract

In real-world optimization problems, effective path planning is important. The Shortest Path Problem (SPP) model is a classical operations research that can be applied to determine an efficient path from the starting point to the end point in a plan. However, in the real world, uncertainty is often encountered and must be faced. Significant uncertainty factors in the problem of determining the shortest path are problems that are difficult to predict, therefore new criteria and appropriate models are needed to deal with uncertainty along with the required efficient solution. The uncertainty factor can be formulated using an uncertain SPP optimization model, assuming parameters that are not known with certainty but are in an uncertain set. Problems with uncertainty in mathematical optimization can be solved using Robust Optimization (RO). RO is a methodology in dealing with the problem of data uncertainty caused by errors in data measurement. The uncertainty in the linear optimization problem model can be formed by loading the uncertainty that only exists in the constraint function by assuming its uncertainty using the Robust Counterpart (RC) methodology. In this paper, we will review the literature on the two-stage optimization model for the SPP problem using an Adjustable Robust Counterpart (ARC).
Robust Optimization Model for Internet Shopping Online Problems with Endorsement Costs in the Fashion Industry Olivia Anjanette; Betty Subartini; Diah Chaerani
Jurnal Matematika Integratif Vol 19, No 1: April 2023
Publisher : Department of Matematics, Universitas Padjadjaran

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (296.763 KB) | DOI: 10.24198/jmi.v19.n1.45096.67-76

Abstract

Online business is a business activity carried out via the internet or digitally. Buying, selling, and advertising are done online through e-commerce, social media, or online shops. The products offered vary, including services, food, household needs, and fashion. Selling online is not limited by time and distance, and consumers can obtain information about products and services that can influence their decisions. At the same time, sellers also have the opportunity to advertise their products in a broader range by making endorsements. An endorsement is a form of advertising using well-known figures who are recognized, trusted, and respected by people. In this thesis, a model for optimizing the problem of online internet shopping with endorsement fees is formulated. This optimization model aims to maximize the profits gained by sellers in marketing their products online. In marketing products, there is uncertainty in the number of requests. To overcome this uncertainty, an approach is needed that can handle this uncertainty, namely Robust optimization. The Robust optimization model is solved using the polyhedral uncertainty set approach, resulting in a computationally tractable optimal solution. Keywords: internet shopping online; endorsement costs; robust optimization.