Scribd
Upload
49 views

Maximization Problem by Simplex Method

The document describes the 8 steps of the Simplex method to solve a maximization problem: 1) Set up the objective function and constraints, 2) Convert inequalities to equations with slack variables, 3) Construct the initial simplex tableau, 4) Identify the pivot column with the most negative entry, 5) Calculate quotients to identify the pivot row, 6) Perform pivoting to make other entries in the pivot column zero, 7) Repeat steps 4-6 until no negative entries remain, 8) Read off the answers with the maximum value in the bottom right corner. It provides an example problem to find a solution using the Simplex Method.

Uploaded by

Muhammad Aman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
49 views

Maximization Problem by Simplex Method

The document describes the 8 steps of the Simplex method to solve a maximization problem: 1) Set up the objective function and constraints, 2) Convert inequalities to equations with slack variables, 3) Construct the initial simplex tableau, 4) Identify the pivot column with the most negative entry, 5) Calculate quotients to identify the pivot row, 6) Perform pivoting to make other entries in the pivot column zero, 7) Repeat steps 4-6 until no negative entries remain, 8) Read off the answers with the maximum value in the bottom right corner. It provides an example problem to find a solution using the Simplex Method.

Uploaded by

Muhammad Aman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Department of Computer Science –UOK

Operation Research
Course Supervisor: Dr. Shaista Rais

Maximization problem by Simplex method


Steps to perform the Simplex method:
1. Set up the problem. That is, write the objective function and the inequality constraints.
2. Convert the inequalities into equations. This is done by adding one slack variable for
each inequality.
3. Construct the initial simplex tableau. Write the objective function as the bottom row.
4. The most negative entry in the bottom row identifies the pivot column.
5. Calculate the quotients. The smallest quotient identifies a row. The element in the
intersection of the column identified in step 4 and the row identified in this step is
identified as the pivot element. The quotients are computed by dividing the far right
column by the identified column in step 4. A quotient that is a zero, or a negative number, or
that has a zero in the denominator, is ignored.
6. Perform pivoting to make all other entries in this column zero. This is done the same
way as we did with the Gauss-Jordan method.
7. When there are no more negative entries in the bottom row, we are finished;
otherwise, we start again from step 4.
8. Read off your answers. Get the variables using the columns with 1 and 0s. All other
variables are zero. The maximum value you are looking for appears in the bottom right hand
corner.

Question: Find a solution using the Simplex Method:


Department of Computer Science –UOK
Operation Research
Course Supervisor: Dr. Shaista Rais
Department of Computer Science –UOK
Operation Research
Course Supervisor: Dr. Shaista Rais
Department of Computer Science –UOK
Operation Research
Course Supervisor: Dr. Shaista Rais
Department of Computer Science –UOK
Operation Research
Course Supervisor: Dr. Shaista Rais
Department of Computer Science –UOK
Operation Research
Course Supervisor: Dr. Shaista Rais

Z = 18.6585

You might also like