0% found this document useful (0 votes)
26 views40 pages

Simplex Method Exercises for Optimization

The document contains multiple exercises applying the Simplex Method to various optimization problems, including maximizing profits for a convenience store, carpentry production, time management for a student, loan allocation for a bank, and production schedules for a canning company. Each exercise outlines constraints, variables, and the resulting optimal solutions. The final results include profit margins, production quantities, and resource allocations for different scenarios.

Translated by

ScribdTranslations
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views40 pages

Simplex Method Exercises for Optimization

The document contains multiple exercises applying the Simplex Method to various optimization problems, including maximizing profits for a convenience store, carpentry production, time management for a student, loan allocation for a bank, and production schedules for a canning company. Each exercise outlines constraints, variables, and the resulting optimal solutions. The final results include profit margins, production quantities, and resource allocations for different scenarios.

Translated by

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

SIMPLEX METHOD

EXERCISE 1.

The BK convenience store sells two types of drinks: The cola flavor brand A1 and the brand
specific to the store, cola Bk, more affordable. The profit margin on drink A1 is 5
cents per can, while the cola drink Bk adds a gross profit of 7
cents per can. On average, the store sells no more than 500 cans of both cola drinks.
daily. Even though A1 is a more well-known brand, customers tend to buy more cans of
the Bk brand, because it is considerably cheaper. Sales are estimated to be
brand Bk surpasses those of brand A1 by a ratio of at least 2:1. However, BK sells,
at least 100 cans of A1 per day. How many cans of each brand should be in stock?
does he/she tend daily to maximize his/her utility?

Development:

We define the constraints and will add excess, slack, or artificial variables
as the case may be:

- Constraint 1 is of type '≤' and the slack variable X3 is added.


- restriction 2 is of the type '≥', and the independent variable is negative or null
restriction is multiplied by -1), the slack variable X4 is added.
- Restriction 3 is of the type '≥', and the independent term is negative or null.
the constraint is multiplied by -1), the slack variable X5 is added.
- the constraint 4 is of the type '≥' the excess variable X6 is added and the
artificial variable X7.

The first table is being built:


The variable that leaves the base is P5 and the one that enters is P1.

The variable that leaves the database is P7 and the one that enters is P2.

Since there is a solution, the next step is carried out:


The variable that comes out of the base is P3 and the one that enters is P6.

The variable that exits the base is P6 and the one that enters is P5.

Z = 33
X1 = 100
X2 = 400

EXERCISE 2.

BFC employs four carpenters for 10 days to assemble tables and chairs. 2 are required.
hours to assemble a table and 30 minutes to assemble a chair. Normally, the
customers buy between four and six chairs with each table. The profits are $135 per table.
$50 per chair. The company operates a shift of 8 hours a day.

Graphically determine the optimal production mix for the 10 days.


Development:

We define the constraints and will add excess, slack, or ...


artificial depending on the case:

- constraint 1 is of type '≤' the slack variable X3 is added.


- restriction 2 is of the type '≤' the slack variable X4 is added.
- Restriction 3 is of the type '≤', the slack variable X5 is added.

First step:

The variable that comes out of the base is P4 and the one that enters is P1.
The variable that exits the base is P5 and the one that enters is P2.

Z=0
X1 = 0
X2 = 0

EXERCISE 3.
Jack is a first-year university student entrepreneur. Jack wants to distribute his
available time, of about 10 hours a day, between study and fun. Calculate that
The game is twice as fun as studying. He also wants to study at least a little.
how he plays. However, Jack understands that if he wants to finish all his tasks
university students, cannot play more than four hours a day.

How should Jack distribute his time to maximize his satisfaction both in studying
like in the game?
Development:
We define the constraints and will add surplus, slack, or variables.
artificial depending on the case:
- The constraint 1 is of the type '≤' and the slack variable X3 is added.

- restriction 2 is of the type '≥', and the independent term is negative or null
the restriction is multiplied by -1), the slack variable X4 is added.
- Restriction 3 is of type '≤', the slack variable X5 is added.

The simplex method table is built.


The variable that exits the base is P4 and the one that enters is P1.

The variable that exits the base is P5 and the one that enters is P2.

The variable that comes out of the base is P3 and the one that enters is P4.
Z = 14

X1 = 4

X2 = 6

EXERCISE 4.
Elkin's bank is allocating a maximum of $200,000.00 for personal loans and
cars during the next month. The bank charges 14% for personal loans and 12% for
car loans. Both types of loans are settled at the end of a period of one
year. Experience shows that around 3% of personal loans and 2% of the
car loans are never settled. Usually, the bank assigns at least the
double of personal loans to car loans.

Determine the optimal fund allocation for the two types of loans.
Development:

We define the constraints and we will add surplus, slack, or artificial variables.
as the case may be:

- Constraint 1 is of type '≤' and the slack variable X3 is added.

- restriction 2 is of the type '≥', and the independent term is negative or null (the
the restriction is multiplied by -1), the slack variable X4 is added.

We proceed to build the first table of the Simplex method.

The variable that exits the base is P4 and the one that enters is P2.
The variable that comes out of the base is P3 and the one that enters is P1.

Z = 21000

X1 = 100000

X2 = 100000

EXERCISE 5.

Popeye Canning has a contract to receive 60,000 pounds of ripe tomatoes at 7


cents per pound, with which it produces canned tomato juice, as well as paste
tomate. Los productos enlatados se empacan en cajas de 24 latas. Una lata de jugo requiere
A pound of tomatoes and a can of pasta only requires 1/3 of a pound. The market share
the company is limited to 2000 boxes of juice and 6000 boxes of pasta. The wholesale prices for
Juice box and pasta are 18 and 9 dollars respectively.

Develop an optimal production program for Popeye Canning.


Development:

We will define the constraints and add surplus, slack, or ...


artificial as the case may be.
- constraint 1 is of type '≤' the slack variable X3 is added.
- Constraint 2 is of the type '≤', the slack variable X4 is added.
- Restriction 3 is of type '≤' the slack variable X5 is added.
We proceed to build the first table of the Simplex method.

The variable that exits the base is P4 and the one that enters is P1.

The variable that comes out of the base is P3 and the one that enters is P2.

The variable that comes out of the base is P5 and the one that enters is P4.
Z = 63000

X1 = 500

X2 = 6000

EXERCISE 6.

A company produces two types of hats. Hat type 1 requires twice the time.
work that of type 2. If all the hats produced are only of type 2, the
the company can produce a total of 400 hats per day. The daily market limits are
from 150 of type 1 and 200 of type 2. The utility of hat type 1 is $8.00 and that of
Type 2 sombrero is $5.00.

Determine the number of hats of each type that the company should produce to obtain
the maximum utility.
Development:
We will define the constraints and add surplus, slack, and artificial variables according to
be the case
- The constraint 1 is of type '=' the artificial variable X6 is added.
- The constraint 2 is of type '≤' the slack variable X3 is added.
- Constraint 3 is of type '≤', the slack variable X4 is added.
- constraint 4 is of the type '≤' the slack variable X5 is added.
We proceeded to construct the first table of Phase I of the Two-Phase Method.

The variable that leaves the base is P6 and the one that enters is P1.

Since there is a solution, the second step is carried out:

The variable that exits the base is P5 and the one that enters is P2.
Z = 1808

X1 = 101

X2 = 200

EXERCISE 7.
A company that operates 10 hours a day manufactures each of two products between
sequential processes. The following table summarizes the problem data:

Minutes per unit

Product Process 1 Process 2 Process 3 Utility

Product 1 10 6 8 $2.00

Product 2 5 20 10 $ 3,00

Determine the optimal mix of the two products:


Development:
We define the constraints and add surplus, slack, and artificial variables as necessary.
- The constraint 1 is of the type '≤', the slack variable X3 is added.
- constraint 2 is of the type '≤' the slack variable X4 is added.
- Restriction 3 is of the type '≤' the slack variable X5 is added.
We proceed to build the first table of the Simplex method.

The variable that exits the base is P4 and the one that enters is P2.

The variable that comes out of the base is P3 and the one that enters is P1.

Z = 148.23529411765

X1 = 52.941176470588

X2 = 14.117647058824
EXERCISE 8.

Wyoming Electric Coop. is the owner of a power generation plant with turbines.
vapor, because Wyoming is rich in coal deposits. However, this creates the
problem of meeting emission standards. The regulations of the Environmental Protection Agency
Environmental regulations limit the discharge of sulfur dioxide to 2000 parts per million and the discharge of
smoke from the chimneys of the plant at 20 pounds per hour. The cooperative receives two degrees of
powdered coals, C1 and C2, to be used in the plant. Typically, both grades are
they blend before burning them. For simplicity, we will assume that the sulfur contaminant of
the mixture (in parts per million) is a weighted average of the proportion of each grade in
the mixture. The following data is based on the consumption of one ton per hour of each
of the two degrees of carbon:

Degree of Carbon Sulfur download Smoke download Generated vapor


(parts per million) (pounds x hour) (pounds x hour)

C1 1.800 2.10 12,000


C2 2.100 0.90 9,000

Determine the optimal production to mix the two grades of coal:


Development

We define the restrictions and add excess, slack, and artificial variables according to
be the case
- Constraint 1 is of type '≤' and the slack variable X3 is added.
- Constraint 2 is of the type '≤', the slack variable X4 is added.
We move on to constructing the first table of the Simplex method.

The variable that comes out of the base is P4 and the one that enters is P1.

The variable that exits the base is P3 and the one that enters is P2.

Z = 153846.15384615

X1 = 5.1282051282051

X2 = 10.25641025641
EXERCISE 9.

BGC manufactures shirts for men and blouses for women at the WD warehouse. The process of
production includes cutting, sewing, and packing. BGC employs 25 workers in the
cut department, to 35 in the sewing department and to 5 in the
packed. The factory works an 8-hour shift, only 5 days a week. The following table
provides the tempo requirements and the utility per unit for the two garments.

Minutes per unit per worker

Garment Court Sewing Packed Utility

Shirts 20 70 12 $ 2,50

Blouses 60 60 4 3.20

Determine the optimal weekly production schedule for BGC:

Development

We define the restrictions and add excess, slack, and artificial variables according to
be the case
- Restriction 1 is of type '≤' and the slack variable X3 is added.
- Restriction 2 is of type '≤' and the slack variable X4 is added.
- Restriction 3 is of type '≤' the slack variable X5 is added.

We proceed to construct the first table of the Simplex method.


The variable that goes out of the base is P3 and the one that comes in is P2.

The variable that comes out of the base is P4 and the one that comes in is P1.

Z = 3888
X1 = 480
X2 = 840
EXERCISE 10.

An assembly line consisting of three consecutive stations produces two models of


radio HF1 and HF2. The following table provides the assembly times for ballasts
workstations.

Minutes per unit


Workstation HF1 HF2
1 6 4
2 5 5
3 4 6

The daily maintenance of stations 1, 2, and 3 consumes 10%, 14%, and 12%, respectively.
of the maximum of 480 minutes available for each station, each day.

The company wants to determine the optimal product mix that will minimize the times.
inactive (or not used) in the last workstations.

Development

We define the constraints and add surplus, slack, and artificial variables as appropriate:
- restriction 1 is of type '≤' the slack variable X3 is added
- the constraint 2 is of the type '≤' the slack variable X4 is added.
- Constraint 3 is of type '≤' and the slack variable X5 is added.
We proceed to build the first table of the Simplex method.

The variable that comes out of the base is P3 and the one that comes in is P1.

The variable that exits the base is P4 and the one that enters is P2.

Z = 1238.4

X1 = 50.88

X2 = 31.68
EXERCISE 11.

John has to work at least 20 hours a week to complete his income while
attends school. He has the opportunity to work in two stores. In store 1, John can
work between 5 and 12 hours a week, and in the store 2 they allow you to work between 6 and 10 hours
semanales. Ambas tendas pagan el mismo salario por hora. De manera que John quiere basar
your decision about how many hours you should work in each store is based on a different criterion: the
stress factor at work. Based on interviews with current employees, John
calcula que, en una escala de 1 a 10, los factores del estrés son de 8 y 6 en las tendas 1 y 2
respectively. Because stress increases by the hour, he assumes that the total stress at the end
of the week is proportional to the number of hours worked in the store.

How many hours should I work in each store?


Development

We define the constraints and will add slack, surplus, and artificial variables as needed.
case

- Restriction 1 is of the type '≥', the excess variable X3 is added and the
artificial variable X8.

- Constraint 2 has the type '≥', the excess variable X4 is added and the
variable artficial X9.
- Restriction 3 is of the type '≤' the slack variable X5 is added.

- restriction 4 is of type '≥' the surplus variable X6 is added and the


artificial variable X10.
- Restriction 5 is of the type '≤' and the slack variable X7 is added.

We proceed to build the first table of Phase I of the Two-Phase method.


The variable that exits the base is P9 and the one that enters is P1.

The variable that exits the base is P10 and the one that enters is P2.
The variable that comes out of the base is P5 and the one that enters is P4.

The variable that exits the base is P8 and the one that enters is P6.

Is there any possible solution to the problem, so we can move on to Phase II for
calculate it.
The variable that leaves the base is P7 and the one that enters is P3.

Z = 156

X1 = 12

X2 = 10

EXERCISE 12.

During an inspection at a footwear factory, we obtained the following information:

1) Shoes for ladies, gentlemen, and children are manufactured and sold at the following retail price per pair:
Men's shoes for Bs 60,000
Ladies' shoes for Bs 120,000 -
Boy's shoes for Bs 30,000
The manufacturing cost of each pair of footwear is:
Men's shoes Bs 30,000
Ladies' shoes Bs 80,000
Children's shoes Bs 15,000
3) To make a pair of men's shoes, the following is used: 0.20 meters of treated leather; 0.10
sole meters, a pair of dress shoes for men, and 5 man-hours of work.
To make a pair of women's shoes, the following is used: 0.15 meters of treated leather; 0.10
sole meters, a pair of women's heels and 8 man-hours of work.
5) The following material was inventoried in the warehouse:
-120 meters of treated rope.
-70 meters of sole.
-250 pairs of dress shoes for men.
-260 pairs of ladies' shoes.
-65 soles for children's shoes.
-300 detrenza pairs.
-400 boxes for footwear.
-800 bags for footwear.
The company sells fewer children's shoes than men's shoes.
Fewer children's shoes are sold than women's shoes.
The company sells more than 100 pairs of shoes weekly.
Sales of men's shoes do not exceed 75% of women's shoes.
The company has 2,400 man-hours available per week.
11) The manager of the company wants to know how many shoes for women and men he should.
fabricar semanalmente paratres escenarios distntos, a saber:
a) Maximize utility.
b) Maximize revenue by retail price.
c) Minimize manufacturing costs.

Development

a) Maximize utility

We define the constraints and add the surplus, slack, and artificial variables according to
be the case.

- Constraint 1 is of type '≤' the slack variable X3 is added.


- Constraint 2 is of type '≤', the slack variable X4 is added.
- Constraint 3 is of the type '≤' with the addition of the slack variable X5.
- Constraint 4 is of type '≤', the slack variable X6 is added.
- Constraint 5 is of the type '≤' and the slack variable X7 is added.
- restriction 6 is of type '≥' the surplus variable X8 is added and the
artificial variable X10.
- restriction 7 is of the type '≤' the slack variable X9 is added.
First Step:

The variable that exits the base is P9 and the one that enters is P1.

The variable that leaves the base is P10 and the one that enters is P2.
As there is a solution, we move on to the next phase:

The variable that comes out of the base is P7 and the one that enters is P8.

The variable that exits the base is P6 and the one that enters is P9.
Z = 35040000 X1 = 64 X2 = 260

b) Maximize revenue from retail price.

- Constraint 1 is of type '≤' and the slack variable X3 is added.

- Restriction 2 is of type '≤' and the slack variable X4 is added.

- Restriction 3 is of type '≤' so the slack variable X5 is added.

- la restricción 4 es del tpo '≤' se agrega la variable de holgura X6.

- restriction 5 is of the type '≤' the slack variable X7 is added.

- Restriction 6 is of type '≥', the excess variable X8 is added and the


artificial variable X10.

- Restriction 7 is of type '≤' and the slack variable X9 is added.


We begin to build the first table of Phase I of the Two-Phase method.
The variable that comes out of the base is P9 and the one that enters is P1.

The variable that comes out of the base is P10 and the one that enters is P2.

Is there any possible solution to the problem, so we can move on to Phase II


to calculate it.
The variable that comes out of the base is P7 and the one that enters is P8.

The variable that goes out of the base is P6 and the one that enters is P9.

Z = 22720000 X1 = 64 X2 = 260

c) Minimize manufacturing costs.

Restriction 1 is of type '≤', the slack variable X3 is added.

Restriction 2 is of the type '≤' and the slack variable X4 is added.

Restriction 3 is of type '≤' the slack variable X5 is added.

Restriction 4 is of type '≤' the slack variable X6 is added.


Restriction 5 is of type '≤' the slack variable X7 is added.

Restriction 6 is of type '≤' the slack variable X8 is added.

Restriction 7 is of type '≤' the slack variable X9 is added.

Pasamos a construir la primeratabla del método Simplex.

Z = 0 X1 = 0 X2 = 0
EXERCISE 13.

The company W.W has only three employees who make two types of windows by hand: with
wooden frame and aluminum frame. The profit is $60 for each window with a frame
made of wood and $30 each with an aluminum frame. Doug makes wooden frames and
can determine 6 a day. Linda makes 4 aluminum frames per day. Bob shapes and cuts the glass and
It can make 48 square feet of glass per day. Each window with a wooden frame uses 6 feet.
glass squares and each of aluminum, 8 square feet. The company wants to determine
how many windows of each type should be produced daily to maximize total profit.

Constraint 1 is of type '≤' and the slack variable X3 is added.

Restriction 2 is of type '≤' the slack variable X4 is added.

Constraint 3 is of type '≤' and the slack variable X5 is added.

We proceed to build the first table of the Simplex method.

The variable that comes out of the base is P3 and the one that enters is P1.
The variable that exits the base is P5 and the one that enters is P2.

Z = 405 X1 = 6 X2 = 1.5

EXERCISE 14.

The Apex Television Company must decide the number of 27 and 20 inch televisions.
produced in one of its factories. Market research indicates sales of no more than 40
27-inch televisions and 10 20-inch televisions each month. The maximum number of man-hours
Available is 500 per month. A 27-inch television requires 20 man-hours and one of
20 requires 10. Each 27-inch television produces a profit of $120 and each of 20.
produce $80 profit. A distributor agrees to buy all the televisions.
produced if the number does not exceed the maximum indicated by the market study.

Restriction 1 is of the type '≤' and the slack variable X3 is added.

Constraint 2 is of the type '≤', the slack variable X4 is added.

The restriction 3 is of the type '≤' and the slack variable X5 is added.
We proceed to build the first table of the Simplex method.

The variable that exits the base is P5 and the one that enters is P1.

The variable that exits the base is P4 and the one that enters is P2.
Z = 3200 X1 = 20 X2 = 10

EXERCISE 15.

The WL company produces two devices for lamps (products 1 and 2) that require parts.
of metal and electrical components. The management wants to determine how many units of
each product is made to maximize profit. For each unit, they require 1 unit of
metal parts and 2 electrical components. For each unit of product 2, 3 are needed.
units of metal parts and 2 units of electrical components. The company has 200.
units of metal parts and 300 of electrical components. Each unit of product 1 provides
a profit of $1.00 for each unit of product 2, up to 60 units, gives a profit of $
2.00. Any excess of 60 units of product 2 has no profit, so producing
more than 60 is out of consideration.

Formulate the LP model, solve it using the graphical method, and determine the total profit.
result.
Development

Constraint 1 is of the type '≤' and the slack variable X3 is added.

-The restriction 2 is of type '≤' the slack variable X4 is added.

Restriction 3 is of type '≤', the slack variable X5 is added.


We proceed to construct the first table of the Simplex method.

The variable that comes out of the base is P5 and the one that enters is P2.

The variable that comes out of the base is P3 and the one that comes in is P1.

The variable that exits the base is P4 and the one that enters is P5.
Z = 175 X1 = 125 X2 = 25

EXERCISE 16.

The Omega manufacturing company discontinued the production of a certain line of products.
profitable. This created a considerable excess in production capacity. Management wants
dedicate this capacity to one or more of the three products, called product 1, 2, and 3. In the
The following table summarizes the available capacity of each machine that may limit the
production

Available time
Tipo de Máquina (in hours per week)

Milling machine 500


I return 350
Rectifier 150

The number of machine hours required for each unit of the respective products is:

Productivity coefficient (in machine hours per unit)

Type of machine Product 1 Product 2 Product 3


Milling machine 9 3 5

I return 5 4 0
Rectifier 3 0 2
The sales department indicates that the potential sales for products 1 and 2 exceed
maximum production capacity and that the potential sales of product 3 are 20 units per
week. The unit profit would be $50, $20, and $25 for products 1, 2, and

3. The objective is to determine how many products of each type the company should produce to
maximize profit.

Development

Restriction 1 is of type '≤', the slack variable X4 is added.

Restriction 2 is of the type '≤', the slack variable X5 is added.

The restriction 3 is of the type '≤' the slack variable X6 is added.


The restriction 4 is of the type '=' the artificial variable X7 is added.

We move on to construct the first table of Phase I of the Two-Phase method.


The variable that exits the base is P7 and the one that enters is P3.

Is there any possible solution to the problem, so we can move on to Phase II to


calculate it.

The variable that exits the base is P6 and the one that enters is P1.
The variable that leaves the base is P4 and the one that enters is P2.

The variable that comes out of the base is P5 and the one that comes in is P6.

Z = 2904.7619047619 X1 =26.190476190476 X2 = 54.761904761905 X3 = 20

You might also like