Scribd
Upload
17 views2 pages

Linear Programming

Linear Programming is a method for finding optimal solutions to a linear function within a set of constraints defined by linear inequalities. The process involves sketching the feasible region, identifying its vertices, and evaluating the objective function at these points to determine minimum and maximum values. Examples illustrate how to apply these principles to specific linear functions and constraints.

Uploaded by

ayopjlouisemarie
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
17 views2 pages

Linear Programming

Linear Programming is a method for finding optimal solutions to a linear function within a set of constraints defined by linear inequalities. The process involves sketching the feasible region, identifying its vertices, and evaluating the objective function at these points to determine minimum and maximum values. Examples illustrate how to apply these principles to specific linear functions and constraints.

Uploaded by

ayopjlouisemarie
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/ 2

Linear Programming

Linear Programming - is a way of getting the optimal solutions ( minimum and maximum values) of a
linear function, subject to a system of linear inequalities.

The linear function is called an objective function.

The system is referred to as the constraints of the function.

The solution of the system is called the feasible solution of the problem.

To solve a problem involving linear function P(x,y) with linear programming means to determine the
feasible solutions subject to the constraints . One way of obtaining the optimal solutions is by finding
the corresponding values of P(x,y) at the vertices of the region representing the solutions

Guidelines in Solving a Linear Programming Problem:

1. Sketch the region determined by the system of inequalities.

2. Determine the vertices of the region.

3. Calculate the value of the linear function at each vertex of the region.

4. Select the minimum or maximum value of the linear function in 3.

Example 1. Give the maximum and the minimum values of P(x,y) = 2x – y subject to the following
constraints.

y ≥ 0x ≥
0x + y ≤
4

The vertices of the region are : ( 0, 0 ), ( 4, 0 ) and ( 0, 4 )


Vertex Value of P(x,y) = 2x - y
( 0, 0 ) P ( 0, 0 ) = 2 ( 0 ) – 0 = 0
( 4, 0 ) P ( 4, 0 ) = 2 ( 4 ) - 0 = 8
( 0, 4 ) P ( 0, 4 ) = 2 ( 0 ) - 4 = - 4
Therefore, the minimum value and the maximum value of P (x, y ) = 2x – y, subject
to the given constraints are : -4 and 8, respectively.
Example 2. What is the maximum value of P ( x, y ) = 60x + 70y subject to the following constraints ?

x ≤ 10

y ≤ 7

50x + 20y ≤ 600

X and y are non-negative integers

Vertex Value of P(x, y ) = 60x + 70y


( 0, 0 ) P ( 0, 0 ) = 60 ( 0 ) + 70 ( 0 ) = 0
( 10, 0 ) P ( 10, 0 ) = 60 ( 10 ) + 70 ( 0 ) = 600
( 0, 7 ) P ( 0, 7 ) = 60 ( 0 ) + 70 ( 7 ) = 490
( 10, 5 ) P ( 10, 5 ) = 60 ( 10 ) + 70 ( 5 ) = 950
( 9.2, 7 ) P ( 9.2, 7 ) = 60 ( 9.2 ) + 70 ( 7 ) = 1,042

The value of P ( x, y ) is at its maximum when x = 9.2 and y = 7. Therefore, the maximum
value is 1,042.

The value of P(x,y) is at its minimum when x = 0 and y = 7.Therefore, the minimum value is 490.

You might also like