Problem Set U.1
Uploaded by
ScribdTranslationsProblem Set U.1
Uploaded by
ScribdTranslationsTECHNOLOGICAL UNIVERSITY OF COAHUILA
Engineering in Industrial Processes and Operations
9th Semester
Section C
Subject
Operations Research
MI. Flor Ingrid Rodríguez Cerda
Unit I:
Introduction to Operations Research
Report: Problem Set U.1
students
Miss Xolio Miguel Alejandro
Morales Saucedo Luis Angel
Rodríguez Juárez Gustavo
Delivery date: October 2, 2020
Problem 1
A company specializing in the manufacture of furniture for homes produces a certain type of tables.
and chairs that he sells for 2000 each table and 3000 each chair. He wants to know how many units of each
The worker must manufacture an article daily to maximize income, having the following
restrictions:
The total number of units of the two types shall not exceed four per day and worker.
Each table requires two hours for its manufacture; each chair, three hours. The maximum working day
It is ten o'clock.
The material used for each table costs 400. The material used for each chair costs 200. Each worker
it has 1200 daily
for material.
Formulate the linear programming problem
Problem 2
A car factory has 2 assembly plants, the first in Guadalajara and the second
in Toluca. The monthly offer of each of them is: 3,000 and 4,000, respectively. There is a
order from several agencies for 7,000 cars that must be delivered no later than
one month. The following table indicates the number of cars required and the location where they must be
delivered.
City Quantity
Morelia 2,500
Sonora 2,750
Veracruz 1,750
The delivery area engineer estimates the transportation costs per unit of each of the
Plants for each of the destinations are as follows:
Morelia Sonora Veracruz
Guadala $50 $150 $80
jar
Toluca $60 $200 $70
With this information, we want to find the combination that minimizes the
transportation costs. Formulate the linear programming problem
Problem 3
WYNDOR GLASS CO. produces high-quality glass items, including windows and doors.
made of glass. It has three floors. Two products are manufactured whose potential sales are very
promising:
an 8-foot glass door with frame of
aluminum Product 2: a sliding window with frame of
wood of 4 by 6 feet The IO team also identified
the data I needed to gather:
1. Number of available production hours per week in each plant to manufacture these
products.
2. Number of manufacturing hours used to produce each batch of each item each time.
of the plants.
3. The profit per batch of each new product. (The profit was chosen
by batch produced) The table summarizes the gathered data.
Plant (Factory) Production time per batch, hours Time of
Product production
1 2 available a the
week, hours
Plant 1 1 hour 0 hours 4 hours of plant 1
Floor 2 0 hours 2 hours 12 hours of plant 2
Plant 3 3 hours 2 hours 18 hours of plant 3
Product Profit
for
lot
Determine what production rates the two products should have in order to maximize the
total utilities, subject to the restrictions imposed by limited production capacities
available on all three floors.
(Each product will be manufactured in batches so that the production rate is defined as the
number of batches produced per week.
Formulate the linear programming problem
Problem 4
A workshop has 2 types of machines A and B, they can manufacture 2 products 1 and 2, all the
Products must go to each machine and each one goes in the same order, first to the
machine A, then to B. The following table shows the hours required on each machine,
per product unit, the total hours available for each machine per week and the
profit per unit sold of each product.
Hours
Type of Machine Product 1 Product 2
available
per week
8 hours of
A 1 hour 4 hours
the
Machine A
4 hours of
B 1 hour 2 hours
the
machine B
Profits
$3 $9
for
Unit
What quantity of product 1 and 2 should be manufactured each week to obtain
the maximum profit. Formulate the linear programming problem.
Problem 5
The company MR located in 2 cities is a supplier of automotive parts to the
Assemblers W, F, and K are shown below with the information.
MR1 MR2 Piece
W $170 $125 3500
F $134 $160 3900
K $150 $143 5500
Piece 7500 5400
s
It is desired to know which company MR and in what quantity the pieces should be sent to each.
assembler, at the lowest possible cost. Formulate the linear programming problem.
Problem 6
A computer factory has 2 assembly plants, the first in Guadalajara and
second in Toluca. The monthly offer of each of them is: 3000 and 4000,
respectively. There is an order from the federal government for 7000 computers
that must be delivered no later than in a month. The following table indicates the number of
required computers and the location where they must be delivered.
City Quantity
Morelia 2,500
Sonora 2,750
Veracruz 1,750
The delivery area engineer estimates that the transportation costs per unit of each one
from the plants to each of the destinations is as follows:
Morelia Sonora Veracruz
Guadalajara $50 $150 $80
Toluca $60 $200 $70
With this information, we want to find the combination that minimizes transportation costs.
that is, we must decide how many computers from each of the plants should be
transported to each of the destinations, in such a way that the total transportation cost is
minimum. Pose the linear programming problem.
Problem 7
A company hires four people to fill the following positions: supervisor of
finished, packaging supervisor, production supervisor, raw material supervisor.
Each one takes an aptitude test to determine their skills. From the
the exam results determine the cost of your training for each one of them
the positions. The costs are presented in the following table
Finished Packaging Production Subject
First
Person 1 $1 $4 $6 $3
Persona 2 $9 $7 $10 $9
Persona 3 $4 $5 $11 $7
Persona 4 $8 $7 $8 $5
If you want to know the lowest cost allocation for the company. Formulate the problem of
linear programming
