Deliverable 1 Operations Research and Optimization
Uploaded by
ScribdTranslationsDeliverable 1 Operations Research and Optimization
Uploaded by
ScribdTranslationsUNITE
C
Student: Luis Eduardo Cortes Miguel Lic. In Industrial
Engineering and Administration Cuitláhuac Campus Subject:
OPERATIONS RESEARCH AND OPTIMIZATION Professor:
AIDA CASTAÑEDA RICO
Technological University of Mexico
1. A tailor needs to make two different quality fabrics “normal” and “premium”; There
are 500 kg of fine acrylic yarn, 300 kg of fine mohair yarn and 108 kg of multi-strand
mix yarn. To obtain one meter of “normal” fabric daily, you need 125 g of fine acrylic,
150 g of fine mohair and 72 g of multilayer mix; To produce one meter of “premium”
fabric per day, 200 grams of fine acrylic, 100 grams of fine mohair and 27 grams of
multilayer mix are needed. “Regular” fabric sells for $4,000 per meter and “premium”
fabric sells for $5,000 per meter. If maximum profit is to be obtained, how many
meters of “regular” and “premium” fabric should be manufactured? Simplex and
graphical method. Pose and solve the LP model by the graphical method. (8.0 points)
x1 = number of meters of normal fabric to be manufactured;
x2 = number of meters of premium fabric to be manufactured;
restrictions are based on thread mixing.
The objective function is based on the benefits obtained from each of the different types of
threads.
Solving using the simplex method as follows: Max z=400x 1 + 500 x 2
0.125x 1 + 0.2 x 2 ≤ 500
0.15x 1 + 0.1 x 2 ≤ 300
0.72x
1 + 0.27 x 2 ≤ 108
And x 1, x 2 ≥0
Cj
Iteration 4000 5000 0 0 0
-1
b CB XB x1 x2 S1 S2 S3
Min Radio
XB
x2
S1 0 500 0.125 0.2 1 0 0 500
= 2500
0.2
S2 0 300 0.15 0.1 0 1 0 300
= 3000
0.1
S3 0 108 0.72 (0.27) 0 0 1 108
= 400
0.27
Z-0 Zj 0 0 0 0 0
Z j- C j -4000 -5000 0 0 0
Cj
Iteration 4000 5000 0 0 0
-2
b CB XB x1 x2 S1 S2 S3 Min Radio
S1 0 420 -0.4083 0 1 0 0.7407
S2 0 260 -0.1167 0 0 1 -0.3704
x2 500 400 2.6667 1 0 0 3.7037
Z-200000 Zj 13333.3333 5000 0 0 18518.5185
Z j- C j 9333.3333 0 0 0 18518.5185
since all Z, -C, ≥ 0
Therefore, the optimal solution of the variable is reached as
Max Z = 2000000
2. In a basketball and soccer ball factory, the marketing manager has to decide the best
way to spend the resources allocated to advertising. Each of the sponsored soccer
teams requires 120 soccer balls. Each basketball team requires 32 basketballs.
Football coaches receive $300,000 in ball sponsorships, and basketball coaches
receive $1,000,000. He budget for promotions It amounts to
$30,000,000. The factory has a limited supply (4 liters, or 4,000 cubic centimeters) of
polyester, a compound used in the manufacture of promotional balls. Each
basketball requires 3 cc of polyester and each soccer ball requires 1 cc. Manager
UNITE
C
wants to sponsor as many basketball and soccer teams as its resources allow.
a) Formulate a set of linear equations to describe the objective function and
constraints. (2.0 points)
Technological University of Mexico
x=Soccer team number
y=Number of basketball teams
Objective functions: Max (x+y)
Budget 300,000x + 1,000,000y= ≤30,000,000
Flubber: 120x + 96y ≤ 4000
Non-negativity: x, y ≥ 0
b) Use graphical analysis to find the visual solution. (7.0 points)
Green Color: Feasible Region
Red Color: Optimal solution
The same colors will be used for all problems.
The visual solution would be found at point C:
x =12.280701754386 y = 26.315789473684
c) What is the maximum number of each type of balls that the factory will be able to
sponsor? Solve by the simplex method (8.0 points)
Since the number of teams cannot be a decimal value, we consider the following values:
x = 12 y = 26
Theory.
Read the following statements carefully and write T if the statement is true or F if it is false.
(Value .75 each)
1. A Linear Programming problem with 4 decision variables and 3
restrictions have a solution by the graphical method……………………………( F )
2. The problem is said to have a “lightning solution” when the function
objective is optimized in conjunction with a constraint that tends to
infinity………………………………………………..( V )
3. A slack variable is one that adds a lot of weight to the objective function of the
Linear Programming problem………………..( V )
4. Artificial variables CANNOT be part of the solution…………….……………………….( F )
5. Deterministic models are those in which probability functions
intervene………………………………………………………….( F )
6. The unrestricted feasible region is one that tends to infinity since it is not limited by
a restriction……………………………………...( V )
7. The decision variables in a linear programming problem can be negative ( V )
8. The simplex model is based on a basic feasible solution Initial…( V )
Bibliography
http://www.estadistica.net/Algoritmos2/pau-programacion.pdf
https://www.plandemejora.com/ejercicios-resueltos-de-programacion-lineal-por- el-metodo-
grafico/
