simplex method - linear programming

Question 1

it requires that all constraints be expressed as equations

Answer 1

simplex method

Question 2

it is an iterative technique that begins with a feasible solution that is not optimal, but serves as a starting point

Answer 2

simplex method

Question 3

define
standard form:
slack variable:
surplus variable:
artificial variable:

Answer 3

standard form: is the way the problem is expressed mathematically

slack variable: convert “less than or equal to” constraints into equations by adding a non negative variable

surplus variable: convert “greater than or equal to” constraints into equations by subtracting a non-negative variable

artificial variable: temporary variables used to find an initial basic feasible solution when one does not exist naturally (=)

these variables help convert the original problem into a form that can be solved using the simplex method, which is an iterative algorithm for finding the optimal solution to a linear programming problem

Question 4

it is a table use to keep track of the calculations made when the simplex method is employed.

Answer 4

simplex tableau

Question 5

right hand side -
basic variables -

Answer 5

right hand side - the column in the simplex tableau indicating the quantities of the variables is in a solution

basic variables - variable include in a basic solution

Question 6

it is a simplex method which consists of the sequence of steps (row operations) performed in moving one basic feasible solution to another.

Answer 6

iteration