scholarly journals Material Handling and Product Optimality of an Educational Institution Bakery Using Integer Programming

2021 ◽  
Vol 2 (3) ◽  
pp. 53-61
Author(s):  
Adedugba Adebayo ◽  
Ogunnaike Olaleke ◽  
Kingsley Adeyemo ◽  
Busola Kehinde
Keyword(s):  
Linear Programming ◽  
Integer Programming ◽  
Integer Linear Programming ◽  
Material Handling ◽  
Educational Institution ◽  
Real Variable ◽  
Medium Size ◽  
Production Plant ◽  
Production Section ◽  
Bread Production

This study presents a numerical analysis for enhancing material handling allotment and deciding whether to produce or not in a bread production section of an educational institution. The study utilized 0/1 and real variables by the means of integer linear programming. In line with this, integer linear programming was applied in a bread production plant that produces three brands of bread, such as, medium size (x1), huge size (x2), and small size (x3). The discoveries using 0/1 variable shows that x1 = x2 = x3 = 1 while Z = 80 Naira. Hence, the item mix of bread is optimal, and production can continue. The result obtained utilizing real variable demonstrated that x1 (medium-size bread) = 649, x2 (huge-size bread) = 0, x3 (small-size bread) = 145, Z=18,388 Naira. In this manner the material handling allotment was optimized to obtain a profit of 18,388 Naira. Consequently, the organization should produce more medium-size bread (x1), more small-size bread (x3), and less huge-size bread (x2).

scholarly journals MASALAH GROUND-HOLDING DENGAN DUA TERMINAL DALAM PENGENDALIAN LALU LINTAS UDARA

2014 ◽  
Vol 13 (1) ◽  
pp. 61
Author(s):  
W. PRASETYO ◽  
F. HANUM ◽  
P. T. SUPRIYO
Keyword(s):  
Linear Programming ◽  
Integer Programming ◽  
Integer Linear Programming

Setiap maskapai penerbangan memiliki strategi untuk meminimumkan biaya penundaan antara lain kebijakan ground-holding. Kebijakan ini mampu membuat maskapai untuk menahan pesawatnya di terminal keberangkatan meskipun sudah dijadwalkan untuk lepas landas sehingga setelah sampai di kota tujuan dapat langsung mendarat tanpa harus menunggu di udara. Dalam karya ilmiah ini dibahas tentang penentuan waktu keberangkatan dan kedatangan dari setiap penerbangan yang dapat meminimumkan biaya penundaan. Masalah ground-holding dengan dua terminal dalam pengendalian lalu lintas udara dapat diformulasikan menjadi masalah Pure 0-1 integer linear programming. Dalam penelitian ini dibahas dua kasus dari kebijakan ground-holding. Kasus pertama: seluruh penerbangan dapat menahan pesawatnya di terminal keberangkatan dan dapat tertahan di udara. Kasus kedua: seluruh penerbangan hanya menahan pesawatnya di terminal keberangkatan sehingga pada saat sampai di kota tujuan tidak tertahan di udara. Diberikan simulasi dengan mengasumsikan terdapat 26 penerbangan dan jadwal waktu keberangkatan serta waktu kedatangan dari setiap penerbangan. Jika penerbangan terjadi dari terminal keberangkatan kota awal menuju terminal kedatangan kota tujuan, dengan integer programming tersebut akan diperoleh waktu keberangkatan dan waktu kedatangan yang meminimumkan biaya penundaan.

scholarly journals A mixed-integer linear programming model for harvesting, loading and transporting sugarcane. A case study in Peru

DYNA ◽  
2016 ◽  
Vol 83 (195) ◽  
pp. 173-179 ◽  
Author(s):  
Marcela María Morales-Chávez ◽  
José A. Soto-Mejía ◽  
William Ariel Sarache
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Programming Model ◽  
Raw Material ◽  
Linear Programming Model ◽  
Mixed Integer ◽  
Production Plant ◽  
Integer Linear Programming Model ◽  
The Cost

Due to opportunities for economic and social development in the biofuels market, improvement to the supply chain has become a relevant matter. In agro-industrial supply chains, procurement costs are highly relevant. Since sugarcane is a high performance raw material for ethanol production, this paper proposes a Mixed-Integer Linear Programming Model for cost optimization for harvesting, loading and transportation operations. The model determines the quantity of machines and workers to meet the biofuel plant requirements. Costs of resources for harvesting and loading as well as transportation costs from the land parcel to the production plant are minimized. Also, the model calculates the cost of penalties for shortages (unmet demand) and the cost of equipment idle time. The implementation of the model in a Peruvian biofuels company, showed a cost reduction of around 11 % when compared to the current costs.

scholarly journals Penggunaan Metode Branch and Bound dan Gomory Cut dalam Menentukan Solusi Integer Linear Programming

SAINTIFIK ◽  
2017 ◽  
Vol 2 (1) ◽  
pp. 9-15
Author(s):  
Wahyudin Nur ◽  
Nurul Mukhlisah Abdal
Keyword(s):  
Linear Programming ◽  
Integer Programming ◽  
Branch And Bound ◽  
Integer Linear Programming ◽  
Gomory Cut

Integer Linear Programming adalah sebuah model matematis yang memungkinkan hasil penyelesaian kasus pada Pemrograman Linier berupa bilangan bulat. . Masalah integer linear programming termasuk salah satu bagian riset operasi yang sangat penting karena dalam kehidupan sehari-hari, ada banyak permasalah pemrograman linear yang mengharuskan solusinya integer. Ada beberapa metode untuk menyelesaikan persoalan Integer Programming, tapi yang akan dibahas pada penelitian ini adalah Metode Branch and Bound dan Metode Gomory Cut. Tujuan dari penelitian ini adalah untuk menentukan solusi masalah Integer Linear Programming dan membandingkan hasil yang diperoleh dari Metode Branch and Bound dengan Metode Gomory Cut. Penelitian ini adalah penelitian kepustakaan yang menggunakan berbagai literatur-literatur yang berkaitan dengan topik yang akan diteliti. Hasil penelitian ini menunjukkan solusi yang diperoleh dari metode Branch and Bound samadengan metode Gomory Cut. Dalam pemecahannya metode Branch and Bound memerlukan banyak iterasi simpleks dibanding metode Gomory Cut.Kata kunci: Integer Linear Programming, Metode Branch Bound, Metode Gomory Cut

scholarly journals Maximum likelihood pedigree reconstruction using integer programming

10.29007/sghd ◽  
2018 ◽  
Author(s):  
James Cussens
Keyword(s):  
Linear Programming ◽  
Integer Programming ◽  
Maximum Likelihood ◽  
Programming Problem ◽  
Allele Frequency ◽  
Integer Linear Programming ◽  
Linear Programming Problem ◽  
Pedigree Reconstruction ◽  
Integer Linear Programming Problem ◽  
Family Trees

Pedigrees are `family trees' relating groups of individuals which can usefully be seen as Bayesian networks. The problem of finding a maximum likelihood pedigree from genotypic data is encoded as an integer linear programming problem. Two methods of ensuring that pedigrees are acyclic are considered. Results on obtaining maximum likelihood pedigrees relating 20, 46 and 59 individuals are presented. Running times for larger pedigrees depend strongly on the data used but generally compare well with those in the literature. Solving is particularly fast when allele frequency is uniform.

scholarly journals RetSynth: Solving all optimal retrosynthesis solutions using dynamically constrained integer linear programming

2017 ◽  
Author(s):  
Leanne S. Whitmore ◽  
Ali Pinar ◽  
Anthe George ◽  
Corey M. Hudson
Keyword(s):  
Linear Programming ◽  
Integer Programming ◽  
Metabolic Network ◽  
Integer Linear Programming ◽  
Software Package ◽  
Singular Solution ◽  
Linear Integer Programming ◽  
Pathway Search ◽  
Large Corpus

AbstractMotivationNaive determination of all the optimal pathways to production of a target chemical on an arbitrarily defined chassis organism is computationally intractable. Methods like linear integer programming can provide a singular solution to this problem, but fail to provide all optimal pathways.ResultsHere we present RetSynth, an algorithm for determining all optimal biological retrosynthesis solutions, given a starting biological chassis and target chemical. By dynamically scaling constraints, additional pathway search scales relative to the number of fully independent branches in the optimal pathways, and not relative to the number of reactions in the database or size of the metabolic network. This feature allows all optimal pathways to be determined for a very large number of chemicals and for a large corpus of potential chassis organisms.AvailabilityThis algorithm is distributed as part of the RetSynth software package, under a BSD 2-clause license at https://www.github.com/sandialabs/RetSynth/

scholarly journals An integer programming model for gate assignment problem at airline terminals

2015 ◽  
Vol 11 (2) ◽  
Author(s):  
Chong Kok Chun ◽  
Syarifah Zyurina Nordin
Keyword(s):  
Linear Programming ◽  
Integer Programming ◽  
Integer Linear Programming ◽  
Assignment Problem ◽  
Computational Experiment ◽  
Programming Model ◽  
Computational Experiments ◽  
Walking Distance ◽  
Total Distance ◽  
Gate Assignment

In this paper, we concentrate on a gate assignment problem (GAP) at the airlines terminal. Our problem is to assign an arrival plane to a suitable gate. There are two considerations needed to take. One of its is passenger walking distance from arrival gate to departure gate while another consideration is the transport baggage distance from one gate to another. Our objective is to minimize the total distance between the gates that related to assign the arrival plane to the suitable gates. An integer linear programming (ILP) model is proposed to solve this gate assignment problem. We also conduct a computational experiment using CPLEX 12.1 solver in AIMMS 3.10 software to analyze the performance of the model. Results of the computational experiments are presented. The efficiency of flights assignment is depends on the ratio of the weight for both total passenger traveling distances and total baggage transport distances.

A new ranking function of triangular neutrosophic number and its application in integer programming

2020 ◽  
pp. 82-92
Author(s):  
Sapan Kumar Das ◽  
◽  
◽  
S.A. Edalatpanah
Keyword(s):  
Linear Programming ◽  
Integer Programming ◽  
Integer Linear Programming ◽  
Ranking Function ◽  
Numerical Analyses ◽  
New Model ◽  
The Creation ◽  
Triangular Neutrosophic Numbers ◽  
Neutrosophic Number

Real humankind problems have different sorts of ambiguity in the creation, and amidst them, one of the significant issues in solving the integer linear programming issues. In this commitment, the conception of aggregation of ranking function has been focused on a distinct framework of reference. Here, we build up another framework for neutrosophic integer programming issues having triangular neutrosophic numbers by using the aggregate ranking function. To legitimize the proposed technique, scarcely numerical analyses are given to show the viability of the new model. At long last, conclusions are talked about.

Sign in / Sign up

Export Citation Format

Share Document