Judul: Determinants of Capital Structure in Food  and Beverage Companies Listed on the IDX
Abstrak: Industri makanan dan minuman merupakan industri yang memiliki kontribusi yang besar terhadap PDB dan salah satu sub sektor penyerapan tenaga kerja terbesar di Indonesia. Namun kondisi tersebut tidak diikuti oleh semakin meningkatnya struktur modal perusahaan. Struktur modal yang optimal adalah yang meminimalisasi biaya modal perusahaan dan dengan demikian dapat memaksimalkan nilai perusahaan (Horne dan Wachowicz 2008). Objek penelitian ini adalah sub sektor industri makan dan minuman. Data yang digunakan merupakan data sekunder yang diperoleh dari laporan keuangan perusahaan selama periode 2015-2019 serta studi literatur. Metode yang digunakan dalam penelitian adalah analisis regresi data panel dengan profitabilitas, struktur aset, pertumbuhan perusahaan, risiko bisnis sebagai variabel independen serta struktur modal sebagai variabel dependen. Hasil penelitian menunjukkan bahwa struktur aset berpengaruh positif terhadap struktur modal (DAR) sedangkan risiko bisnis berpengaruh negatif signifikan terhadap struktur modal (DER). Variabel profitabilitas, pertumbuhan perusahaan tidak signifikan terhadap struktur modal.
Keyword: asset structure, capital structure, company growth, food and beverage industry, profitability

Judul: Penentuan Struktur Modal yang Optimum Pada Perusahaan Makanan dan Minuman yang Terdaftar di BEI
Abstrak: Increasing competition in the business in line with the economic development requires the company to undertake the development or expansion of the company. A company must have an optimal capital structure in order to survive in the industry. The combination of this capital structure will affect the cost of capital to be issued by the company. If the optimal capital structure is said to have a low capital cost. This study was conducted to analyze the determination of an optimal capital structure in companies in the food and beverage industry. The data used are secondary data obtained from the financial statements of PT Mayora Indah Tbk, PT Tiga Pilar Sejahtera Tbk, PT Indofood Sukses Makmur Tbk, and PT Indofood CBP Sukses Makmur Tbk are processed using the method of calculating the cost of capital (COC) and Weight Average Cost of Capital (WACC). The results showed that PT Tiga Pilar Sejahtera Tbk and PT Indofood Sukses Makmur Tbk already have an optimal capital structure.
Keyword: company value, food and beverage company, cost of capita, capital structure

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm