{"id":7767,"date":"2022-04-20T09:37:57","date_gmt":"2022-04-20T04:07:57","guid":{"rendered":"https:\/\/www.goseeko.com\/blog\/?p=7767"},"modified":"2025-10-27T22:33:49","modified_gmt":"2025-10-27T17:03:49","slug":"what-is-simplex-method","status":"publish","type":"post","link":"https:\/\/www.goseeko.com\/blog\/what-is-simplex-method\/","title":{"rendered":"What is simplex method?"},"content":{"rendered":"\n

The simplex method is one of the most powerful and popular linear programming methods. The simplex method is an iterative procedure to get the most viable solution. This method keeps transforming the values   of the fundamental variables to get the maximum value of the objective function.<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

Linear programming functions are in standard form when trying to maximize the objective function. Subject to constraints,<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n
\"\"<\/figure>\n\n\n\n
\"\"<\/figure>\n\n\n\n

Here and after adding the Slack variable, the system of corresponding constraint equations Where,<\/p>\n\n\n\n

S1, s2\u2026\u2026\u2026\u2026sm is called a slack variable. These are non-negative numbers that are added to remove the inequality from the equation.<\/p>\n\n\n\n

Solved example-1<\/h2>\n\n\n\n

Example: Maximize-<\/strong><\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n

Subject to-<\/strong><\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

By using simplex method.<\/strong><\/p>\n\n\n\n

Solution<\/strong><\/p>\n\n\n\n

Here we have<\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n

And  the inequalities-<\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n

By adding s1 and s2 we get-<\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n

Putting decision variables equals to zero, we get-<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n
\"\"<\/figure>\n\n\n\n

Since the coefficient (\u20133) of  x3 is most negative, so x<\/em>3 is an entering variable.<\/p>\n\n\n\n

The smallest ratio is 1 in the s<\/em>2-row, therefore s<\/em>2 is the departing variable. The pivot entry (2) is at the intersection of x<\/em>3-column and s<\/em>2-row.<\/p>\n\n\n\n

To make pivot entry (1), we multiply third row by \u00bd, we get-<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

Applying, we get<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

Since, Z row of the table has non-negative entries in the column of variables, therefore, this is the case of optimal solution. From the last column of the table we have x1 = 0, x2 = 0 and x3 = 1 and the maximum value of Z = 3.<\/p>\n\n\n\n

Solved example-2<\/h2>\n\n\n\n

Solve a product-mix problem for which the values of ?1 and ?2 that<\/p>\n\n\n\n

Maximize: ? = 3?1 +2?2<\/p>\n\n\n\n

Subject to: \u2212?1 + 2?2 \u2264 4<\/p>\n\n\n\n

3?1 + 2?2 \u2264 14<\/p>\n\n\n\n

?1 \u2212 ?2 \u2264 3<\/p>\n\n\n\n

?1 \u2265 0 , ?2 \u2265 0<\/p>\n\n\n\n

Sol:<\/p>\n\n\n\n

The solution process to maximize first introduce the slack variables ?1 , ?2 ??? ?3 . Hence<\/p>\n\n\n\n

????????: ? = 3?1 + 2?2 +0. ?1 +0. ?2 + 0. ?3<\/p>\n\n\n\n

We get<\/p>\n\n\n\n

?1 + 2?2 +?1 +0. ?2 + 0. ?3 = 4<\/p>\n\n\n\n

3?1 +2?2 + 0. ?1 +?2 +0. ?3 = 14<\/p>\n\n\n\n

?1 \u2212 ?2 + 0. ?1 + 0. ?2 + ?3 = 3<\/p>\n\n\n\n

?1 , ?2 , ?1 , ?2 , ?3 \u2265 0<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

From the table the pivot element is 1 hence the pivot column is the first column and the pivot row is the third row because of the most negative number on that column and least positive ratio respectively.<\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n
\"\"<\/figure>\n\n\n\n

Here again the second column is the pivot column and the second row is also pivot row.<\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n
\"\"<\/figure>\n\n\n\n

If the value of ?? \u2212 (contribution of unit price to the profit) are all positive or zero, the current basic feasible solution is optimal. But there values one or more negative choose the variable corresponding to which the value of ?? \u2212 ?? is least i.e most negative.<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

Hence the optimal solution will be-<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

And Max. Z = 14<\/p>\n\n\n\n

Interested in learning about similar topics? Here are a few hand-picked blogs for you!<\/strong><\/p>\n\n\n\n