Scribd
Upload
1K views

Linear Programming Problem: Basic Requirements

Linear programming is a technique for optimizing a linear objective function subject to linear constraints. It involves identifying variables, constraints, and the objective function; expressing these mathematically; and determining the optimal values of the variables. The document provides examples of linear programming problems involving production scheduling, ingredient mixing to minimize cost, and toy manufacturing to maximize profit. It also outlines the basic steps, requirements, assumptions, and definitions of linear programming.

Uploaded by

Nusrat Jahan Moon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
1K views

Linear Programming Problem: Basic Requirements

Linear programming is a technique for optimizing a linear objective function subject to linear constraints. It involves identifying variables, constraints, and the objective function; expressing these mathematically; and determining the optimal values of the variables. The document provides examples of linear programming problems involving production scheduling, ingredient mixing to minimize cost, and toy manufacturing to maximize profit. It also outlines the basic steps, requirements, assumptions, and definitions of linear programming.

Uploaded by

Nusrat Jahan Moon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Linear Programming Problem

Linear programming is a mathematical technique for determining the optimum allocation of


resources and obtaining a particular objective when there are alternative uses of resources:
money, manpower, material, machine and other facilities.

The objective in resources allocation may be cost minimization or inversely profit maximization.
The technique of linear programming is applicable to problem in which the total effectiveness
can be expressed as a linear function of individual allocations and the limitations on resources
give rise to linear equalities or inequalities of the individual allocations.

LP is a mathematical way of planning, which involves three steps:

1) Identify the objective function as a linear function of its variables and state all the
limitations on resources as linear equation or inequalities.
2) Use the mathematical techniques to find all possible sets of values of the variables,
satisfying the constraints.
3) Select the particular set of values of the variables obtained in (2) that lead to our objective
maximum profit least cost etc.

Basic Requirements:
1. Decision variables and their relationship.
2. Well defined objective function
3. Presence of constraints or restrictions
4. Quantitative measurement of problem element.
5. Alternative course of action
6. Non negative restrictions
7. Linearity

Basic Assumptions:
1. Proportionality
We assume that proportionality exists in the objective and constraints. For example, if we
want to double the output we simply double the required resources.

2. Additivity
It means that sum of the resources used by the different activities must be equal to the
total quantity of resources used by each activity for all the resources individually and
collectively.
3. Divisibility
This assumption implies that solution need not to be whole numbers. Instead they are
divisible and may take any fractional value.

4. Certainty
The coefficients in the objective function and constraints are completely known and do
not change during the period being studied.

5. Finiteness
An optimum solution cannot be computed in the situation where there are an infinite
number of alternative activities and resource restrictions.

6. Optimality

In the linear programming problem, the maximum profit solution or the minimum cost
solution always occurs at a corner point of the set of feasible solutions.

Standard form of LPP:


Suppose a LPP involve the determination of the values of n decision variables
x 1 , x 2 … … … … … …. x n such that the linear objective function of these variables assumes an
optimum value when these variables are subject to set of m constraints which are also linear
functions of the variables.

Optimize

Z=C1 X 1 +C 2 X 2 + … … … … ….+C n X n

Subject to the linear constraints

a 11 x 1 +a12 x 2 +… … … … … … a1 n x n ( ≤ ,=≥ ) b 1

a m 1 x 1+ am 2 x2 +… … … … … … amn x n ( ≤,=≥ ) bn

Where,

x 1 , x 2 … … … … … …. x n ≥ 0
Where,

1) x 1 , x 2 … … … … … …. x n are decision variables


2) C 1 , C2 , … … … … … C n are called the cost or profit coefficients
3) a ij (i=1,2 , … … 3 , j=1,2 , … … … n) are called structural coefficient
4) b 1, b2 … …. b n represents requirements or availability
5) The expression (≤ ,=≥) means that each constraints may take only one of the three
possible forms
6) x j ≥ 0 simply implies x j ’s are non negative.

Formulation of LPP:
Step 1:

Find the key decision to be made from the study of the problem. In this connection looking for
variables helps considerably.

Step 2:

Identify the variables and assign symbols x 1 , x 2 … … … … … …. x n for variable quantities noticed
in step 1.

Step 3:

State the feasible alternative which generally in a given situation is:

{( x 1 , x 2) Ι x 1 ≥ 0 , x 2 ≥ 0}

Step 4:

Identify the constraints or restrictions in the problem and express them as linear equations or
inequalities which are linear functions of the unknown variable

Step 5:

Identify the objective function which is to be optimized and represent it as a linear function in
terms of unknown variable.

Some Definitions:
1. Solution:
Values of decision variables x j which satisfy the constraints of general LPP is called the
solution of that LPP
2. Feasible Solution:
Any solution that also satisfies the no negative restrictions of the general LPP is called a
feasible solution.

3. Basic Solution:
For a set of m simultaneous equations in n unknowns (n>m) a solution obtained by
setting (n-m) of the variables equal to zero and solving the remaining m equations in m
unknowns is called a basic solutions. Zero variables (n-m) are called non basic variables
and remaining m are called basic variables and constitute a basic solutions.

4. Basic Feasible Solution:


A feasible solution to a general LPP which is also basic solution is called a basic feasible
solution.

5. Optimum Feasible Solution:


Any basic feasible solution which optimizes or minimizes the objective function of a LPP
is known as an optimum feasible solution to that LPP.

6. Degenerate Solution:
A basic solution to the system of equations is called degenerate if one or more of the
basic variables become equal to zero.

Problem:

A firm makes two types of furniture, chairs and tables. The contribution for each product as
calculated by the accounting department is Tk. 20 per chair and Tk. 30 per table. Both the
products are processed on three machines M1,M2,M3. The time required (in hours) by each
product and total time available per week on each machine are as follows:

Chai Available hours


Machine Table
r per week
M1 3 3 36
M2 5 2 50
M3 2 6 60
How should the manufacturer schedule his production in order to maximize profit?
Problem:

An animal feed company must produce 200 Ibs of a mixture containing the ingredients X1 and
X2. X1 costs TK. 3 per Ibs and X2 cost TK. 8 per Ibs. Not more than 80Ibs. of X1 can be used
and a minimum quantity to be used for X2 is 60 Ibs. Find how much of each ingredient should be
used if the company wants to minimize the cost.

Problem

A toy manufacturer produces two types of dolls; a basic version doll A and a deluxe version doll
B. Each doll of type B takes twice as long to produce as one doll of type A. The companies
have time to make a maximum of 2000 dolls. The supply of plastic is sufficient to produce 1500
dolls per day and each type requires equal amount of it. The deluxe version i.e., type B requires a
fancy dress of which there are only 600 per day available. If the company makes a profit of TK.
30 and TK.50 per doll respectively on doll A and doll B; how many of each should be produced
per day in order to maximize profit?

You might also like