Scribd
Upload
100 views11 pages

CAED101 - JucoMartinCarlo - Quiz 2

Uploaded by

Martin Carlo A. Juco
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
100 views11 pages

CAED101 - JucoMartinCarlo - Quiz 2

Uploaded by

Martin Carlo A. Juco
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
You are on page 1/ 11

MARTIN CARLO JUCO

Management Science
ACN1Ar
Quiz 2
Define the following:

1. Standard form in simplex method - Standard form is the baseline format for all linear programs
before solving for the optimal solution and has three requirements: (1) must be a maximization
problem, (2) all linear constraints must be in a less-than-or-equal-to inequality, (3) all variables
are non-negative. These requirements can always be satisfied by transforming any given linear
program using basic algebra and substitution. Standard form is necessary because it creates an
ideal starting point for solving the Simplex method as efficiently as possible as well as other
methods of solving optimization problems [1]

If the given is as follow:

Then the standard form is as follow:

2. Slack variables - Slack variables are additional variables that are introduced into the linear
constraints of a linear program to transform them from inequality constraints to equality
constraints. [1]

3. Entering variable – [2]

4. Leaving variable – [2]

5. Simplex tableu - A Simplex tableau is used to perform row operations on the linear
programming model as well as to check a solution for optimality. The tableau consists of the
coefficient corresponding to the linear constraint variables and the coefficients of the objective
function [1]
6. Pivot variable - The pivot variable is used in row operations to identify which variable will
become the unit value and is a key factor in the conversion of the unit value [1]

7. Simplex method - The Simplex method is an approach to solving linear programming models by
hand using slack variables, tableaus, and pivot variables as a means to finding the optimal
solution of an optimization problem.

Source:

1. Laurel Nichols & Gina Christofaro (2015). Explanation of Simplex Method. IMSE Concept Library.
Retrieved from: https://www.imse.iastate.edu/files/2015/08/Explanation-of-Simplex-
Method.docx
2. The Steps of the Simplex Algorithm (n.d.). Hec Montreal. Mathematics Help Cetre. Retrieved
from: https://www.hec.ca/en/cams/help/topics/The_steps_of_the_simplex_algorithm.pdf

You might also like