Professional Documents
Culture Documents
A = C + Bx.
The word 'programming' is just an other word for planning and is concerned with optimal allocation of limited resources.
8/2/12
Basic Terminology
Linear Function
A linear function contains terms each of which is composed of only a single, continuous variable raised to (and only to) the power of 1.
Objective Function
It is a linear function of the decision variables expressing the objective of the decision-maker. The most typical forms of objective functions are: maximize f(x) or minimize f(x).
Decision Variables
These are economic or physical quantities whose numerical values indicate the solution of the linear programming 8/2/12
Constraints
These are linear equations arising out of practical limitations. The mathematical forms of the constraints are: f(x) b or f(x) b or f(x) = b
Feasible Solution
Any non-negative solution which satisfies all the constraints is known as a feasible solution.
Optimal Solution
8/2/12
subject to (constraints) a11x1 + a12x2 + a13x3 + .........+ a1nxn (, , =) b1 a21x1 + a22x2 + a23x3 + .........+ a2nxn (, , =) b2 ................................................................................. .. am1x1 + am2x2 + am3x3 + .........+ amnxn (, , =) bm & (non-negative restrictions)
8/2/12
x1, x2,....., xn 0
Percent Volumes
Lower Upper Limit Limit Grav 5 20 el 65 85 Four sources of materials are in the vicinity of the construction Sand 0 15 site. 9000 cubic yard material is Silt required. The composition and Sources
the unit cost of material deliveredSiltthe site are: Gravel (% )Sand (%) to (%) Cost (Rs./ cu. yd) River Gr. Sea Gr. Sand On Site 15 30 00 05 75 70 100 30
8/2/12
10 00 00 65
60 80 50 00
Solution
Decision Variables: Let the material from River gravel = x1 Let the material from Sea gravel = x2 Let the material from Sand = x3 Let the material on Site = x4 Objective Function: Min. Z = 60 * x1 + 80 * x2 + 50 * x3 + 0 * x4 Constraints: x1 + x2 + x3 + x4 9000 cu.yd (0.15x1 + 0.3x2 + 0.0x3 + 0.05x4)/(x1 + x2 + x3 + x4)*100 5 (0.15x1 + 0.3x2 + 0.0x3 + 0.05x4)/(x1 + x2 + x3 + x4)*100 20 8/2/12 (0.75x1 + 0.7x2 + 1.0x3 + 0.3x4)/(x1 + x2 + x3 + x4)*100
After collecting the information, the traffic engineer noticed that the minimum number of buses needed to meet demand vary with the time of day. He further discovered that the required number of buses can be assumed constant over successive interval of 4 hours each. (as shown in fig.)
8/2/12
It was decided that, to carry out the required daily maintenance, each bus could operate only 8 successive hours day. Chalk out the policy to minimize buses.
12 10 8 6 4 2 0
12:0 0 AM 4:00 AM 8:00 AM 12:0 0 Noo n 4:00 PM 8:00 PM 12:0 0 AM
8/2/12
Solution
12 10 8 6 4 2 0
x 6
x1
x 2
x 3
x 4
x x 6 5
Min. Z = x1 + x2 + x3 + x4 + x5 + x6
12:0 0 AM
4:00 AM
8:00 AM
12:0 0 Noo n
4:00 PM
8:00 PM
12:0 0 AM
0,
x1 0, x2 0, x3 0, x4 x5 0, x6 0
The daily wages of Grade 1 inspectors are Rs. 200/hour while those of Grade 2 inspectors are Rs. 150/hour. Any error made by an inspector costs Rs. 100 to the company. If, there are, in all, 10 Grade 1 and 15 Grade2 inspectors in the company, find the optimal assignment of inspectors that minimizes the daily inspection cost.
8/2/12
Solution
Let x1, x2 be the nos. of Grade 1 and Grade 2 inspectors. Objective function is to minimize the daily cost of inspection which is equal to wages paid to the inspectors + the cost of their inspection error.
Cost of Grade 1 inspector/hr = 200 +(100*0.04*20) = Rs. 280 Cost of Grade 2 inspector/hr = 150+(100*0.08*14) =Rs. 262 Therefore, Z to minimize = 8(280x1+262x2) =2240 x1 + 2096x2 Constraints are x1 10 (Grade 1) and x2 15 (Grade 2)
8/2/12