Scribd
Upload
25 views6 pages

Actividad 1

Uploaded by

Edwin Rodriguez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
25 views6 pages

Actividad 1

Uploaded by

Edwin Rodriguez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

1.

El documento se debe presentar bajo los parámetros de


formulación APA y debe contener todas las referencias
bibliográficas consultadas, mínimo 3.

Actividad 1. Introducción a la Optimización (INDIVIDUAL)

Antes de desarrollar la actividad, revise los siguientes objetos de


aprendizaje (OVA):

o
 Recurso Conceptos básicos de optimización.
 Recurso Historia y aplicaciones de la
optimización.
 Recurso Principios básicos de la
optimización.
 Recurso Pasos para realizar una
optimización.
 Recurso Método de simplex.

También, deberán revisar los textos y videos antes de realizar la Guía 1 y la evaluación. Se
recomienda al estudiante realizar los ejercicios ejemplo de los textos para evidenciar el
paso a paso de los métodos.

1. Desarrollar un mapa conceptual que resuma los conocimientos adquiridos en la


lectura: Caballero, J., y Grossman, I. (2007). Una revisión del estado del arte en
optimización. Revista Iberoamericana de Automática e Informática Industrial RIAI,
4(1). Haz clic aquíLinks to an external site.
Links to an external site.
Para desarrollar el mapa conceptual se recomienda alguna de las siguientes herramientas,
sin embargo, pueden usar la que más se le facilite:
Links to an external site.• https://creately.com/es/lp/creador-de-mapas-conceptuales/Links
to an external site.
• https://www.lucidchart.com/pages/es/ejemplos/mapa-conceptualLinks to an external
site.
• https://www.canva.com/es_es/graficos/mapas-conceptuales/Links to an external site.
• https://cmapcloud.ihmc.us/Links to an external site.
Links to an external site.

2. Realice un diagrama de flujo que explique los pasos para realizar un análisis de
sensibilidad después de realizar la formulación y solución de los problemas lineales con el
método simplex (Literatura guía: HAMDY A. TAHA. (2017). Investigación De
Operaciones (10ma Edición). PEARSON. Capítulo 3. Disponible en bases de datos
Ebooks 7-24.
3. Establecer la correspondencia entre cada una de los siguientes términos y la descripción
más adecuada para el mismo, en la lista que aparece a continuación, donde OL indica
Optimización Lineal.

https://youtu.be/zL9qsNHZr1c?si=dotwFtbOLbmZOQMW

PROBLEM 2. Amazing Dairy produces yogurt, sour cream, kefir, and


cottage cheese in 10 pound containers for the food service industry.
Each product is made in 10 pound batches and requires similar
processing through three machines. Details on Amazing Dairy's
product line, including the processing time in minutes at each machine,
follows. Amazing Dairy has 2,200 minutes of processing time available
for each machine each week. Develop a linear program that maximizes
total revenue.

Solution:

To solve this problem, let

y : 10 lb batch of yogurt made.


s : 10 lb batch of sour cream made.
k : 10 lb batch of Kefir made.
c : 10 lb batch of Cottage cheese made.
With these variables we need to solve the following maximization problem,

max 17.5 y +25 s +37.5 k +10 c


Subject to the following conditions,

0 ≤ y ≤ 25 0 ≤ c ≤ 1315 y +10 s +10 k +15 c ≤2200


0 ≤ s ≤ 45 30 y +5 s +25 k +10 c ≤2200
0 ≤ k ≤6

5 y +20 s +20 k +25 c ≤2200 The first four are obtained when we consider the weekly demand for
the products. The other three are obtained when we consider the time available for each machine
per week, and the time each of the products use.

When we use excel and its simplex method to solve this problem, we see that by setting each of
the variable to its maximum allowed value (given by the product demand), all the constraints are
met while maximizing the revenue. Therefore, to maximize revenue we should make 25 batches of
yogurt, 45 batches of sour cream, 6 batches of kefir and 13 pounds of cottage cheese. These
choose of variables yields a revenue of $1917.5.

PROBLEM 4. JPMorgan Chase has a scheduling problem. Operators work


eight-hour shifts and can begin work at midnight, 4M., 8 A.M., noon,
4 P.M., or 8 P.M. Operators are needed to satisfy the following demand
pattern.

Formulate a linear programming model to cover the demand


requirements with the minimum number of operators.

Solution:

For this problem let the vector v=(5 , 8 , 90 , 60 , 40 , 20) represent the demand
for operators and let
e 1=( 1 ,1 , 0 , 0 , 0 , 0 ) , e2=( 0 ,1 , 1, 0 , 0 , 0 ) , e3 =( 0 , 0 ,1 , 1 ,0 ,0 ) , e 4 =( 0 , 0 ,0 ,1 , 1, 0 ) and
e 5=(0 , 0 , 0 ,0 , 1 ,1), where for example e 1 represents a worker that begins
its shift at midnight and ends at 8am. Now let x i be the number of
workers working in each of the time periods. With this terms we get the
optimization problem

min ∑ x i
i

Subject to the restrictions,

∑ xi ei ≥ v
i

xi ≥ 0

Note that this is an abuse of notation, but the first inequality represents
6 individual inequalities, related to each corresponding component of the
e i and vector v .

When we use excel and its simplex method to solve this problem, we
obtain the number of workers that should start in each shift. The results
are consigned in the following table:

Starting shift Number of workers


Midnight to 4 A.M. 5
4 A.M. to 8 A.M. 30
8 A.M. to noon 60
Noon to 4 P.M. 20
4. PM to midnight 20
Total number of workers 135

PROBLEM 6. A business student at Knowledge College must complete a


total of 70 courses to graduate. The number of business courses must be
greater than or equal to 21. The number of nonbusiness courses must be
greater than or equal to 20. The average business course requires a
textbook costing $120 and 120 hours of study. Nonbusiness courses
require a textbook costing $80 and 200 hours of study. The student has
$7,200 to spend on books.

Create a set of linear equations to describe the objective function and


the constraints.

Find de optimal solution value using graph method.

Solution:

We will proceed with the problem supposing we want to minimize hours


of study. For this let x be the business courses attended and y the
number of non-business courses attended. In these terms the
optimization problem is

min 120 x+ 200 y


This problem is subject to the following restrictions:

x + y=70
120 x+ 80 y ≤ 7200
x ≥ 21 , y ≥ 20
In the following figure we show a visual representation of the problem. In
it the blue area corresponds to the soft restrictions on the problem. The
green line corresponds to the restriction x + y=70 .
Figure 1: Illustration to work out graphical method.

The vertices that we get and their corresponding values for the objective
function are:

Vertex Objective function value


(21,49) 12320
(40,30) 10800
Therefore, the optimum value is met when the student takes 40 business
courses and 30 non-business courses.

You might also like

pFad - Phonifier reborn

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

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy