Scribd
Upload
2 views4 pages

Lecture 05 - Multiple Optimal Solutions and Redundant Constraints

The document discusses multiple optimal solutions in linear programming, providing an example where the objective function Z = x1 + 2x2 has multiple optimal points along a line representing the constraint x1 + 2x2 = 160. It also explains redundant constraints, illustrating with an example how certain constraints do not affect the feasible region of the solution. The document emphasizes the identification of critical constraints that define the feasible region and the redundancy of others that do not impact it.

Uploaded by

118 Sahiba Nawaz
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
2 views4 pages

Lecture 05 - Multiple Optimal Solutions and Redundant Constraints

The document discusses multiple optimal solutions in linear programming, providing an example where the objective function Z = x1 + 2x2 has multiple optimal points along a line representing the constraint x1 + 2x2 = 160. It also explains redundant constraints, illustrating with an example how certain constraints do not affect the feasible region of the solution. The document emphasizes the identification of critical constraints that define the feasible region and the redundancy of others that do not impact it.

Uploaded by

118 Sahiba Nawaz
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/ 4

MULTIPLE OPTIMAL SOLUTIONS AND REDUNDANT CONSTRAINTS

ALONG WITH EXAMPLES

TABLE OF CONTENTS

MULTIPLE OPTIMAL SOLUTIONS ........................................................................................2

REDUNDANT CONSTRAINTS ................................................................................................ 4

1|Page
MULTIPLE OPTIMAL SOLUTIONS
Example:
Maximize Z = x1 + 2x2
Subject to

x1≤ 80
x2≤ 60
5x1 + 6x2 ≤600
x1+ 2x2 ≤ 160
x1, x2 ≥ 0.

Solution:
Step 1:Conversion of Inequality-constraints into equality constraints, we have the following set of
constraints

x1 = 80
x2 = 60
5x1 + 6x2 = 600
x1+ 2x2 = 160

Step2: Drawing lines for constraints

1. Drawing line for Constraint1 i:e; x1 =80


 Since there is no X2, therefore, a line at 80 on X-axis to infinity on Y-axis will be drawn to
represent the constraint1.

2. Drawing line for Constraint 2 i:e; x2 =60


 Since there is no X1, therefore, a line at 60 on Y-axis to infinity on X-axis will be drawn to
represent the constraint2.

3. Drawing line for Constraint 3 i:e; 5x1 + 6x2 = 600


 If only x1 and no x2 is produced, the maximum value of x1 is 600/5 = 120. (120, 0).
 If only x2 and no x1 is produced, the maximum value of x2is 600/6 = 100. (0,100).

Thus, a line drawn between these two points (120, 0) & (0, 100), represents the above
constraint3.

2|Page
4. Drawing line for Constraint 4 i:e; x1 + 2x2 = 160
 If only x1 and no x2 is produced, the maximum value of x1 is 160/1 = 160. (160, 0).
 If only x2 and no x1 is produced, the maximum value of x2is 160/2 = 80. (0, 80).

Thus, a line drawn between these two points (160, 0) & (0, 80), represents the above constraint4.

All points from P to Q lying on line PQ represent optimal solutions and all these willgive the same
optimal value (maximum profit) of Rs. 160. This is indicated by the factthat both the points P with co-
ordinates (40, 60) and Q with co-ordinates (60, 50) are onthe line x1 + 2x2 = 160. Thus, every point on
the line PQ maximizes the value of theobjective function and the problem has multiple optimal
solutions.

3|Page
REDUNDANT CONSTRAINTS
Example:

Maximize 1170x1 + 1110x2

Subject to

9x1 + 5x2 ≥ 500


7x1 + 9x2 ≥ 300
5x1 + 3x2 ≤ 1500
7x1 + 9x2 ≤ 1900
2x1 + 4x2 ≤ 1000
x1, x2 ≥ 0
The feasible region is indicated in the following figure:

The critical region has been formed by the two constraints.

9x1 + 5x2 ≥ 500

7x1 + 9x2 ≤ 1900

x1, x2 ≥ 0

The remaining three constraints are not affecting the feasible region in any manner. Such constraints
are called redundant constraints.

4|Page

You might also like