View stunning SlideShares in full-screen with the new iOS app!Introducing SlideShare for AndroidExplore all your favorite topics in the SlideShare appGet the SlideShare app to Save for Later — even offline
View stunning SlideShares in full-screen with the new Android app!View stunning SlideShares in full-screen with the new iOS app!
2.
Linear : form meant a mathematical expression of the type a 1 x 1 + a 2 x 2 + ……….+ a n x n where a 1 , a 2 , ….., a n are constants, and x 1 , x 2 , ………, x n are variables. Programming : refers to the process of determining a particular program or plan of action . Linear Programming Problem(LPP) : Technique for optimizing(maximizing/minimizing) a linear function of variables called the ‘OBJECTIVE FUNCTION’ subject to a set of linear equations and/or inequalities called the ‘CONSTRAINTS’ or ‘RESTRICTIONS’.
a linear relationship reflecting the objective of an operation
most frequent objective is to maximize profit or to minimize cost .
Decision variables
an unknown quantity representing a decision that needs to be made. It is the quantity the model needs to determine
Constraint
a linear relationship representing a restriction on decision making
5.
Steps in Formulating the LP Problems 1. Define the objective. (min or max) 2. Define the decision variables. 3. Write the mathematical function for the objective. 4. Write the constraints. 5. Constraints can be in < , =, or > form.
6.
Example Two products : Chairs and Tables Decision : How many of each to make this month? Objective : Maximize profit
11.
Model Max 7 T + 5 C Subject to the constraints : 3 T + 4 C < 2400 2 T + 1 C < 1000 C < 450 T > 100 T , C > 0
12.
General Formulation of LPP Max/min z = 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 (≤, =, ≥) b 1 a 21 x 1 + a 22 x 2 + ... + a 2n x n (≤, =, ≥) b 2 : a m1 x 1 + a m2 x 2 + ... + a mn x n (≤, =, ≥) b m x 1 ≥ 0, x 2 ≥ 0,…….x j ≥ 0,……., x n ≥ 0. x j = decision variables b i = constraint levels c j = objective function coefficients a ij = constraint coefficients
13.
Example Cycle Trends is introducing two new lightweight bicycle frames, the Deluxe and the Professional, to be made from aluminum and steel alloys. The anticipated unit profits are $10 for the Deluxe and $15 for the Professional. The number of pounds of each alloy needed per frame is summarized on the next slide. A supplier delivers 100 pounds of the aluminum alloy and 80 pounds of the steel alloy weekly. How many Deluxe and Professional frames should Cycle Trends produce each week?
14.
Example Pounds of each alloy needed per frame Aluminum Alloy Steel Alloy Deluxe 2 3 Professional 4 2
17.
Example A firm manufactures 3 products A, B and C. The profits are Rs.3, Rs.2, and Rs.4 respectively. The firm has 2 machines and below is the required processing time in minutes for each machine on each product. Machine G and H have 2000 and 2500 machine-minutes respectively. The firm must manufacture 100 A’s, 200 B’s and 50 C’s, but not more than 150 A’s. Set up an LP problem to maximize profit. 4 2 2 H 5 3 4 G Machines C B A Product
19.
Solution Max Z = 3x 1 + 2x 2 + 4x 3 Subject To 4x 1 + 3x 2 + 5x 3 ≤ 2000 2x 1 + 2x 2 + 4x 3 ≤ 2500 100 ≤ x 1 ≤ 150 x 2 ≥ 200 x 3 ≥ 50 x 1 , x 2 , x 3 ≥ 0
20.
Example The Sureset Concrete Company produces concrete. Two ingredients in concrete are sand (costs $6 per ton) and gravel (costs $8 per ton). Sand and gravel together must make up exactly 75% of the weight of the concrete. Also, no more than 40% of the concrete can be sand and at least 30% of the concrete be gravel. Each day 2000 tons of concrete are produced. To minimize costs, how many tons of gravel and sand should be purchased each day?
Views
Actions
Embeds 0
Report content