VARELA SÁNCHEZ LUCIO LEÓN IOI T1: INTRODUCCIÓN

IO1T1INICIALES171000.PDF
Habilidad (competencia). Esta evaluación tiene como objetivo cuantificar la capacidad
y habilidad de la alumna y del alumno para analizar y resolver problemas que implican
la aplicación de los principios y técnicas del método gráfico - primal de la investigación
de operaciones, los principios de la ley de la proporcionalidad, el poka yoke y el Tora.
Esto como evidencia de su formación en ciencias de la ingeniería, ingeniería aplicada
y diseño en ingeniería con la aplicación de las habilidades blandas y duras.

Instrucción. Léase cuidadosamente el siguiente problema, encuentre su solución

manualmente (50 %) por método gráfico - primal a través de hojas milimétricas con
sus datos personales en la parte superior de las mismas, respete la proporcionalidad,
paso a paso y en Tora (20 %).

What is operation Research? Operations Research is defined as Scientific method

for providing executive departments a quantitative basis for decisions regarding the
operations under their control. This definition suggests that the Operations Research
provides scientific methods for an executive to make optimal decisions. But does not
give any information about various models or methods. But this suggests that
executives can use scientific methods for decision-making
What is scientific method? (1) Observations are any sensory input. At the simplest level
they are direct sensory input — sight, sound, taste, smell and touch. (2) Ask a Question
(3) Formulate an Hypothesis. (4) Make a prediction based on the hypothesis. (5) Test
the prediction. (6) Iterate: use the results to make new hypotheses or predictions.

What are phases on an operation research? Operation Research study is conducted

in below steps.
1. To formulate the Problem: ● Objectives are defined ● Range of Controllable
variables are identified ● Identify the uncontrollable variables that may cause damage
● Understand Restrictions ● Understand nature or condition of variables This phase is
considered is importance for the reason, any wrong analysis done at this stage would
replicate wrong decisions and results.
2. Develop an appropriate Operation Research models: ● As the name indicate, it
is about selecting right Operation Research model to be applied to find solution to a
problem ● Operation Research model selection generally is based on below factors -
Varaibles - Parameters - Restrictions - Objective of research.
3. Select best OR Model ● Here it is process of selecting right selection of solution
after evaluation of all alternate solutions ● All pro’s and concerns are analysed of each
solution available, then finally a best solution method is selected.
4. Validate the Operation Research Model: ● Here it is tested for errors before
proceeding to testing at organizational level ● Once it is passed with reliability of its
performance, on research it is put to next stage ● Otherwise, it is subjected to changes
and looked into matter of reconsideration of alternate method again, that means
discarding the method and select the next best operation research method for testing.
5. Sensitivity Analysis: ● In this stage, operation research method is used as per
satisfaction levels of Business needs ● The method is put to changes, when there is
an change in variables of organisational research in real terms, otherwise the results
might show incorrect data of performance. ● This action of reconsideration of changes
in variable is known as Sensitivity Analysis.
6. Decision Making and implementation of specific solution: ● Finally, in this stage
the model is put to use in real terms and implemented to work ● The implementation of
Operation Research needs a cooperation of OR Specialist with Business operations ,
managing teams etc ● A positive cooperation will always results in good yields.
 THE SIMPLEX METHOD
Rather than enumerating all the basic solutions (corner points) of the LP problem, the
simplex method investigates only a “select few” of these solutions. Section 3.3.1
describes the iterative nature of the method, and Section 3.3.2 provides the
computational details of the simplex algorithm.
This section provides the computational details of a simplex iteration. The vehicle of
explanation is a numerical example.
You will shortly discover that the simplex method computations are repetitious, tedious,
and voluminous. Nevertheless, it is imperative that you experience these hand com-
putations, if only to appreciate the indispensable role of the computer in solving OR
problems. And even though in practice you may never solve an LP by hand, the present
experience is important because it provides you with an understanding of how and why
the algorithm works. In that context, I recommend that you maintain a mental image of
the graphical solution space displayed with Example 3.3-1 to gain insight into the close
association between the algebraic iteration and the graphical corner point. In particular,
at the end of each iteration, read the resulting solution point directly from the simplex
tableau and then locate its corresponding corner point on the graphical solution space.
In this manner, you will have a better understanding of the essence of the simplex
method.

Consider the Reddy Mikks model (Example 2.1-1) expressed in equation form:

Maximize z = 5x1+4x2+0x3+ 0x4+0x5+0x6

Subject to:

6x1 +4x2 +x3 =24

X1 +2x2 + x4 =6
-x1 +x2 +x5 =1
x2 +x6 =2
x1 , x2, x3, x4, x5, x6 > 0
The variables x3, x4, x5, and x6 (if x1=x2=0 → x3=24, x4=6, x5=1 and x6=2) are the slacks
associated with the respective constraints.
Next, we write the objective equation as Z - 5x1 - 4x2 = 0
In this manner, the starting simplex tableau can be represented as follows:
First iteration
Basic z X1Enter X2 X3 X4 X5 X6 Solution
Z 1 -5 -4 0 0 0 0 0 Reason
X3leave 0 6 p.e 4 1 0 0 0 24/6=4PR
X4 0 1 2 0 1 0 0 6/1=6
X5 0 -1 1 0 0 1 0 1
X6 0 0 1 0 0 0 1 2

The. Layout of the simplex tableu automatically provides the solution at the starting
interation. The solution starts at the origin [x1, x2 = (0, 0)], thus defining (x1, x2 ) as the
nonbasic variables and (x3, x4, x5, x6) as the basic variables. The associated objective
z and the basic variables (x3, x4, x5, x6) are listed in the leftmost Basic-column. Their
values, z = 0, x3 = 24, x4 = 6, x5 = 1, x6= 2, appearing in the rightmost Solution-column,
are given directly by the right-hand sides of the model’s equations (a convenient
consequence of starting at the origin). The result can be seen by setting the nonbasic
variables (x1, x2) equal to zero in all the equations, and also by noting the special
identity-matrix arrangement of the constraint coefficients of the basic variables (all
diagonal elements are 1, and all off-diagonal elements are 0).
Is the starting solution optimal? The objective function z = 5x1 + 4x2 shows that the
solution can be improved by increasing the value of nonbasic x1 or x2 above zero. As
argued in Section 3.3.1, x1 is to be increased because it has the most positive objective
coefficient. Equivalently, in the simplex tableau where the objective function is written
as z - 5x1 - 4x2 = 0, the selected variable is the nonbasic variable with the most negative
coefficient in the objective equation. This rule defines the so-called simplex optimality
condition.
In the terminology of the simplex algorithm, x1 is known as the entering variable
because it enters the basic solution.
If x1 is the entering variable, one of the current basic variables must leave— that is, it
becomes nonbasic at zero level (recall that the number of nonbasic variable must
always be n - m). The mechanics for determining the leaving variable calls for
computing the ratios of the right- hand side of the equations (Solution column) to the
corresponding (strictly) positive constraint coefficients under the entering variable, x1,
as the following table shows.
The swapping process is based on the Gauss-Jordan row operations. It identifies the
entering variable column as the pivot column and the leaving variable row as the pivot
row with their intersection being the pivot element. The following tableau is a
restatement of the starting tableau with its pivot row and column highlighted.
The Gauss-Jordan computations needed to produce the new basic solution include two
types.
1. Pivot row
a. Replace the leaving variable in the Basic column with the entering variable.
b. New pivot row = Current pivot row ÷ Pivot element
2. All other rows, including Z
New row = (Current row) – (Pivot column coefficient) X (New pivot row)
These computations are applied to the preceding tableau in the following manner:

c) The new pivot equation = (6 4 1 0 0 0 24) ÷ 6 = 6/6 4/6 1/6 0/6 0/6 0/6 24/6 = (1 2/3
1/6 0 0 0 4), there are the values of X1 that enters the basic column.

d) The new equation of Z: previous equations of Z (-5 -4 0 0 0 0 0 )

-(-5)(1 2/3 1/6 0 0 0 4 )
The multiplication must be done: (5 10/3 5/6 0 0 0 20 )
Now add the two extremes: (0 -2/3 5/6 0 0 0 20 )

e) The new equation of X4: previous equations of X4: (1 2 0 1 0 0 6 )

-(1)(1 2/3 1/6 0 0 0 4 )
The multiplication must be done: (-1 -2/3 -1/6 0 0 0 -4)
Now add the two extremes: (0 4/3 -1/6 1 0 0 2 )

f) The new equation of X5: previous equations of X5: (-1 1 0 0 1 0 1)

-(-1)(1 2/3 1/6 0 0 0 4 )
The multiplication must be done: (1 2/3 1/6 0 0 0 4 )
Now add the two extremes: (0 5/3 1/6 0 1 0 5)

g) The new equation of X6: previous equations of X6: (0 1 0 0 0 1 2)

-(0)(1 2/3 1/6 0 0 0 4 )
The multiplication must be done: (0 0 0 0 0 0 0 )
Now add the two extremes: (0 1 0 0 0 1 2)

h) The pivot element is the coefficient at the cross between the output and the input, in
this case is 6.
Second iteration
Basic z X1 X2Enter X3 X4 X5 X6 Solution
Z 1 0 -2/3 5/6 0 0 0 20Reason
X1 0 1 2/3 1/6 0 0 0 4/1/2/3 6
X4leave 0 0 4/3 p.e -1/6 1 0 0 2/1/4/33/2
X5 0 0 5/3 1/6 0 1 0 5/1/5/3 3
X6 0 0 1 0 0 0 1 2/1 2

These computations are applied to the preceding tableau in the following manner:
c) The new pivot equation: (0 4/3 -1/6 1 0 0 2) ÷ 4/3 = (0/1÷4/3 4/3÷4/3 -1/6÷4/3 1/1÷4/3 0
0 2/1÷4/3) = (0 1 – 1/8 ¾ 0 0 3/2) → x2

d) The new equation of Z: previous equations of Z. (0 -2/3 5/6 0 0 0

20)
-(-2/3) (0 1 – 1/8 ¾ 0 0 3/2)
The multiplication must be done:
Now add the two extremes:
e) The new equation of X1

f) The new equation of X5

g) The new equation of X6

Third iteration
Basic Z X1 X2 X3 X4 X5 X2 Solution
Z 1 0 0 3/4 1/2 0 0 21
X1 0 1 0 1/4 -1/2 0 0 3
X2 0 0 1 -1/8 3/4 0 0 3/2
X5 0 0 0 3/8 -5/4 1 0 5/2
X6 0 0 0 1/8 -3/4 0 1 1/2
Based on the optimality condition, none of the z-row coefficients are negative. Hence,
the last tableau is optimal.
The optimum solution can be read from the simplex tableau in the following manner.
The optimal values of the variables in the Basic column are given in the right-hand-side
Solution column and can be interpreted as “conclusion”

Decision variable Optimum value Recommendation “product mix”

X1 3 Produce 3 tons of exterior paint daily
X2 3/2 Produce 1.5 tons of interior paint daily
Z 21 Daily profit is $21,000 dollars

The solution also gives the status of the resources. A resource is designated as scarce
if its associated slack variable is zero—that is, the activities (variables) of the model
have used the resource completely. Otherwise, if the slack is positive, then the resource
is abundant. The follow- ing table classifies the constraints of the model:

Resource Slack value Status

Raw material, M1 X3 Scarce
Raw material, M2 X4 Scarce
Market limit X5 Abundant
Demand limit X6 Abundant

Remarks. The simplex tableau offers a wealth of additional information that include the
following:
1. Sensitivity analysis, which deals with determining the conditions that will keep
the current solution unchanged.
2. Post-optimal analysis, which deals with finding a new optimal solution when the
data of the model are changed.
3. https://youtu.be/9aLCkj76dGg: método grafico y método simplex 13.25 min.
4. https://youtu.be/j9B7N5lnieE: Problemas de Optimizacion - Programacion
Lineal – Matlab 6.20 min
5. https://youtu.be/ZOWskHnHkqI?si=Gfn3NS0-UcDgcq18: How Oil Fueled an
American Empire | The Men Who Built America (S1, E2) | Full Episode
6.