Linear Programming Technique for Cotton Mixing

Slides:



Advertisements
Similar presentations
Thank you and welcome Linear Programming (LP) Modeling Application in manufacturing And marketing By M. Dadfar, PhD.
Advertisements

Chapter 8: The Solver and Mathematical Programming Spreadsheet-Based Decision Support Systems Prof. Name Position (123) University.
Optimization problems using excel solver
Using Solver to solve a minimization LP + interpretation of output BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12.
Chapter 5: Linear Programming: The Simplex Method
Lecture 3 Linear Programming: Tutorial Simplex Method
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Planning with Linear Programming
Linear Programming Problem
Session II – Introduction to Linear Programming
Transportation, Assignment, and Transshipment Problems
Chapter 2: Modeling with Linear Programming & sensitivity analysis
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
LINEAR PROGRAMMING SIMPLEX METHOD
Managerial Decision Modeling with Spreadsheets
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Chapter 6 Linear Programming: The Simplex Method
AN INTERACTIVE POSSIBILISTIC LINEAR PROGRAMMING APPROACH FOR MULTIPLE OBJECTIVE TRANSPORTATION PROBLEMS Dr. Celal Hakan Kagnicioglu, Assistant Anadolu.
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
5.6 Maximization and Minimization with Mixed Problem Constraints
D Nagesh Kumar, IIScOptimization Methods: M7L1 1 Integer Programming All Integer Linear Programming.
D Nagesh Kumar, IIScOptimization Methods: M3L1 1 Linear Programming Preliminaries.
Solving Linear Programming Problems Using Excel Ken S. Li Southeastern Louisiana University.
Chapter 4 - Linear Programming: Computer Solution Excel Solver
Product Mix Problem Monet company makes four types of frames.
Quantitative Methods of Management
Chapter 4: Modeling and Analysis
Introduction to Management Science
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
Simplex Algorithm.Big M Method
CDAE Class 11 Oct. 3 Last class: Result of Quiz 2 2. Review of economic and business concepts Today: Result of Quiz 2 3. Linear programming and applications.
Linear Programming Introduction: Linear programming(LP) is a mathematical optimization technique. By “Optimization” technique we mean a method which attempts.
MBAA 607- Operations Analysis & Decision Support Systems Spring 2008 Tuesday 4:25-7:05 Dr. Linda Leon.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis D Nagesh Kumar, IISc Optimization Methods: M3L5.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
1 1 Slide © 2005 Thomson/South-Western MANAGMENT SCIENCE n Chapter 1: Introduction Problem solving and decision making; quantitative analysis and decision.
Column Generation By Soumitra Pal Under the guidance of Prof. A. G. Ranade.
CDAE Class 12 Oct. 4 Last class: 2. Review of economic and business concepts Today: 3. Linear programming and applications Quiz 3 (sections 2.5 and.
LINEAR PROGRAMMING.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
(i) Preliminaries D Nagesh Kumar, IISc Water Resources Planning and Management: M3L1 Linear Programming and Applications.
Linear Programming (LP) Problems MAX (or MIN): c 1 X 1 + c 2 X 2 + … + c n X n Subject to:a 11 X 1 + a 12 X 2 + … + a 1n X n
LINEAR PROGRAMMING Classic Types of Constrained Decision Problems 1. Product Mix 2. Ingredient Mix 3. Transportation 4. Assignment 5. Time Period.
Business Mathematics MTH-367 Lecture 14. Last Lecture Summary: Finished Sec and Sec.10.3 Alternative Optimal Solutions No Feasible Solution and.
1 Simplex algorithm. 2 The Aim of Linear Programming A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear.
Operations Research.  Operations Research (OR) aims to having the optimization solution for some administrative problems, such as transportation, decision-making,
Linear Programming Applications
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Prediction of real life phenomena For model to be reliable, model validation is necessary Judgement, Experience Model Simplify Real World Is performance,
Linear Programming Models: Graphical and Computer Methods
An Introduction to Linear Programming
Operations Research Chapter one.
Linear Programming for Solving the DSS Problems
Transportation Networks CIVE 744
Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis D Nagesh Kumar, IISc Optimization Methods: M3L5.
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
Importance of Producing Mature Cotton Fibers
Linear programming Simplex method.
MBA 651 Quantitative Methods for Decision Making
The Transportation Problem: An Introduction
OUTLINE Questions? Midterm Results Go over Midterm Go over Homework
Sensitivity Analysis and
Linear Programming I: Simplex method
INFM 718A / LBSC 705 Information For Decision Making
Linear programming Simplex method.
Operations Research.
Presentation transcript:

Linear Programming Technique for Cotton Mixing Pavani Harsha MB 30 - Quantitative Methods in Decisions Prof.Jaideep Naidu

Acknowledgements Prof. Jaideep Naidu, Philadelphia University LPT for Cotton Mixing Acknowledgements Prof. Jaideep Naidu, Philadelphia University Mr. Thavasi Vijayakumar, Spinning Manager, Pt. Gokak, Indonesia

Introduction: LPT for Cotton Mixing Quantitative methods used in Textile industry: Linear programming technique - Cotton mixing - Scheduling Forecasting in apparel industry - Seasonal Forecasting Inventory control – Various production stages CPM/ PERT - two or more simultaneous projects on time Transportation technique – Raw materials & finished goods

LPT for Cotton Mixing: LPT for Cotton Mixing Why is cotton mixed? Balancing Cost and Quality Achieve best quality yarn at lowest production Cost Why cotton quality varies? Natural fiber Uneven and non-uniform How are Cost & Quality related? As Quality increases cost increases

Is Cotton Cost a big factor? Around 60 % of total production cost LPT for Cotton Mixing Is Cotton Cost a big factor? Around 60 % of total production cost http://www.cottoninc.com/EFSConference/homepage.cfm?page=1099

Properties of Raw Materials that affect the final product: LPT for Cotton Mixing Properties of Raw Materials that affect the final product: Length Strength Maturity Coefficient Fineness – Micronaire Why is LPT used? Minimize Total cost Maximize quality

Formulation of LPT model: LPT for Cotton Mixing Formulation of LPT model: Let C1, C2, C3,….Cn be the costs of ‘n’ cottons P1, P2, P3,…..Pn be the Percentages of each cotton to be mixed L1, L2, L3,….Ln be the lengths of each cotton S1, S2, S3,….Sn be the strengths of each cotton M1, M2, M3,….Mn be the maturity coefficients of each cotton F1, F2, F3,….Fn be the micronaire value of each cotton

Objective Function: S.T. Constraints LPT for Cotton Mixing Min Z = (C1*P1) + (C2*P2) + (C3*P3) + … + (Cn*Pn) S.T. Constraints L1*P1 + L2*P2 + L3*P3 + … + Ln*Pn  Lr S1*P1 + S2*P2 + S3*P3 + … + Sn*Pn  Sr M1*P1 + M2*P2 + M3*P3 + … + Mn*Pn  Mr F1*P1 + F2*P2 + F3*P3 + … + Fn*Pn  Fr P1 + P2 + P3 + … + Pn = 1 P1, P2, P3,….. Pn  0 Right Hand Side values are obtained from given set of Norms

Example: Aim: Required properties for the raw material: LPT for Cotton Mixing Example: Aim: To manufacture 10 Tex cotton yarn Required properties for the raw material: Length: 31.5mm – 34mm Strength: 20gpt – 23gpt Maturity Coefficient: 80% - 83% Micronaire Value: 3.6 – 3.9 The values shown above are examples and do not represent any cottons as such.

Maturity Coefficient (%) LPT for Cotton Mixing Properties of Cottons available and their Costs: Properties Cottons Norms 1 2 3 Length (mm) Strength (gpt) Maturity Coefficient (%) Micronaire 33 24 83 3.5 31 20.5 80.2 3.85 30 19 79.8 3.9 32 21.5 82 3.7 Cost per lb (US $) 2.05 1.70 1.66 The values shown above are examples and do not represent any cottons as such.

Non-Negativity Constraints: P1, P2, P3  0 LPT for Cotton Mixing Objective Function: Min Z = (2.05*P1) + (1.70*P2) + (1.66*P3) S.T. Constraints: 33*P1 + 31*P2 + 30*P3  32 24*P1 + 20.5*P2 + 19*P3  21.5 0.83*P1 + 0.802*P2 + 0.798*P3  0.82 3.5*P1 + 3.85*P2 + 3.9*P3  3.7 P1 + P2 + P3 = 1 Non-Negativity Constraints: P1, P2, P3  0 P1, P2, P3 values are obtained by solving this LP Model using SIMPLEX method (Microsoft Excel can be used)

Percentage to be Mixed (%) LPT for Cotton Mixing Results: Objective Function Value: Min Z = 1.925 Cotton Percentage to be Mixed (%) 1 64.3 2 35.7 3 Conclusion: LPT can be efficiently used in cotton mixing LPT eliminates wastage of raw materials and hence reduces the total Production Cost.