• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.189-195
• /
• 2021

This paper discusses choice of loans problem(CLP) that is to minimize annual payment from which bank's borrows in multi-banks multi-nations with distinct interests. For the CLP, there is impossible to obtain the optimal solution actually without the help of mathematical software package as linear programming(LP). This paper applies the method used in transportation problem(TP) that finds initial feasible solution with selects minimum interest first, least cost method(LCM), to CLP. Result of experiment, the proposed algorithm can be obtains the optimal solution with at most two exchange optimization for LCM's initial feasible solution.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.181-188
• /
• 2021

In preparing a aggregate production plan(APP), the transportation method generally uses a linear planning(LP) software package for TSM(transportation simplex method), which seeks initial solutions with either NCM, LCM, or VAM specialized in transportation issues and optimizes them with either SSM or MODI. On the other hand, this paper proposes a transportation method that easily, quickly, and accurately prepares a APP without software package assistance. This algorithm proposed simply assigned to least cost-first, and minimized the inventory periods. Applying the proposed algorithm to 6-benchmarking data, this algorithm can be obtained better optimal solution than VAM or LP for 4 data, and we obtain the same results for the remained 2 data.