Scribd
Upload
79 views6 pages

Question 1 (Part 1)

The document describes solving a linear programming problem to maximize the objective function Z = 5x1 + 7x2 + 4x3 subject to the given constraints. It converts the problem into canonical form by introducing slack variables and then proceeds to solve it using the simplex method. It performs three iterations of the simplex method, identifying the entering and leaving variables each time based on the minimum ratio test until reaching an optimal solution with objective value Max Z = 118.3333.

Uploaded by

Roqaia Alwan
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
79 views6 pages

Question 1 (Part 1)

The document describes solving a linear programming problem to maximize the objective function Z = 5x1 + 7x2 + 4x3 subject to the given constraints. It converts the problem into canonical form by introducing slack variables and then proceeds to solve it using the simplex method. It performs three iterations of the simplex method, identifying the entering and leaving variables each time based on the minimum ratio test until reaching an optimal solution with objective value Max Z = 118.3333.

Uploaded by

Roqaia Alwan
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/ 6

Question 1:

MAX Z = 5x1 + 7x2 + 4x3


subject to
2x1 + 4x2 + 2x3 <= 50
2x1 + 3x2 - x3 <= 30
x1 + 2x2 + 2x3 <= 75
and x1,x2,x3 >= 0

Solution:

Max 
= 5 x1 + 7 x2 + 4 x3
Z
subject to
2 x1 + 4 x2 + 2 x3 ≤ 50
2 x1 + 3 x2 - x3 ≤ 30
x1 + 2 x2 + 2 x3 ≤ 75
and x1,x2,x3≥0;

The problem is converted to canonical form by adding slack, surplus and artificial variables
as appropiate

1. As the constraint-1 is of type '≤' we should add slack variable S1

2. As the constraint-2 is of type '≤' we should add slack variable S2

3. As the constraint-3 is of type '≤' we should add slack variable S3

After introducing slack variables


Max 
= 5 x1 + 7 x2 + 4 x3 + 0 S1 + 0 S2 + 0 S3
Z
subject to
2 x1 + 4 x2 + 2 x3 + S = 50
1

2 x1 + 3 x2 - x3 + S2 = 30

x1 + 2 x2 + 2 x3 + S3 = 75
and x1,x2,x3,S1,S2,S3≥0
Negative minimum Zj-Cj is -7 and its column index is 2. So, the entering variable is x2.

Minimum ratio is 10 and its row index is 2. So, the leaving basis variable is S2.

∴ The pivot element is 3.

Entering =x2, Departing =S2, Key Element =3


Negative minimum WITHj-Cj is -6.3333 and its column index is 3. So, the entering variable is x3.

Minimum ratio is 3 and its row index is 1. So, the leaving basis variable is S1.

∴ The pivot element is 3.3333.

Entering =x3, Departing =S1, Key Element =3.3333


Negative minimum WITHj-Cj is -1.6 and its column index is 1. So, the entering variable is x1.

Minimum ratio is 18.3333 and its row index is 2. So, the leaving basis variable is x2.
∴ The pivot element is 0.6.

Entering =x1, Departing =x2, Key Element =0.6


Since all WITHj-Cj≥0

Hence, optimal solution is arrived with value of variables as :


x1=18.3333,x2=0,x3=6.6667

Max WITH=118.3333

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy