Scribd
Upload
10 views2 pages

Simplex Method: Optimal Solution Steps

The document outlines a linear programming problem using the Simplex Method to maximize the objective function z = 4x1 + 3x2 + 6x3 under specific constraints. It details the conversion to standard form, the formation of the initial tableau, and the iterations leading to the optimal solution. The final results indicate x1 = 10, x2 = 0, x3 = 20/3, achieving a maximum value of Z = 80.

Uploaded by

sakibahmad4011
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
10 views2 pages

Simplex Method: Optimal Solution Steps

The document outlines a linear programming problem using the Simplex Method to maximize the objective function z = 4x1 + 3x2 + 6x3 under specific constraints. It details the conversion to standard form, the formation of the initial tableau, and the iterations leading to the optimal solution. The final results indicate x1 = 10, x2 = 0, x3 = 20/3, achieving a maximum value of Z = 80.

Uploaded by

sakibahmad4011
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

Linear Programming - Simplex Method Solution

Simplex Method - Full Solution

Problem Statement:

Maximize: z = 4x1 + 3x2 + 6x3

Subject to:

x1 + x2 + 3x3 <= 30

2x1 + 2x2 + 3x3 <= 40

x1, x2, x3 >= 0

Step 1: Convert to standard form using slack variables s1 and s2:

x1 + x2 + 3x3 + s1 = 30

2x1 + 2x2 + 3x3 + s2 = 40

Objective: z = 4x1 + 3x2 + 6x3 + 0s1 + 0s2

Initial Tableau:

| Basic Var | x1 | x2 | x3 | s1 | s2 | RHS |

|-----------|----|----|----|----|----|-----|

| s1 | 1 | 1 | 3 | 1 | 0 | 30 |

| s2 | 2 | 2 | 3 | 0 | 1 | 40 |

|Z | -4 | -3 | -6 | 0 | 0 | 0 |

Iteration 1:

Entering variable: x3, Leaving variable: s1, Pivot = 3

Updated Tableau:

| Basic Var | x1 | x2 | x3 | s1 | s2 | RHS |

|-----------|-----|-----|----|-----|----|-----|

| x3 |1/3 |1/3 | 1 |1/3 | 0 | 10 |

| s2 | 1 | 1 | 0 | -1 | 1 | 10 |

|Z | -2 | -1 | 0 | 2 | 0 | 60 |
Linear Programming - Simplex Method Solution

Iteration 2:

Entering variable: x1, Leaving variable: s2, Pivot = 1

Updated Tableau:

| Basic Var | x1 | x2 | x3 | s1 | s2 | RHS |

|-----------|----|----|----|-----|----|------|

| x3 | 0 | 0 | 1 |2/3 | 0 | 20/3 |

| x1 | 1 | 1 | 0 | -1 | 1 | 10 |

|Z | 0 | 1 | 0 | 0 | 2 | 80 |

No negative values in the Z row. Optimal solution reached.

Final Solution:

x1 = 10, x2 = 0, x3 = 20/3 (~6.67)

Maximum Z = 80

You might also like