Search

This research raises problems among Baitul Mal aid recipients regarding aid to micro businesses. The process of assisting is an important activity to develop micro-businesses so that they can continue to operate and develop. Selection is also needed to prevent aid from being distributed incorrectly. Therefore, the proposed solution is to utilize data mining techniques, especially classification methods (clustering) to identify potential aid recipients who truly deserve to receive aid. This research also uses the Principal Component Analysis (PCA) method to reduce attribute dimensions in the dataset to increase the accuracy of the classification process. By optimizing the classification process through appropriate attribute reduction, this research is expected to make a positive contribution to increasing the efficiency and accuracy of credit risk assessment in the banking sector. The results of this research are: accuracy after the dataset has been reduced by 2 (two) attributes has a higher value when compared to the dataset that has not been reduced, this happens because the attribute reduction process is carried out to reduce attributes that are not or less relevant. So it can be said that the reduction process influences the accuracy of the C5.0 algorithm classification results. [ABSTRACT FROM AUTHOR]

This study aims to model the diet menu problem based on a Linear Boolean approach. Diet problems can be categorized into two models: Diet Problems (DP), which creates diet plans, and Menu Problems (MP), which creates cooking plans using specific recipes. The two diet models are then combined to form a model of the diet menu problem. A fundamental problem of an optimal diet is formulating a daily menu that is consumed to provide the nutrients that everyone needs at minimal costs. Therefore, a diet menu problem was formed using the developed mathematical model, namely the Linear Boolean model. This model uses a Boolean Linear approach to transform a set of daily diet menus into a model into an integer linear program model. The phase of forming a model of the diet menu problem is performed by determining the notations, parameters, variables, objective functions, and some constraints related to the diet menu. Then, a mathematical model of the diet menu problem using a Boolean Linear approach where the minimum objective function is attained and the constraints are held. [ABSTRACT FROM AUTHOR]

MIQQP-convex is an optimization model class that combines discrete and continuous variables with objective functions or constraints in quadratic and convex forms. By relaxing the discrete variables to be continuous, this model will be generalized into a convex quadratic program. The convexity of this program guarantees that the local optimal solution will be the global optimal solution. By using the penalty function, the constrained convex quadratic program is reconstructed into an unconstrained convex quadratic program. The solution sequences will converge rapidly to the optimal solution by the combination of the penalty function and the gradient projection method in an unconstrained program. By recalling the discrete variables around the global optimal solution of the convex quadratic program, the global optimal solution approach of the MIQQP-convex is expected to be found. [ABSTRACT FROM AUTHOR]

In This note, we carry out investigations the necessary and sufficient condition for a certain non-empty subsets lattice-normed vector lattice to have one of the follwing properties : the order ρ-continuous and the ρ-Fatou property. We also give an examples of lattice-normed vector lattice decomposable whice is not have ρ-Fatou property. [ABSTRACT FROM AUTHOR]

Product packaging will result in the emergence of waste after the product is used. Management of the waste must be considered so as not to cause loss and damage to nature. The waste management involves a transfer station facility which is a temporary waste disposal site where at this facility, the waste will be processed using existing technology before the waste is finally disposed of at the final disposal site. The model presented in solving the problem of location routing in the waste is multi-objective which comes from the existing literature. The model presented aims to minimize total costs, greenhouse gas emissions and energy consumption levels and the model is able to determine the location and allocation of transfer stations as well as the selection of waste processing technology. To overcome some of the objectives in the problem, a fuzzy programming solution approach is used. [ABSTRACT FROM AUTHOR]

Rumor is a social phenomenon in which the same comment spreads quickly on a large scale via a chain of com-munication. Rumors are an important part of social interaction, and they have a large impact on everyone's work and daily life. Misinformation can have a devastating effect on people, especially when they are confronted with a religious or political crisis. It is necessary to understand the dynamic characteristics of rumor spread in order to reduce and avoid the dangers of rumor spread in online social networks. The model is similar to a disease spread model. This occurrence merits further investigation or research. As a result, the researcher is curious about the rumor spreading model with delay time as a saturation control function. Analyzing the mathematical model of rumor spread's local stability of the equilibrium point and the Hopf Bifurcation, as well as numerical simulations of the model of rumor spread. [ABSTRACT FROM AUTHOR]

The Vehicle Routing Problem (VRP) is a critical component of many logistics systems involving the routing and scheduling of vehicles from a depot to a set of customer nodes. The Vehicle Routing Problem with Time Window (VRPTW) is one of the most studied versions of VRP, in which each customer must be visited within a specific time interval known as a time window. It has previously been demonstrated that VRPTW is an NP-hard problem, which means that finding optimal solutions for large problems is computationally difficult. As a result, a number of heuristics and metaheuristics have been proposed. This study aims to develop a new relaxation scheme that loosens the constraints of the time window, resulting in a feasible and good solution. Furthermore, as an alternative model for VRPTW that is time dependent and involves multiple suppliers, this research will develop a discrete optimization model. This study will also create a metaheuristic algorithm with an initial solution defined by relaxing the time window. [ABSTRACT FROM AUTHOR]