Scribd
Upload
7 views12 pages

Day-3 MAT-485

The document outlines the classification of solutions in linear programming, including feasible solutions, basic solutions, and basic feasible solutions. It provides examples of bounded and unbounded feasible regions, as well as exercises to formulate and solve linear programming problems. Additionally, it discusses the graphical method for identifying optimal solutions at the vertices of the feasible region.

Uploaded by

sudipto.supto
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
7 views12 pages

Day-3 MAT-485

The document outlines the classification of solutions in linear programming, including feasible solutions, basic solutions, and basic feasible solutions. It provides examples of bounded and unbounded feasible regions, as well as exercises to formulate and solve linear programming problems. Additionally, it discusses the graphical method for identifying optimal solutions at the vertices of the feasible region.

Uploaded by

sudipto.supto
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/ 12

DAY-3

To do:

(1) Classification of Solutions

(2) Classification of Feasible Regions

Solution: Values of the decision variables 𝑥𝑗 (𝑗 = 1, 2, 3, … , 𝑛) which satisfy the constraints of the linear
programming problem (LPP) is called the solution to the LPP.

Feasible Solution: Any solution that also satisfies the non-negativity restrictions of the general LPP is
called a feasible solution.

Basic Solution: For a set of 𝑚 simultaneous equations in 𝑛 unknowns (𝑛 > 𝑚), a solution obtained by
setting (𝑛 − 𝑚) of the variables equal to zero and solving the remaining 𝑚 equations in 𝑚 unknowns is
called a basic solution. Basic solutions are the corner points of a feasible region.

Basic Feasible Solution: A basic solution is called a basic feasible solution if it satisfies the non-negativity
restriction, i.e., if all the basic variables are non-negative.

Example 4:
(A) Feasible Region is bounded

Example: 1

Example: 2
(B) Feasible Region is unbounded

Example: 3

Example: 4
(C) Infinitely many optimal solutions [Alternative solutions]

Example: 5

(D) NO Feasible Region

Example: 6
Practice Exercises:
Graphical Method:
The Graphical Method is limited in solving LP problems having one or two decision variables. However, it
provides a clear illustration of where the feasible and non-feasible regions are, as well as, vertices. If a
linear program has a non-empty, bounded feasible region, then the optimal solution is always one of the
vertices of its feasible region (a corner point). Therefore, what is needed to be done is to find all the
intersection points (vertices) and then examine which one among all feasible vertices, provides the
optimal solution.
𝐴 = (0, 5), 𝐵 = (0, 4), 𝐶 = (2, 3)

Objective function: Maximize 𝑧 = 2𝑥1 − 𝑥2

If 𝑧 (𝑥1 , 𝑥2 ) = 2𝑥1 − 𝑥2 , then

𝑧 (𝐴) = 𝑧(0, 5) = −5

𝑧 (𝐵) = 𝑧(0, 4) = −4

𝑧 (𝐶 ) = 𝑧(2, 3) = 1. Hence, the optimal solution is given at 𝐶 = (2, 3), and the maximum value is 1.
Example: A company wishes to schedule the product of a kitchen appliance that requires two resources:

labor and raw materials. The company is considering three different types of products (A, B, C). To produce

one unit of product A, it requires 7 hours of labor and 4 pounds of raw materials. To produce one unit of

product B, it requires 3 hours of labor and 4 pounds of raw materials. To produce one unit of product C,

it requires 6 hours of labor and 5 pounds of raw materials. Profit from each unit of product A is Tk. 4. Profit

from each unit of product B is Tk. 2. Profit from each unit of product C is Tk. 3. The supply of raw materials

is restricted to 200 pounds per day. The daily availability of labor is 150 hours.

Formulate an LP model to determine the daily production rate of the various types of products in order

to maximize the total profit.

The formulated LP is as follows:

Mazimize 𝑍 = 4𝑥1 + 2𝑥2 + 3𝑥3

Subject to the constraints 7𝑥1 + 3𝑥2 + 6𝑥3 ≤ 150

4𝑥1 + 4𝑥2 + 5𝑥3 ≤ 200

𝑥1 , 𝑥2 , 𝑥3 ≥ 0
Feasible Region:

Collection of all feasible solution is called a feasible region. This is a convex set.
Exercise: 1

Maximize 𝑧 = −4𝑥1 + 3𝑥2

Subject to 𝑥1 − 𝑥2 ≤ 0

𝑥1 ≤4

𝑥1 , 𝑥2 ≥ 0

Exercise: Show that the following LPP is infeasible.

Exercise: 3 Consider the LPP:

Mazimize 𝑍 = 4𝑥1 + 2𝑥2 + 3𝑥3

Subject to the constraints 7𝑥1 + 3𝑥2 + 6𝑥3 ≤ 150

4𝑥1 + 4𝑥2 + 5𝑥3 ≤ 200

𝑥1 , 𝑥2 , 𝑥3 ≥ 0

Answer the following questions:


(i) Write the LPP in standard form
(ii) Find all basic solutions.
(iii) Find all basic feasible solutions
(iv) Find, if any, all degenerate solutions
(v) Find non-degenerate solutions
(vi) Find the optimal solution, if 𝑥1 is a non-basic variable [value of a non-basic variable is zero]

You might also like