Scribd
Upload
3 views6 pages

Linear Programming-1

Linear programming is a method for optimizing resource allocation under linear constraints and objectives. It involves formulating real-world problems into mathematical models to find the best outcomes, applicable in various fields such as production management and military applications. Despite its advantages, linear programming has limitations, including non-linear constraints, integer solution issues, and the assumption of constant parameters.

Uploaded by

wamayimark3
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views6 pages

Linear Programming-1

Linear programming is a method for optimizing resource allocation under linear constraints and objectives. It involves formulating real-world problems into mathematical models to find the best outcomes, applicable in various fields such as production management and military applications. Despite its advantages, linear programming has limitations, including non-linear constraints, integer solution issues, and the assumption of constant parameters.

Uploaded by

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

LINEAR PROGRAMMING

Linear programming can be defined as: "A method to allocate scarce resources to
competing activities in an optimal manner when the problem can be expressed using a
linear objective function and linear inequality constraints." ... Formulation is the process of
translating a real-world problem into a linear program.
Linear programming is used for obtaining the most optimal solution for a problem with
given constraints. In linear programming, we formulate our real-life problem into a
mathematical model. It involves an objective function, linear inequalities with subject to
constraints.

Linear programming is the process of taking various linear inequalities relating to some
situation, and finding the "best" value obtainable under those conditions. A typical example
would be taking the limitations of materials and labor, and then determining the "best"
production levels for maximal profits under those conditions.

In "real life", linear programming is part of a very important area of mathematics called
"optimization techniques". This field of study (or at least the applied results of it) are used
every day in the organization and allocation of resources. These "real life" systems can have
dozens or hundreds of variables, or more. In algebra, though, you'll only work with the
simple (and graphable) two-variable linear case.

The general process for solving linear-programming exercises is to graph the inequalities
(called the "constraints") to form a walled-off area on the x,y-plane (called the "feasibility
region"). Then you figure out the coordinates of the corners of this feasibility region (that
is, you find the intersection points of the various pairs of lines), and test these corner points
in the formula (called the "optimization equation") for which you're trying to find the
highest or lowest value.

Applications of Linear Programming

1. Personnel Assignment Problem


2. Transportation Problem
3. Efficiency on Operation of system of Dams
4. Optimum Estimation of Executive Compensation
5. Agriculture Applications
6. Military Applications
7. Production Management
8. Marketing Management
9. Manpower Management
10. Physical distribution
Advantages of Linear Programming Techniques

1. It helps us in making the optimum utilization of productive resources.


2. The quality of decisions may also be improved by linear programming techniques.
3. Provides practically solutions.
4. In production processes, high lighting of bottlenecks is the most significant
advantage of this technique.

Limitations of Linear Programming


Some limitations are associated with linear programming techniques
1. In some problems, objective functions and constraints are not linear. Generally, in
real life situations concerning business and industrial problems constraints are not
linearly treated to variables.
2. There is no guarantee of getting integer valued solutions. For example, in finding out
how many men and machines would be required to perform a particular job,
rounding off the solution to the nearest integer will not give an optimal solution.
Integer programming deals with such problems.
3. Linear programming model does not take into consideration the effect of time and
uncertainty. Thus the model should be defined in such a way that any change due to
internal as well as external factors can be incorporated.
4. Sometimes large scale problems cannot be solved with linear programming
techniques even when the computer facility is available. Such difficulty may be
removed by decomposing the main problem into several small problems and then
solving them separately.
5. Parameters appearing in the model are assumed to be constant. But, in real life
situations they are neither constant nor deterministic.
6. Linear programming deals with only single objective, whereas in real life situation
problems come across with multi objectives. Goal programming and multi-objective
programming deals with such problems.
Formulation of LP Problems

Example 1

A firm manufactures two types of products A and B and sells them at a profit of Rs. 2 on
type A and Rs. 3 on type B. Each product is processed on two machines G and H. Type A
requires 1 minute of processing time on G and 2 minutes on H; type B requires 1 minute on
G and 1 minute on H. The machine G is available for not more than 6 hours 40 minutes
while machine H is available for 10 hours during any working day. Formulate the problem
as a linear programming problem.

Solution

Let

𝑥1 be the number of products of type A

𝑥1 be the number of products of type B

After understanding the problem, the given information can be systematically arranged in
the form of the following table.
Example 3

Exercise 1
A company has 3 operational departments weaving, processing and packing with the
capacity to produce 3 different types of clothes that are suiting, shirting and woolen
yielding with the profit of Rs. 2, Rs. 4 and Rs. 3 per meters respectively. 1m suiting requires
3mins in weaving 2 mins in processing and 1 min in packing. Similarly, 1m of shirting
requires 4 mins in weaving 1 min in processing and 3 mins in packing while 1m of woolen
requires 3 mins in each department. In a week total run time of each department is 60, 40
and 80 hours for weaving, processing and packing department respectively. Formulate a
LPP to find the product to maximize the profit.
Exercise 2
IUEA wants to know the number of lecture rooms to hire for her BBA and BHRM students. BBA requires
30 lecture hours while BHRM 20 lecture hours. BBA requires 5 assessment hours and BHRM 10
assessment hours. The total number of hours available for lecturing and assessment are 600 and 200
respectively. The university makes a profit of Ugx 500,000 for every class of BBA and Ugx 200,000 for
every class of BHRM. (15 marks)

i. Develop the objective function of this project


ii. Define the non-negativity functions of this project
iii. State the two constraints associated with this project
iv. Using a graph, determine the feasible region for this project
v. To maximize profits, what is the optimal number of lecture rooms for BBA and BHRM
respectively?

You might also like