Or Midterm Reviewer


 Simplex Method – a remarkably efficient solution procedure, is available for solving linear programming problems of
even enormous size.


 Pro
 Solution – any specification of values for decision variables regardless of whether it is a desirable or even an allowable
choice.
 Feasible Solution – is a solution for which all constraints are satisfied.
 Infeasible Solution – is a solution for which at least one constraint is violated.
 The feasible region is the collection of all feasible solutions.
 Optimal Solution – is a feasible solution that has the most favorable value of the objective function. The most favorable
value is the largest value if the objective function is to be maximized, whereas it is the smallest value if the objective
function is to be minimized.

 Corner – point feasible (CPF) solution - is the solution that lies at a corner of the feasible region.








 Swift and Company – is a diversified protein-producing business based in Greeley,Colorado.

 Range name – is a descriptive name given to a block of cells that immediately identifies what is there.
 Data cells – refer to the cells showing the data. These cells are lightly shaded to distinguish them from other cells in the
spreadsheet.
 Sparse – refers to the data sets with a low density.
 Welch’s Corporation – is the world’s largest processor of concord and Niagara grapes.
 polynomial time algorithm; i.e.,the time required to solve any linear programming problem can be bounded above by a polynomial
function of the size of the problem.
 exponential time algorithm (i.e., the required time can be bounded above only by an exponential function of the problem size).
 constraint boundary is a line that forms the boundary of what is permitted by the corresponding constraint.
 An augmented solution is a solution for the original variables (the decision variables) that has been augmented by the corresponding
values of the slack variables.
 parametric linear programming (or parametric programming for short) involves the systematic study of how the optimal
solution changes as many of the parameters change simultaneously over some range.
 Extensions and variations of the simplex method also are used to perform postoptimality analysis (including sensitivity analysis) on
the model. Postoptimality analysis is the analysis done after finding an optimal solution. Postoptimality Analysis—the analysis
done after an optimal solution is obtained for the initial version of the model—constitutes a very major and very important part of
most operations research studies.
 A basic solution is an augmented corner-point solution.
 A basic feasible (BF) solution is an augmented CPF solution.
 simplex method, a general procedure for solving linear programming problems. Developed by George Dantzig in 1947, it has
proved to be a remarkably efficient method that is used routinely to solve huge problems on today’s computers. The simplex method
is an algebraic procedure. However, its underlying concepts are geometric.
 minimum ratio test. The objective of this test is to determine which basic variable drops to zero first as the entering basic variable is
increased.
 IOR Tutorial – includes many interactive procedures for executing the algorithms interactively in a convenient format.
Test 2
THE ASSUMPTIONS OF LINEAR PROGRAMMING
 Proportionality Assumption * Additivity Assumption

 Divisibility Assumption * Certainty Assumption
THE SUMMARY OF THE SIMPLEX METHOD
 Initialization
 Optimality Test
 Iteration
THE STEPS OF ITERATION
Step 1: Determine the entering basic variable by selecting the variable (automatically a nonbasic variable) with the
negative coefficient having the largest absolute value (i.e., the “most negative” coefficient) in Eq. (0). Put a box around
the column below this coefficient, and call this the pivot column.
Step 2: Determine the leaving basic variable by applying the minimum ratio test.
Step 3: Solve for the new BF solution by using elementary row operations (multiply or divide a row by a nonzero
constant; add or subtract a multiple of one row to another row) to construct a new simplex tableau in proper form from
Gaussian elimination below the current one, and then return to the optimality test.
THE POLLUTANTS USED BY NORI AND LEETS COMPANY IN CONTROLLING AIR POLLUTION:
 Particulate matter /particulates

 Sulfur Oxides
 Hydrocarbons

Or Midterm Reviewer

Uploaded by

Copyright:

Available Formats

Or Midterm Reviewer

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Or Midterm Reviewer

Uploaded by

Copyright:

Available Formats



 Swift and Company – is a diversified protein-producing business based in Greeley,Colorado.

THE ASSUMPTIONS OF LINEAR PROGRAMMING

 Proportionality Assumption * Additivity Assumption

THE SUMMARY OF THE SIMPLEX METHOD

THE STEPS OF ITERATION

 Particulate matter /particulates

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.