Simplex Method for BLENDING OF AGGREGATES The contract specifications of a building project require that the course aggregate grading for concrete mixing.

Slides:



Advertisements
Similar presentations
Bus 480 – Lecture 2 Transportation and Assignment models
Advertisements

Outline LP formulation of minimal cost flow problem
Transportation simplex method. B1B2B3B4 R R R Balanced?
Transportation Problem and Related Topics. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics There are 3 plants, 3 warehouses.
Linear Programming Models & Case Studies
1 Transportation Problems Transportation is considered as a “special case” of LP Reasons? –it can be formulated using LP technique so is its solution (to.
AGGREGATES There are two types of aggregates Coarse Aggregates
Asphalt Rubber Related Specifications Arizona Department of Transportation.
Linear Programming Introduction George B Dantzig developed LP in It is a problem solving approach designed to help managers/decision makers in planning.
Linear Programming Example 5 Transportation Problem.
Linear Programming Applications
Linear Programming Applications
Lesson 5 Method of Weighted Residuals. Classical Solution Technique The fundamental problem in calculus of variations is to obtain a function f(x) such.
Concrete Mix Design Technician School
Concrete Dry Quantities examples in class Week 3.
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Student Objectives: * You should know what the instructor expects from you to final grade You should be able to assess your level of knowledge for this.
Weber’s Model Tutorial Start This is a cost map showing the total transport cost. End.
Duality Theory  Every LP problem (called the ‘Primal’) has associated with another problem called the ‘Dual’.  The ‘Dual’ problem is an LP defined directly.
Linear Programming Introduction: Linear programming(LP) is a mathematical optimization technique. By “Optimization” technique we mean a method which attempts.
1 The first thing to be considered when testing aggregate quality is the Size Number. This number regulates which set of sieves will be used to sieve the.
Revision Linear Optimisation. A miller can buy wheat from three suppliers: Airey Farm, Berry Farm and Cherry Farm. In each case the wheat is contaminated.
DISTRIBUTION AND NETWORK MODELS (1/2)
Location decisions are strategic decisions. The reasons for location decisions Growth –Expand existing facilities –Add new facilities Production Cost.
D Nagesh Kumar, IIScOptimization Methods: M4L4 1 Linear Programming Applications Structural & Water Resources Problems.
1 What is Optimization The Optimization Problem is: Find values of the variables that minimize or maximize the objective function while satisfying the.
Business Mathematics MTH-367 Lecture 13. Chapter 10 Linear Programming An Introduction Continued…
D Nagesh Kumar, IIScOptimization Methods: M6L5 1 Dynamic Programming Applications Capacity Expansion.
Linear Programming Ex1) Use the system of constraints below to maximize the objective function z = -0.4x + 3.2y. Corner Points.
Business Mathematics MTH-367 Lecture 16. Chapter 11 The Simplex and Computer Solutions Methods continued.
Transportation and Distribution Planning Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Techologies.
LINEAR PROGRAMMING. Linear Programming Linear programming is a mathematical technique. This technique is applied for choosing the best alternative from.
Introduction Operations Research (OR) It is a scientific approach to determine the optimum (best) solution to a decision problem under the restriction.
QUALITY CONTROL TESTS FOR VARIOUS LAYERS OF FLEXIBLE PAVEMENTS
DCS-1 PPT Submitted By- Amandeep Singh Roll No
Submitted By- Amandeep Singh Roll No
Timetable Problem solving using Graph Coloring
Pretest Question: Three identical metal balls L, M and N initially have charge 4 C, -2 C and 0 C, respectively, as shown below. What is the charge on.
SEMINAR ON TRANSPORTATION PROBLEM
CONCRETE MIX DESIGN.
Engineering Economics (2+0)
Applications of Linear Programming
Stat 261 Two phase method.
The Use of Polystyrene as Substitute of Sand in Pontoon Concrete
Special Cases In Linear Programming
Network Simplex Animations
NAME: OLUWATOSIN UTHMAN ZUBAIR (145919) COURSE: NETWORK FLOW
6.5 Stochastic Prog. and Benders’ decomposition
Department of Civil Engineering Sethu Institute of Technology
Presentation by Team 2.
Copyright © Cengage Learning. All rights reserved.
Why network models? Visualize a mathematical model
CALCULATING A GRADE POINT AVERAGE
Putting it all together
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
Copyright © Cengage Learning. All rights reserved.
Fabric form concrete and paraweb system
PGT(MATHS), ZIET,MUMBAI
CONCRETE MIX DESIGN PRACTICE OF ETHIOPIA AND ITS APPLICATION ON CONSTRUCTION SITES Presented by: Adiamseged Eyassu WORKSHOP ON CONCRETE CONSTRUCTION PRACTICES.
Chapter 7: Systems of Equations and Inequalities; Matrices
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
Copyright © 2019 Pearson Education, Inc.
10.8 Linear Programming.
6.5 Stochastic Prog. and Benders’ decomposition
LINGO LAB 3.
LINGO LAB 3/4.
Problem Constraints of the Form 
Case 2:( Model Construction):
Presentation transcript:

Simplex Method for BLENDING OF AGGREGATES The contract specifications of a building project require that the course aggregate grading for concrete mixing must be within the following limits: Sieve Size (mm)% passing by Weight

BLENDING OF AGGREGATES The contractor has four quarry sites to supply aggregates. These aggregates, however, do not individually satisfy the above specifications requirement. The aggregate grading from each of quarry sites is shown below: Sieve Size (mm) % passing by Weight Quarry 1Quarry 2Quarry 3Quarry Transportation cost per tonne

BLENDING OF AGGREGATES The contractor needs to prepare 150 tonnes of aggregates for concrete mixing in the next two days. How should he obtain the aggregates from the quarry sites so that after blending them the aggregates will satisfy the specifications?

Solution Let X1, X2, X3 and X4 be the number of tonnes of aggregates supplied from quarry sites 1, 2, 3 and 4 respectively. The objective function: Minimize P = 12X1 + 14X2 + 10X3 + 11X4

Solution

Solution

Solution

Solution The constraints for demand: X1+ X2 + X3 + X4 = 150 Also, X1, X2,X3, x4 ≥ 0 The solution for this model is given below: Total minimum costs = 1, X1 = tonnes X2 = tonnes X3 = tonnes X4 = tonnes