Linear Programming Problems

© All Rights Reserved

58 views

Linear Programming Problems

© All Rights Reserved

- Chapt 2 Cell Chem
- Linear Programming Problems
- Chapter 6
- Financial Management 11e Ch05
- Physical Science - Ch 11 Notes
- Physical Science - Ch 11
- Taylor Chapter 6 Transportation
- Raven Biology Cell Chemistry Exam I
- Physical Science - Ch 8
- Cell Membrane Quiz 3
- 66112438X_2
- Material Science Question Bank
- Quiz 2 - Microeconomics Pindyck and Rubinfeld MCQ questions
- ps1_eco110
- 0073524999 Business Law
- Turban Decision Support and Business Intelligence Systems 9e
- Chap 001 test bank
- Cell Membrane Review Quiz-10
- Material Requirements Planning (MRP) and ERP
- Linear Programming

You are on page 1of 55

Linear Programming is a mathematical technique for optimum allocation of limited or scarce resources,

so on , to several competing activities such as products, services, jobs and so on, on the basis of a given criteria of optimality.

Linear Programming Problems - Formulation The term Linear is used to describe the proportionate

relationship of two or more variables in a model. The given change in one variable will always cause a resulting proportional change in another variable.

planning that involves the economic allocation of limited resources by adopting a particular course of action or strategy among various alternatives strategies to achieve the desired objective.

Structure of Linear Programming model The general structure of the Linear Programming

of three components. i) The activities (variables) and their relationships ii) The objective function and iii) The constraints

i) The activities are represented by X1, X2, X3 ..Xn. These are known as Decision variables. ii) The objective function of an LPP (Linear

representation of the objective in terms a measurable quantity such as profit, cost, revenue, etc.

Where Z is the measure of performance variable X1, X2, X3, X4..Xn are the decision variables

contribution to decision variables. iii) Constraints are the set of linear inequalities and/or equalities which impose restriction of the limited resources

Subject to constraints, a11X1+ a 12X2++ a 1nXn (<,=,>) b1 a21X1+ a 22X2++ a 2nXn (<,=,>) b2 a31X1+ a 32X2++ a 3nXn (<,=,>) b3

and X1, X2 .Xn > 0

Guidelines for formulating Linear Programming model i) Identify and define the decision variable of the problem

iii) State the constraints to which the objective function should be optimized (i.e. either Maximization or Minimization) iv) Add the non-negative constraints from the consideration that the negative values of the decision

Certainty In all LP models it is assumed that, all the model parameters such as availability of resources, profit (or cost) contribution of a unit of decision variable and consumption of resources by a unit of decision variable must be known with certainty and constant. Divisibility (Continuity) The solution values of decision variables and resources are assumed to have either whole numbers (integers) or mixed numbers (integer or fractional). However, if only integer variables are desired, then Integer programming method may be employed.

Additivity The value of the objective function for the given value of decision variables and the total sum of resources used, must be equal to the sum of the contributions (Profit or Cost) earned from each decision variable and sum of the resources used by each decision variable

individual contributions of the different variables Linearity All relationships in the LP model (i.e. in both objective function and constraints) must be linear.

contains 6 units of vitamin A and 3 units of vitamin B. 1 unit of F1 and F2 cost Rs. 4 and Rs. 5 respectively. The minimum daily requirement (for a person) of vitamin A and vitamin B is 80 and 100 units. Assuming that anything in excess of the daily minimum requirement of vitamin A and vitamin B is harmful, find out the optimum mixture of foods F1 and F2 at minimum cost which meets the daily requirement of vitamin A and B. Formulate this as L. P. P.

Solution: The given data is expressed in the form of table as: Food Vitamins (No. unit of food) A F1 F2 Min. requirement 3 6 80 B 4 3 100 4 5 cost of food

1. The problem is to find the quantities of foods F1 and F2 so as to meet the minimum requirement of vitamins A and B.

Let X1 the quantity (number of units) of F1 required X2 the quantity (number of units) of F2 required 3. Objective function: The objective is to minimize the cost of the food. Now, the cost of x1 unit of food F1 is ( x1* per unit cost = 4x1). Similarly cost of x2 unit of food F2 is ( x2* per unit cost = 5x2). Hence the total cost is ( 4x1 + 5x2 =C (say)). Hence the objective

4. Constraints: a) First constraint: The minimum requirement of vitamin A is 80 units. The number of units of vitamin A contained in X1 unit of

(3X1). Similarly number of units of vitamin A contained in X2 unit of food F2 are ( X2 * number of units of A contained in I unit of F2) i. e. (6X2). Thus the total intake of vitamin A will be ( 3X1 + 6X2) which must be at least 80 units. 3X1 + 6X2 80 ..(1) (vitamin A constraint)

c) Since number of units of X1 and X2 cannot be negative, hence X1, X2 0 (non negativity condition)

5. Thus the LPP format will be Minimize C = 4X1 + 5X2 Subject to 3X1 + 6X2 80 (vitamin A constraint) 4X1 + 3X2 100 (vitamin B constraint X1, X2 0 (non negativity condition)

Example 1

A city hospital has the following minimal daily requirements for nurses.

Period 1 2 3 4

nurses required

2 7 15 8

5 6

20 6

Nurses report at the hospital at the beginning of each period and work for 8 consecutive hours. The hospital wants to determine the minimal number of nurses to be employed so that there will be a sufficient number of nurses available for each period. Formulate this as a linear programming problem by setting up appropriate constraints and

objective function.

i) Identify and define the decision variable of the problem Let X1, X2, X3, X4, X5 and X6 be the number of nurses joining duty at the beginning of periods 1, 2, 3, 4, 5

and 6 respectively.

ii) Define the objective function Minimize Z = X1 + X2 + X3 + X4 + X5 + X6

function is subjected to following constraints. X1 + X2 7 X2 + X3 15 X3 + X4 8 X4 + X5 20

X5 + X6 6

X6 + X1 2 X1, X2, X3, X4, X5, X6 0

Linear Programming: Graphical Solution Example 2. Solve the following LPP by graphical method Maximize Z = 5X1 + 3X2

Subject to constraints

2X1 + X2 1000 X1 400 X1 700 X1, X2 0

Solution:

The first constraint 2X1 + X2 1000 can be represented as follows. We set 2X1 + X2 = 1000 When X1 = 0 in the above constraint, we get, 2 x 0 + X2 = 1000 X2 = 1000 Similarly when X2 = 0 in the above constraint, we get, 2X1 + 0 = 1000 X1 = 1000/2 = 500

The second constraint X1 400 can be represented as follows, We set X1 = 400 The third constraint X2 700 can be represented as follows, We set X2 = 700

Point 0

X1 0

X2 0

Z = 5X1 +3X2 0

A

B C D

0

150 400 400

700

700 200 0

Z = 5 x 0 + 3 x 700 = 2,100

Z = 5 x 150 + 3 x 700 = 2,850* Maximum Z = 5 x 400 + 3 x 200 = 2,600 Z = 5 x 400 + 3 x 0 = 2,000

Example 3 Solve the following LPP by graphical method Maximize Z = 400X1 + 200X2

Subject to constraints

18X1 + 3X2 800 9X1 + 4X2 600

X2 150

X1, X2 0

Solution:

represented as follows. We set 18X1 + 3X2 = 800 When X1 = 0 in the above constraint, we get, 18 x 0 + 3X2 = 800 X2 = 800/3 = 266.67

Similarly when X2 = 0 in the above constraint, we get, 18X1 + 3 x 0 = 800 X1 = 800/18 = 44.44

represented as follows, We set 9X1 + 4X2 = 600 When X1 = 0 in the above constraint, we get, 9 x 0 + 4X2 = 600

X2 = 600/4 = 150

X1 = 600/9 = 66.67

9X1 + 4 x 0 = 600 The third constraint X2 150 can be represented as follows, We set X2 = 150

Point 0 A B C

X1 0 0 31.11 44.44

X2 0 150 80 0

Z = 400X1 + 200X2

0 Z = 400 x 0+ 200 x 150 = 30,000* Maximum Z = 400 x 31.1 + 200 x 80 = 28,444.4 Z = 400 x 44.44 + 200 x 0 = 17,777.8

Example 4

Solve the following LPP by graphical method Minimize Z = 20X1 + 40X2

Subject to constraints

36X1 + 6X2 108 3X1 + 12X2 36 20X1 + 10X2 100 X1 , X2 0

Solution: The first constraint 36X1 + 6X2 108 can be represented as follows. We set 36X1 + 6X2 = 108

36 x 0 + 6X2 = 108 X2 = 108/6 = 18

Similarly when X2 = 0 in the above constraint, we get, 36X1 + 6 x 0 = 108 X1 = 108/36 = 3 The second constraint 3X1 + 12X2 36 can be represented as follows,

get, 3X1 + 12 x 0 = 36

X1 = 36/3 = 12

represented as follows, We set 20X1 + 10X2 = 100 When X1 = 0 in the above constraint, we get, 20 x 0 + 10X2 = 100

X2 = 100/10 = 10

20X1 + 10 x 0 = 100 X1 = 100/20 = 5

Point 0 A B C D

X1 0 0 2 4 12

X2 0 18 6 2 0

Z = 20X1 + 40X2

0 Z = 20 x 0 + 40 x 18 = 720 Z = 20 x2 + 40 x 6 = 280 Z = 20 x 4 + 40 x 2 = 160* Minimum Z = 20 x 12 + 40 x 0 = 240

Subject to constraints X1 20,000 X2 40,000 0.003X1 + 0.001X2 66

X1 + X2 45,000

X1, X2 0

Solution: The first constraint X1 20,000 can be represented as follows. We set X1 = 20,000 The second constraint X2 40,000 can be represented as follows,

We set X2 = 40,000

The third constraint 0.003X1 + 0.001X2 66 can be represented as follows, We set 0.003X1 + 0.001X2 = 66

0.003 x 0 + 0.001X2 = 66 X2 = 66/0.001 = 66,000 Similarly when X2 = 0 in the above constraint, we get, 0.003X1 + 0.001 x 0 = 66 X1 = 66/0.003 = 22,000

The fourth constraint X1 + X2 45,000 can be represented as follows, We set X1 + X2 = 45,000 When X1 = 0 in the above constraint, we get, 0 + X2 = 45,000

X2 = 45,000

Similarly when X2 = 0 in the above constraint, we get, X1 + 0 = 45,000 X1 =45,000

Point 0 A

X1 0 0

X2 0 40,000

Z = 2.80X1 + 2.20X2 0 Z = 2.80 x 0 + 2.20 x 40,000 = 88,000 Z = 2.80 x 5,000 + 2.20 x 40,000 = 1,02,000 Z = 2.80 x 10,500 + 2.20 x 34,500 = 1,05,300* Maximum Z = 2.80 x 20,000 + 2.20 x 6,000 = 69,200 Z = 2.80 x 20,000 + 2.20 x 0 = 56,000

B

C D E

5,000

10,500 20,000 20,000

40,000

34,500 6,000 0

Z = 1,05,300

Example 6

Solve the following LPP by graphical method Maximize Z = 10X1 + 8X2 Subject to constraints 2X1 + X2 20

X1 + 3X2 30

X1 - 2X2 -15 X1 X2 0

Solution:

The first constraint 2X1 + X2 20 can be represented as follows. We set 2X1 + X2 = 20 When X1 = 0 in the above constraint, we get,

2 x 0 + X2 = 20

X2 = 20

X1 = 20/2 = 10

The second constraint X1 + 3X2 30 can be represented as follows, We set X1 + 3X2 = 30

X1 + 3 x 0 = 30 X1 = 30

The third constraint X1 - 2X2 -15 can be represented as follows, We set X1 - 2X2 = -15 When X1 = 0 in the above constraint, we get,

0 - 2X2 = -15

X2 = -15/2 = 7.5 Similarly when X2 = 0 in the above constraint, we get, X1 2 x 0 = -15 X1 = -15

Point 0 A

X1 0 0

X2 0 7.5

Z = 10X1 + 8X2

0 Z = 10 x 0 + 8 x 7.5 = 60 Z = 10 x 3 + 8 x 9 = 102 Z = 10 x 6 + 8 x 8 = 124* Minimum Z = 10 x 10 + 8 x 0 = 100

B

C D

3

6 10

9

8 0

When X1 = 6 and X2 = 8

Z = 124

- Chapt 2 Cell ChemUploaded bytwinman42
- Linear Programming ProblemsUploaded byRajab Ali Jiwani
- Chapter 6Uploaded byANONY121
- Financial Management 11e Ch05Uploaded bywhoismonir
- Physical Science - Ch 11 NotesUploaded bysuhughes
- Physical Science - Ch 11Uploaded bysuhughes
- Taylor Chapter 6 TransportationUploaded byAinnz Abiggaill
- Raven Biology Cell Chemistry Exam IUploaded bytwinman42
- Physical Science - Ch 8Uploaded bysuhughes
- Cell Membrane Quiz 3Uploaded bytwinman42
- 66112438X_2Uploaded byZayd Ahmed
- Material Science Question BankUploaded bySirish Chand Putla
- Quiz 2 - Microeconomics Pindyck and Rubinfeld MCQ questionsUploaded byanusha500
- ps1_eco110Uploaded byChitrakalpa Sen
- 0073524999 Business LawUploaded byRômulo Santos
- Turban Decision Support and Business Intelligence Systems 9eUploaded byws00738744
- Chap 001 test bankUploaded byAnonymous 7CxwuBUJz3
- Cell Membrane Review Quiz-10Uploaded bytwinman42
- Material Requirements Planning (MRP) and ERPUploaded byGOWTAM1_MARADA
- Linear ProgrammingUploaded byBehbehlynn
- Review Quiz Unit Chapter 6Uploaded bytwinman42
- Quiz 5 - Microeconomics Pindyck and Rubinfeld MCQ questionsUploaded byanusha500
- Linear ProgrammingUploaded byKannan Govindan
- Business Analytics by James Evans TOCUploaded byArchie
- Turban Dss9e Im Ch02Uploaded byjennytan897033
- Ch 9 ReviewUploaded bynhampson
- Chapter 1 Foundations of Information Systems in BusinessUploaded byDenda Sandika
- Chapter 5 Water and SolutionUploaded byMei Shan Siow
- ps3_eco110Uploaded byAj Guanzon

- 100 Marks Project.Uploaded bybhavika303
- 1Uploaded byJagannath Padhi
- Cover Letter SampleUploaded byJagannath Padhi
- Research Forum.Uploaded byJagannath Padhi
- Csr PrsentationUploaded byAvinash Jagtap
- MBA Project Titles.docxUploaded byArun Kumar
- Ratio Wipro EditUploaded byJagannath Padhi
- Ratio EditUploaded byJagannath Padhi
- Xrobbins Eob10 Basic Ppt Ch01Uploaded bywhatme23
- Pfb17 Week5 PresentationUploaded byJagannath Padhi
- PersonalityUploaded bywolverine42100
- LearningUploaded byJagannath Padhi
- Robin sharmaUploaded byJagannath Padhi
- Fiscal PolicyUploaded byJagannath Padhi
- Balance of PaymentsUploaded byJagannath Padhi

- Ekistics QuestionsUploaded byAshwin Kanodia
- A Genetic Algorithm for Resource-Constrained SchedulingUploaded byHenne Popenne
- Thesis LFC in Two Area System Siddhahast MohapatraUploaded bybyrmcncz
- A Cost Optimization-based Design of Precast Concrete Floors Using Genetic AlgorithmsUploaded byRajesh Ranjan
- Simulation.docxUploaded byarunasagar_2011
- Book1Uploaded byNiraj Bhansali
- ENSAYOS EXPERIMENTALES DE IDENTIFICACIÓN MODAL PARA LA PROTECCIÓN SISMICA DEL PATRIMONIO HISTÓRICO DE TIERRAUploaded byzerlopez
- Telecom OpticUploaded byasif ali
- Black hole_ A new heuristic optimization approach.pdfUploaded byAlvaro Gómez Rubio
- chiranshuUploaded byShubham Jain
- Albers - Types of Functional Relationships...Uploaded byknoedel_n
- remotesensing-08-00666Uploaded bymk@metack.com
- ToolboxUploaded bymrloadmovie
- Blend ExpertUploaded byMohammed Alkhafaji
- OmniSim BrochureUploaded bycchee_long
- SPE920 What is Reservoir Engineering[1]Uploaded byJulio Duarte
- Decision-Making in Chemical Engineering ProblemsUploaded byAmir Mosavi
- Assignment on Simplx MethodUploaded byArnab Shyamal
- 8 Inventory ManagementUploaded byDeepak Mishra
- CST Whitepaper Reflector Antenna SystemUploaded byManoj Kumar
- Automatic Breast Ultrasound Image Segmentation: A SurveyUploaded byMia Amalia
- Jensen_DecisionRightsUploaded byrg_200
- SALBP Data SetsUploaded byFabián Esteban Díaz Núñez
- Analysis of Truss-cable StructuresUploaded byKtk Zad
- Lagrange Multipliers on Banach SpacesUploaded byAndrea Spencer
- Optimal Sitting and Sizing of Capacitor Using Iterative Search Method for Enhancement of Reliability of Distribution SystemUploaded byDrVikas Singh Bhadoria
- AMPLE an Adaptive Traffic Engineering System Based on Virtual Routing TopologiesUploaded byheresenthil
- Energy Efficient Cooperative HAP-Terrestrial Communication SystemsUploaded byShital Joshi
- 15.Cutter Location Data Optimization in 5 Axis Surface MachiningUploaded byNalla Paiyan
- Automated Correlation Simulation and Experiment AirbagUploaded bybryan84