Determination of optimum values for maximizing the profit in bread production: Daily bakery Sdn Bhd

Nora Muda, Raymond Sim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. An ILP has many applications in industrial production, including job-shop modelling. A possible objective is to maximize the total production, without exceeding the available resources. In some cases, this can be expressed in terms of a linear program, but variables must be constrained to be integer. It concerned with the optimization of a linear function while satisfying a set of linear equality and inequality constraints and restrictions. It has been used to solve optimization problem in many industries area such as banking, nutrition, agriculture, and bakery and so on. The main purpose of this study is to formulate the best combination of all ingredients in producing different type of bread in Daily Bakery in order to gain maximum profit. This study also focuses on the sensitivity analysis due to changing of the profit and the cost of each ingredient. The optimum result obtained from QM software is RM 65,377.29 per day. This study will be benefited for Daily Bakery and also other similar industries. By formulating a combination of all ingredients make up, they can easily know their total profit in producing bread everyday.

Original languageEnglish
Title of host publication2nd ISM International Statistical Conference 2014, ISM 2014
Subtitle of host publicationEmpowering the Applications of Statistical and Mathematical Sciences
EditorsNor Aida Zuraimi Md Noar, Roslinazairimah Zakaria, Wan Nur Syahidah Wan Yusoff, Mohd Sham Mohamad, Mohd Rashid Ab Hamid
PublisherAmerican Institute of Physics Inc.
Pages787-794
Number of pages8
ISBN (Electronic)9780735412811
DOIs
Publication statusPublished - 1 Jan 2015
Event2nd ISM International Statistical Conference 2014: Empowering the Applications of Statistical and Mathematical Sciences, ISM 2014 - Kuantan, Pahang, Malaysia
Duration: 12 Aug 201414 Aug 2014

Publication series

NameAIP Conference Proceedings
Volume1643
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Other

Other2nd ISM International Statistical Conference 2014: Empowering the Applications of Statistical and Mathematical Sciences, ISM 2014
CountryMalaysia
CityKuantan, Pahang
Period12/8/1414/8/14

Fingerprint

integers
ingredients
linear programming
optimization
industries
nutrition
shops
agriculture
sensitivity analysis
programming
constrictions
resources
costs
computer programs

Keywords

  • integer linear programming
  • optimization
  • sensitivity analysis
  • simplex method

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Muda, N., & Sim, R. (2015). Determination of optimum values for maximizing the profit in bread production: Daily bakery Sdn Bhd. In N. A. Z. M. Noar, R. Zakaria, W. N. S. W. Yusoff, M. S. Mohamad, & M. R. A. Hamid (Eds.), 2nd ISM International Statistical Conference 2014, ISM 2014: Empowering the Applications of Statistical and Mathematical Sciences (pp. 787-794). (AIP Conference Proceedings; Vol. 1643). American Institute of Physics Inc.. https://doi.org/10.1063/1.4907528

Determination of optimum values for maximizing the profit in bread production : Daily bakery Sdn Bhd. / Muda, Nora; Sim, Raymond.

2nd ISM International Statistical Conference 2014, ISM 2014: Empowering the Applications of Statistical and Mathematical Sciences. ed. / Nor Aida Zuraimi Md Noar; Roslinazairimah Zakaria; Wan Nur Syahidah Wan Yusoff; Mohd Sham Mohamad; Mohd Rashid Ab Hamid. American Institute of Physics Inc., 2015. p. 787-794 (AIP Conference Proceedings; Vol. 1643).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Muda, N & Sim, R 2015, Determination of optimum values for maximizing the profit in bread production: Daily bakery Sdn Bhd. in NAZM Noar, R Zakaria, WNSW Yusoff, MS Mohamad & MRA Hamid (eds), 2nd ISM International Statistical Conference 2014, ISM 2014: Empowering the Applications of Statistical and Mathematical Sciences. AIP Conference Proceedings, vol. 1643, American Institute of Physics Inc., pp. 787-794, 2nd ISM International Statistical Conference 2014: Empowering the Applications of Statistical and Mathematical Sciences, ISM 2014, Kuantan, Pahang, Malaysia, 12/8/14. https://doi.org/10.1063/1.4907528
Muda N, Sim R. Determination of optimum values for maximizing the profit in bread production: Daily bakery Sdn Bhd. In Noar NAZM, Zakaria R, Yusoff WNSW, Mohamad MS, Hamid MRA, editors, 2nd ISM International Statistical Conference 2014, ISM 2014: Empowering the Applications of Statistical and Mathematical Sciences. American Institute of Physics Inc. 2015. p. 787-794. (AIP Conference Proceedings). https://doi.org/10.1063/1.4907528
Muda, Nora ; Sim, Raymond. / Determination of optimum values for maximizing the profit in bread production : Daily bakery Sdn Bhd. 2nd ISM International Statistical Conference 2014, ISM 2014: Empowering the Applications of Statistical and Mathematical Sciences. editor / Nor Aida Zuraimi Md Noar ; Roslinazairimah Zakaria ; Wan Nur Syahidah Wan Yusoff ; Mohd Sham Mohamad ; Mohd Rashid Ab Hamid. American Institute of Physics Inc., 2015. pp. 787-794 (AIP Conference Proceedings).
@inproceedings{4b381eef2bf34107ae6e8a42a33c289f,
title = "Determination of optimum values for maximizing the profit in bread production: Daily bakery Sdn Bhd",
abstract = "An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. An ILP has many applications in industrial production, including job-shop modelling. A possible objective is to maximize the total production, without exceeding the available resources. In some cases, this can be expressed in terms of a linear program, but variables must be constrained to be integer. It concerned with the optimization of a linear function while satisfying a set of linear equality and inequality constraints and restrictions. It has been used to solve optimization problem in many industries area such as banking, nutrition, agriculture, and bakery and so on. The main purpose of this study is to formulate the best combination of all ingredients in producing different type of bread in Daily Bakery in order to gain maximum profit. This study also focuses on the sensitivity analysis due to changing of the profit and the cost of each ingredient. The optimum result obtained from QM software is RM 65,377.29 per day. This study will be benefited for Daily Bakery and also other similar industries. By formulating a combination of all ingredients make up, they can easily know their total profit in producing bread everyday.",
keywords = "integer linear programming, optimization, sensitivity analysis, simplex method",
author = "Nora Muda and Raymond Sim",
year = "2015",
month = "1",
day = "1",
doi = "10.1063/1.4907528",
language = "English",
series = "AIP Conference Proceedings",
publisher = "American Institute of Physics Inc.",
pages = "787--794",
editor = "Noar, {Nor Aida Zuraimi Md} and Roslinazairimah Zakaria and Yusoff, {Wan Nur Syahidah Wan} and Mohamad, {Mohd Sham} and Hamid, {Mohd Rashid Ab}",
booktitle = "2nd ISM International Statistical Conference 2014, ISM 2014",

}

TY - GEN

T1 - Determination of optimum values for maximizing the profit in bread production

T2 - Daily bakery Sdn Bhd

AU - Muda, Nora

AU - Sim, Raymond

PY - 2015/1/1

Y1 - 2015/1/1

N2 - An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. An ILP has many applications in industrial production, including job-shop modelling. A possible objective is to maximize the total production, without exceeding the available resources. In some cases, this can be expressed in terms of a linear program, but variables must be constrained to be integer. It concerned with the optimization of a linear function while satisfying a set of linear equality and inequality constraints and restrictions. It has been used to solve optimization problem in many industries area such as banking, nutrition, agriculture, and bakery and so on. The main purpose of this study is to formulate the best combination of all ingredients in producing different type of bread in Daily Bakery in order to gain maximum profit. This study also focuses on the sensitivity analysis due to changing of the profit and the cost of each ingredient. The optimum result obtained from QM software is RM 65,377.29 per day. This study will be benefited for Daily Bakery and also other similar industries. By formulating a combination of all ingredients make up, they can easily know their total profit in producing bread everyday.

AB - An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. An ILP has many applications in industrial production, including job-shop modelling. A possible objective is to maximize the total production, without exceeding the available resources. In some cases, this can be expressed in terms of a linear program, but variables must be constrained to be integer. It concerned with the optimization of a linear function while satisfying a set of linear equality and inequality constraints and restrictions. It has been used to solve optimization problem in many industries area such as banking, nutrition, agriculture, and bakery and so on. The main purpose of this study is to formulate the best combination of all ingredients in producing different type of bread in Daily Bakery in order to gain maximum profit. This study also focuses on the sensitivity analysis due to changing of the profit and the cost of each ingredient. The optimum result obtained from QM software is RM 65,377.29 per day. This study will be benefited for Daily Bakery and also other similar industries. By formulating a combination of all ingredients make up, they can easily know their total profit in producing bread everyday.

KW - integer linear programming

KW - optimization

KW - sensitivity analysis

KW - simplex method

UR - http://www.scopus.com/inward/record.url?scp=85063842240&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85063842240&partnerID=8YFLogxK

U2 - 10.1063/1.4907528

DO - 10.1063/1.4907528

M3 - Conference contribution

AN - SCOPUS:85063842240

T3 - AIP Conference Proceedings

SP - 787

EP - 794

BT - 2nd ISM International Statistical Conference 2014, ISM 2014

A2 - Noar, Nor Aida Zuraimi Md

A2 - Zakaria, Roslinazairimah

A2 - Yusoff, Wan Nur Syahidah Wan

A2 - Mohamad, Mohd Sham

A2 - Hamid, Mohd Rashid Ab

PB - American Institute of Physics Inc.

ER -