messebo水泥厂的整数线性规划问题

Journal of Progressive Research in Mathematics Pub Date : 2016-09-16 DOI:10.18535/ijetst/v3i12.10

Haftom Gebreanenya

{"title":"messebo水泥厂的整数线性规划问题","authors":"Haftom Gebreanenya","doi":"10.18535/ijetst/v3i12.10","DOIUrl":null,"url":null,"abstract":"To solve integer linear programming problem is very difficult than to solve linear programming problem. In this paper we are going to see the formulation of integer linear programming problem and one of its solution techniques called Branch and Bound method. This paper also contains a real world problem of integer linear programming problem on Messebo Cement Factory (Mekelle, Tigray, Ethiopia) solved using the Branch and Bound method.","PeriodicalId":126811,"journal":{"name":"Journal of Progressive Research in Mathematics","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"INTEGER LINEAR PROGRAMMING PROBLEM IN MESSEBO CEMENT FACTORY\",\"authors\":\"Haftom Gebreanenya\",\"doi\":\"10.18535/ijetst/v3i12.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To solve integer linear programming problem is very difficult than to solve linear programming problem. In this paper we are going to see the formulation of integer linear programming problem and one of its solution techniques called Branch and Bound method. This paper also contains a real world problem of integer linear programming problem on Messebo Cement Factory (Mekelle, Tigray, Ethiopia) solved using the Branch and Bound method.\",\"PeriodicalId\":126811,\"journal\":{\"name\":\"Journal of Progressive Research in Mathematics\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Progressive Research in Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18535/ijetst/v3i12.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Progressive Research in Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18535/ijetst/v3i12.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

求解整数线性规划问题比求解线性规划问题要困难得多。在本文中，我们将看到整数线性规划问题的表述和它的一种求解技术称为分支定界法。本文还包含了Messebo水泥厂(Mekelle, Tigray, Ethiopia)上的整数线性规划问题的一个实际问题，用分支定界法求解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

INTEGER LINEAR PROGRAMMING PROBLEM IN MESSEBO CEMENT FACTORY

To solve integer linear programming problem is very difficult than to solve linear programming problem. In this paper we are going to see the formulation of integer linear programming problem and one of its solution techniques called Branch and Bound method. This paper also contains a real world problem of integer linear programming problem on Messebo Cement Factory (Mekelle, Tigray, Ethiopia) solved using the Branch and Bound method.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Progressive Research in Mathematics

自引率

0.00%

发文量