APPLICATION OF LINEAR PROGRAMMING PROBLEM IN MANUFACTURING OF LOCAL SOAP

Similar documents
Chapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints

Operation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1

IEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2

9.4 THE SIMPLEX METHOD: MINIMIZATION

Linear Programming Notes V Problem Transformations

Simplex method summary

Chapter 2 Solving Linear Programs

Linear Programming. March 14, 2014

Solving Linear Programs

Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS

Nonlinear Programming Methods.S2 Quadratic Programming

Using the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood

3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max

Practical Guide to the Simplex Method of Linear Programming

Linear Programming. Solving LP Models Using MS Excel, 18

Linear Programming I

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method

Standard Form of a Linear Programming Problem

Linear Programming Problems

4.6 Linear Programming duality

1 Solving LPs: The Simplex Algorithm of George Dantzig

LU Factorization Method to Solve Linear Programming Problem

Sensitivity Report in Excel

Special Situations in the Simplex Algorithm

GENERALIZED INTEGER PROGRAMMING

Linear Programming in Matrix Form

LECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005

What is Linear Programming?

Duality in Linear Programming

Schneps, Leila; Colmez, Coralie. Math on Trial : How Numbers Get Used and Abused in the Courtroom. New York, NY, USA: Basic Books, p i.

4 UNIT FOUR: Transportation and Assignment problems

Linear Programming: Theory and Applications

Simulating the Multiple Time-Period Arrival in Yield Management

1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.

Linear Programming. April 12, 2005

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system

Revenue Structure, Objectives of a Firm and. Break-Even Analysis.

Mathematical finance and linear programming (optimization)

Fractions to decimals

Special cases in Transportation Problems

Linear Programming Supplement E

Linear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.

OPRE 6201 : 2. Simplex Method

Approximation Algorithms

Unit 1 Equations, Inequalities, Functions

Chapter 6: Sensitivity Analysis

LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method

3.1 Solving Systems Using Tables and Graphs

How To Understand And Solve A Linear Programming Problem

Here are some examples of combining elements and the operations used:

Solutions Of Some Non-Linear Programming Problems BIJAN KUMAR PATEL. Master of Science in Mathematics. Prof. ANIL KUMAR

Assessing Container Terminal Safety and Security Using Data Envelopment Analysis

Systems of Linear Equations

Linear Programming based Effective Maintenance and Manpower Planning Strategy: A Case Study

Question 2: How do you solve a matrix equation using the matrix inverse?

Lecture 2: August 29. Linear Programming (part I)

7 Gaussian Elimination and LU Factorization

Alabama Department of Postsecondary Education

Linear Programming Notes VII Sensitivity Analysis

Chapter 3: Section 3-3 Solutions of Linear Programming Problems

0.1 Linear Programming

Review on Using Packages to Enhance the Teaching of Critical Path Networks

Can linear programs solve NP-hard problems?

SUBSTITUTING CHORDS. B C D E F# G Row 4 D E F# G A B Row 5

DEA implementation and clustering analysis using the K-Means algorithm

The Assignment Problem and the Hungarian Method

Optimization Modeling for Mining Engineers

Solving Systems of Linear Equations

1 Review of Least Squares Solutions to Overdetermined Systems

Linear Equations ! $ & " % & " 11,750 12,750 13,750% MATHEMATICS LEARNING SERVICE Centre for Learning and Professional Development

Gautam Appa and H. Paul Williams A formula for the solution of DEA models

Lecture 1: Systems of Linear Equations

56:171 Operations Research Midterm Exam Solutions Fall 2001

1.2 Solving a System of Linear Equations

THREE DIMENSIONAL GEOMETRY

A. O. Odior Department of Production Engineering University of Benin, Edo State.

Linearly Independent Sets and Linearly Dependent Sets

Nonlinear Optimization: Algorithms 3: Interior-point methods

MATLAB and Big Data: Illustrative Example

Support Vector Machines

SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION

Sequences. A sequence is a list of numbers, or a pattern, which obeys a rule.

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

The Correlation Coefficient

Study Guide 2 Solutions MATH 111

8.1. Cramer s Rule for Solving Simultaneous Linear Equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

Design of Analytic Hierarchy Process Algorithm and Its Application for Vertical Handover in Cellular Communication

Make sure you look at the reminders or examples before each set of problems to jog your memory! Solve

Assessment Schedule 2013

A Direct Numerical Method for Observability Analysis

Introduction to Matrix Algebra

LINEAR INEQUALITIES. Mathematics is the art of saying many things in many different ways. MAXWELL

Solving Systems of Linear Equations Using Matrices

Multi-variable Calculus and Optimization

Linear Programming. Before studying this supplement you should know or, if necessary, review

Chapter 6: Multivariate Cointegration Analysis

Version 1.0: klm. General Certificate of Education. Mathematics MD02 Decision 2. Mark Scheme examination - January series

SOLVING LINEAR SYSTEMS

Optimal Scheduling for Dependent Details Processing Using MS Excel Solver

Transcription:

Volume, Issue, February ISSN -64 APPLICATION OF LINEAR PROGRAMMING PROBLEM IN MANUFACTURING OF LOCAL SOAP Igbinehi, E.M ', Oyebode Aminat Olaitana and Taofeek-Ibrahim Fatimoh Abidemi, Department of Mathematics and Statistics, School of Applied Science, The Federal Polytechnic, Offa. Kwara state,nigeria. Department of Marketing Kwara State Polytechnic, Ilorin,Kwara State, Nigeria Department of Computer Science School of Applied Science, The Federal Polytechnic Offa Nigeria. ABSTRACT This research Application of Linear Programming in a Local Soap Manufacturing Company was aimed to maximize the profit of the local soap Production. Linear Programming Problem was formulated based on the data collected from the company. From our findings and calculation, we observed that the company spends more on coloured soap and they gets more profit from white soap than coloured soap. We advise that the company should produce less coloured soap and produce more white soap of g and g to maximize thier profit. Keywords: Local, Soap, Coloured, Company, Profit..INTRODUCTION The complexity of today s business operations, the high cost of technology, materials and labour as well as competitive pressure and the shortened time frame in which many important decision must be made contribute to the difficultly of making effective decisions[,}. All this question are very difficult to answer because it depends on so many different economic, social and political factors and view point, very few business decisions are made which are not primarily based on quantitative measures of some nature[,4,]. It must be emphasized however that, timely and competent decision analysis should be an aid to the decision makers judgment, not a substitute for it[6]..algorithms FOR SIMPLE METHOD Step I: If the problem is of minimization, convert it to maximization problem by multiplying the objective function z by (-). Step II: See that all bi s, multiply it by (-) to make bi positive. Step III: Convert all the inequalities to equalities by addition of a slack variables artificial variables or by subtraction of surplus variables as the case may be. Step IV: Find the starting basic feasible solution. Step V: Construct the starting simplex table Step VI: Testing for the optimality of basic feasible solution by computing zj - cj if zj - cj >, the solution is optimal, otherwise, we proceed to the next step. Step VII: To improve on the basic feasible solution we find the IN-COMING VECTOR entering the basic matrix and the OUT-GOING VECTOR to be removed from the basic matrix. The reviable that corresponds to the most negative zj - cj is the IN-COMING VECTOR. while the variable that corresponds to the minimum ratio bi / aj for a particular j and aij > is the OUT-GOING VECTOR. Step VIII: the KEY ELEMENT or the pivot element is determined by considering the intersection between the arrows that correspond to both the in-coming and the out-going vectors. The key element is used to generate the next table in the next table, the pivot element will be replaced by zero. To calculate the new values for all other elements in the remaining rows of the pivot column we use the relation New row = former element in the old row ( intersectional element of the old row) x (corresponding element of replacing row). In this way we get the improved Step I: test this new basic feasible solution not optimal, repeat the process till optimal solution is obtained. Volume, Issue, February Page 6

Volume, Issue, February ISSN -64.METHODOLOGY LINEAR PROGRAMMING PROBLEM FORMULATION Optimize z = cxi + C x C + ---- Cn x n ------ (i) St aii xi + a + ----- ainn * bi ai xi + a + ----- ann * b ai xi + a + ----- ann * b ------------ --(ii) ami xi + am + ----- amnn * bm i,, ----- n > -------- (iii) Where * means = <> and (m<n). 4.DATA COLLECTION Interview method was used to collected data in local soap manufacturing company which manufactures three different types of local soap, g of white soap, g of white soap and g of coloured soap. They uses litres of water of soak litres of the chemical and kgs of caustic soda. There are litres of water, 6 litres of chemical and kg of caustic soda are available to be used. It takes hrs to produce g of white soap, hrs to produce g of white soap and hrs to produce g of coloured soap. It takes a total of hrs for all the three types of soap to be strong and ready for use. They spent N, to produce g of white soap, N, to produce g of white soap and N, to produce g of coloured soap and the budget N, to produce soap every week. They sells three of g of white soap at the rate of N, she also sell three of g of white soap at the rate of N and sells three of g of coloured soap at the rate of N. After the production and the selling, she have the total of N, on g of white soap, she also have the total of N, on g of white soap and she have the total of N, on g of coloured soap. Let represent g of white soap Let represent g of white soap Let represent g of coloured soap No. of soap produced from each different type For = = 98 She produces 98 pieces of g of white soap For = = 9 She produces 9 pieces of g of white soap For = = 9 She produces 9 pieces of g of coloured soap The total no of soap produced =8 Resource Constraint + + 46 + + 98 9 9 =. +. + + + Time Constraint + + Bound Constraint + + Objective Function (Profit) Profit = selling price cost price (cost of production) For = N - N = N, For = N - N = N, For = N - N = N Max Z = N + + 98 9 9 Volume, Issue, February Page

Volume, Issue, February ISSN -64 = 6.6 +. +. + + Max Z= + + S.t + + 46 + + + + Convert to Standard Form Max Z = + + + OS + OS +OS S.t + + + S + OS +OS = 46 + + + OS + S +OS = + + + OS + OS +S = TABLE B V S S S C B S S S B MR 46 46/ / / 46 ( - j BV CB S S - TABLE S S S B MR / - -/ - 4/ / 68 4-68/ / /.. 68 (- j -4 - / - / Volume, Issue, February Page 8

Volume, Issue, February ISSN -64 TABLE BV CB S S S B MR S - 4 -/ - / /6 -/ 488/ 68/ -68/ 6. -68-44. -4 68/ -68/ 488/ -44 9/ (- j 44-9/ TABLE 4 BV CB S S S B / -/ -/ -/ /6 / -/ 44/ 9/ -/ 6. 6. -/ -8/ 6/ (- j - 8/ -6/.CONCLUSION Max Z = + + = [44] + [9] - [] = 8 + 9 4 = 8 + 664 4 = 498 = 66. Max Z = N6,6 From our findings and calculation, we observed that the company spends more on coloured soap due to the palm oil used to produced coloured soap and gets more profit from white soap than coloured soap. We advise that the company should produce less coloured soap and produce more white soap of g and g to maximize her profit. Volume, Issue, February Page 9

Volume, Issue, February ISSN -64 REFERENCES [] Pal Inc (99): Operation Research Techniques Published by Phenum Press New York. [] Gerdness Inc. (99): Quantitative Approaches to Management 8 th edition [] William I. S. & Irwin.S. (99): Introduction to Management Science nd Edition. [4] Vanderbei, R.J 996.gramming: Foundations and Extensions, Kluwer Academic Publishers, Boston, 996. [] Wright S.J. (99): Primal-Dual Interior-Point Methods, Society for Industrial and Applied Mathematics, Philadelphia. [6] Jalaluddin Abdullah, Optimization by the Fixed-Pont Method, Version..[] (http://www.optimizationonline.org/db_html//9/.h Volume, Issue, February Page