0% found this document useful (0 votes)
5 views16 pages

Linear Programming Optimization Problems

This document presents 7 operational research problems related to resource optimization through linear programming. Each problem describes a specific situation involving variables, constraints, and an objective function, and asks to develop a mathematical model to find the optimal solution.
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)
5 views16 pages

Linear Programming Optimization Problems

This document presents 7 operational research problems related to resource optimization through linear programming. Each problem describes a specific situation involving variables, constraints, and an objective function, and asks to develop a mathematical model to find the optimal solution.
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

OPERATIONS RESEARCH

PROBLEMS

PROBLEMA 1:

A company has three production plants for two different products.


A and B, the first plant produces item A and does not produce item B.
consume one unit of raw material from a total available of 4.
the second floor does not produce item A but does produce item B and
consume to build article B two units of raw material of a
total available capacity of 12. The third floor produces items
A and B use three units of raw material to construct article A and
two units of raw material to build item B out of a total of
18 units of available capacity. The utility per unit is 3.
dollars and 5 dollars. Create a linear programming model for
maximize resources.

Plant Product Capacity used by Available capacity


production plant
A B
1 1 0 4
2 0 2 12
3 3 2 18
Utility per unit 3.0 5.0

Decision Variables
XA = number of items of A
XB = number of items of B
2. Objective Function
Zmax = 3XA + 5XB
(X number of articles from A for their usefulness + X number of articles from
B for its usefulness).
3. Restrictions
Subject A:
1XA + 0XB 4
2) 0XA + 2XB 12
3) 3XA + 2XB 18
4) XA, XB > 0 No negativity
GRAPHICAL SOLUTION OF LINEAR PROGRAMMING
Step 1: define the model
Step 2: graphically represent the constraints.
. Classes of solution
a. Basic solution: obeys positive variables
b. Degenerate basic solution: the decision variables have a
value equal to zero.
c. Basic feasible solution: the feasible solution area is (A B C D E
Within the feasible solution area is the area that generally
at the vertices Zmax = (2,6)

Step 2: graphical representation of the objective function


Zmax = 3XA + 5XB
15 = 3.0XA + 5.0XB
XB = 0, XA =5.0; XA = 0, XB = 3.0
Step 4: identify the Zmax: when we are maximizing, we shift the
objective function on the area of feasible solution in the sense that it increases the
solución hasta el último punto que toque el área de solución factible.
Step 5: analyze the vertices:
If we have a Zmax = 3XA + 5XB
A (0, 0) Zmax = 0
B (4, 0) Zmax = 12
C (4,3) Zmax = 27
D (2,6) Zmax = 36
E (0.6) Zmax = 30
To minimize a linear programming system, we shift the function
objective parallelly in the opposite direction, and the last point to touch the area
The feasible solution is the minimal solution.
. Multiple solution: when the slope of the objective function is equal to the slope of
a constraint, any of the points on the constraint line is a maximum solution.

PROBLEM 2:

A company has three mines, the ore from each of them is separated.
before embarking on two different qualities the capacity of
daily production from the mines as well as their daily operating costs,
they are the following:

My height Mine low degree Operating cost


grade (ton/day) (ton/day) $1000 a day
Mine 1 40 40 20
Mina 2 60 40 22
Mine 3 40 60 18

The company committed to delivering 54 tons of high-grade ore and 65


Low grade mineral tone for the end of next week. It also has
work contracts that guarantee mine workers payment of the
full day or fraction during which the mine is open.
Determine the number of days that each mine should operate during the following
week, if the mine must fulfill the commitment at a minimum total cost.

Solution:
a) Initialize Variables
X1 = # horas Mina 1
X2 =# hours Mine 2
X3 =# hours Mine 3
b) Objective Function
Zmin = 20X1 + 22X2 + 18X3
c) Restrictions
40X1 + 60X2 + 40X3 ≥ 54 Ton
40X1 + 40X2 + 60X3 ≥ 65 Ton

GRAPHIC SOLUTION
PROBLEM 3:

A company produces 2 types of coal X1 (Special Compliences) and X2.


(special) the administrative expenses incurred by the company in
producing and washing the two types of coal are done by hand labor, for
It costs $20 to produce X1, and it costs $40 to produce X2.

Class X1 Class X2
Labor 20 15
Washing machine plant 4.0 2.0
Maintenance equipment 5.0 5.0
Gains 8.0 5.0
The amount of production is limited.
Labor salary 150,000 U$/month
Washing plant 50,000 U$/month
Equipment maintenance 90,000 U$/month
What amount of carbon X1 and X2 should be produced per month to maximize the
earnings?

Solution:
a. Initialize Variables
X1 = Special Compliance
X2 = Special
b. Objective Function
Zmax = 8X1 + 5X2
c. Restrictions
Subject A:
20X1 + 15X2 150,000 USD/month;
(Labor restriction to not exceed 150,000 USD/month)
2) 4X1 + 2X2 50000U$/month; (restriction by washing plant)
3) 5X1 + 5X2 90000 USD/month
(Restriction so that maintenance does not exceed 90000)
4) XA, XB > 0 No negativity

GRAPHICAL SOLUTION

PROBLEM 4:

A bakery produces 3 types of cakes using flour, sugar,


eggs and flavors, in addition to the baking operation the following table
shows the consumption of raw materials and the baking time by
kilograms of each type of cake besides the quantities in
inventory of raw materials and available oven hours.

Flour Sugar Eggs Oven Turn flavors


(Kg) (Kg) unit (CC) hours
Pound cake 1 0.6 0.23 4 90 0.85
Cake 2 0.7 0.18 5 110 1.20
Pound Cake 3 0.65 0.25 4 150 0.90
Availability 180 100 1000 9000 120
total

The utility of each type is:


2900U$/Kg
3100 USD/Kg
3000U$/Kg
before starting the day, management informs that at least
12 Kg of cake 1, to fulfill a last-minute order that they could not
more than 25 Kg of cake 3 due to packaging exhaustion.
How many kg of each type of cake should be produced to maximize the
usefulness of the bakery during the day?

PROBLEM 5:

A cement distribution company has two distribution centers.


that can serve daily 400 to 450 tons. The company celebrated
a distribution contract for 3 works that require daily 300, 400
and 250 tons of material, the transportation costs per ton between
The distribution centers and the works are shown in the following table.

Work 1 Work 2 Work 3


Centro 1 350 420 200
Center 2 180 210 360

The company wants to know how to meet the demand for works from the centers.
of distribution, minimizing transportation costs. Develop the model of
linear programming.

PROBLEM 6:

an individual has three properties of a certain extent each and with


certain specific irrigation characteristics, according to the region, in
each of them is; a summary of the characteristics
appears below in the table:

Farm hectares Water (ft³/ha)


1 400 1500
2 600 2500
3 300 900
Total 1300

There are also three different classes of plants that can be cultivated; wheat,
barley and corn, each of them has restrictions on the number of
hectares that can be cultivated based on water consumption per hectare and
each one is associated with a utility per cultivated hectare.

Cultivation Max # hectares Consumption of Utility/Ha


water/Ha $
Wheat 700 5 400
Barley 800 4 300
Corn 300 3 100
Due to government regulations, it is not possible to have different percentages.
of cultivated areas in the 3 farms. The owner wonders what should be the
distribution of crops on each of the farms in a way that maximizes the
utility generated by the sale of the harvested product?

PROBLEM 7:

mining company (offers) sells four different types of coal


coal grades) can be exploited by two completely different methods.
different, one of which consists of two processes and the other of three; the
selling price of the coals and the costs as well as the quantities
available for sale are:

1 2 3 4
A Price of 15,000 12.000 10,000 8.000
sale
Cost per 12,000 9,000 7,500 6.500
method A
Cost per 16,000 10.500 2.000 7,000
method B
Sale in 30,000 40,000 50,000 35,000
tons

The occupation in the processes to fulfill a period with the production like this.
as the available time slots are:

1 2 3 4 Availability
METHOD
A
Process 1 3.5 h 3.6 h 3.0 h 1.0 h 12,000 h
Process 2 5.0 h 4.5 h 3.2 h 1.5 h 20,000 h
Process 3 2.5 h 2.0 h 1.5 h 1.2 h 7,000 h
METHOD
B
Process 1 4.0 h 3.5 h 2.0 h 3.0 h 13,000 h
Process 2 4.5 h 4.0 h 3.0 h 2.0 h 10,000 h
What measures should the company's management take to maximize
total utility, considering production and production times.

PROBLEM 9:
Substances 1, 2, and 3 are available that contain vitamins A, B, and C.
The following table shows the vitamin content in millions of
units/Kg:

Vitamin A Vitamin B Vitamin C

Substance 1 5 3.5 6.0

Substance 2 7 8.0 2.5

Substance 3 2.5 6.5 5.0

It is desired to prepare 100kg of a compound using the substances that


contain at least 600 million units of vitamin A, 450 million of
units of vitamin B, 400 million units of vitamin C. The cost of
each of the substances is $105/Kg, $130/Kg, $180/Kg respectively.

What amounts of each substance should be mixed to obtain the


composed, with the specifications given at the minimum cost?
Solution:

PROBLEM 10:

The three princes of Serendip went to visit Paris. They could not
carry too much weight; over 300 pounds was excessive. They discovered when
they were returning to Ceylan and their supplies were almost out. Suddenly
Prince William saw a bunch of coconuts under a bridge by chance.
"They will give us 60 rupees for a coconut," said Ricardo in the middle of the great
commotion.
Meanwhile, Prince Robert carefully discovered beautiful furs of
lion in a cave. "If we can take her to Ceylon," said the lucky one, "we...
they will give 300 rupees for each skin and in cash." Although each skin weighs 15 pounds and
each coconut five, they managed to bring everything to the beach with great effort. At the beach
they found a very small boat, it only carried 15 cubic feet, but it didn't have
owner. One cubic foot covered each lion's skin. And for eight coconuts this same
volume Serbia.
With the ship optimally loaded, they set sail, calculating the fortune they were going.
to win. "The profit will be very big," said Guillermo. "In any other
she would have a reduction; a different combination of skins and coconuts,
it would make us less rich, and I would burst into tears." "I have an idea"
Ricardo said with great joy, 'Let's ask the students at UPTC.'
Ingeniería de Minas cuantas pieles y cuantos cocos nosotros los inteligentes
princes of Serendip we brought from our fabulous spree through Paris.
PROBLEM 11:

There are 120 caffeinated cola sodas and 180 non-caffeinated cola sodas.
caffeine. The soft drinks are sold in packages of two types. The type packages
Type A contains three caffeinated sodas and three caffeine-free, and type B contains
two with caffeine and four without caffeine. The seller earns 6 euros for each package
What sells type A and 5 euros for each one sold of type B. Calculate from
reasoned way how many packages of each type should be sold to maximize the
benefits and calculate this.
PROBLEM 12:
It is intended to cultivate two types of olives on a piece of land: A and B. It is not allowed to.
cultivate more than 8 ha with type A olives, nor more than 10 ha with olives of
Type B. Each hectare of type A olives needs 4 m3 of water annually.
and each of type B, 3 m3. An annual total of 44 m3 of water is available.
Each hectare of type A requires an investment of 500 € and each one of
tipo B, 225 €. Se dispone de 4500 € para realizar dicha inversión. Si cada
hectare of olive grove type A and B produce, respectively,
500 and 300 liters annually of oil:
a) Reasonably obtain the hectares of each type of olive that are needed.
to plant in order to maximize oil production.
b) Obtain the maximum production.

PROBLEM 13:
A company manufactures two models of sofa covers, A and B, which leave
benefits of 40 and 20 euros respectively. For each case of
Model A requires 4 hours of work and 3 units of fabric. For
To manufacture one of model B, 3 hours of work and 5 units are required.
of fabric. The company has 48 hours of work and 60 units of
fabric. If I add them up, 9 covers of model A can be made. How many
Covers for each model must be manufactured to achieve the maximum.
benefit and what would it be?

PROBLEM 14:
We have 21,000 euros to invest in the stock market. We are recommended two
types of shares. Type A shares, which yield 7%, and type B shares, which
They yield 9%. We decided to invest a maximum of 13,000 euros in those of the type.
And at least 6000 in type B. Furthermore, we want that the
investment in type B should be less than double the investment in A.
What should the distribution of the investment be to achieve the maximum?
annual interest?
PROBLEM 15:
We have 210,000 euros to invest in the stock market. We are recommended
two types of shares. Type A, which yield 10%, and type B,
that yield 8%. We decided to invest a maximum of 130,000 euros in the
of type A and at least 60,000 in type B. In addition, we want
that the investment in type A is less than double the investment
In B. What should be the distribution of the investment to obtain the
maximum annual interest?

PROBLEM 16:
In a pastry shop, two types of cakes are made: Viennese and Royal. Each cake
Vienna needs a quarter of filling for each kg of sponge cake and produces
a benefit of 250 Pts, while a Real cake needs half a Kg.
of filling for each kg of cake and produces 400 Ptas. of profit. In
The pastry shop can produce up to 150 kg of cake and 50 daily.
Kg. of filling, although due to machinery problems they cannot make.
more than 125 cakes of each type. How many Viennese cakes and how many
How many must be sold per day for maximum profit?

PROBLEM 17:
A school is preparing a trip for 400 students. The company of
Transport has 8 buses with 40 seats and 10 buses with 50 seats.
but only has 9 drivers. The rental of a large coach
it costs 80 euros and the small one costs 60 euros. Calculate how many of
each type needs to be used so that the excursion is as
possible economical for the school.
PROBLEM 18:
A company owns two mines: mine A produces 1 ton every day.
3 tons of high quality iron, 3 tons of medium quality and 5 tons of low quality.
Mine B produces 2 tons of each of the three every day.
qualities. The company needs at least 80 tons of ore
high quality, 160 tons of medium quality and 200 of low quality.
Knowing that the daily cost of the operation is 2000 euros in each
mine how many days must each mine work for the cost to be
minimum?
PROBLEM 19:
A layout of an automobile workshop is going to be organized where they are going to
to work electricians and mechanics. Due to market needs, it is
it is necessary to have an equal or greater number of mechanics than
electricians and that the number of mechanics does not exceed double that of
electricians. In total, there are 30 electricians and 20 mechanics. The
The company's profit per shift is 250 euros per electrician and 200
euros per mechanic. How many workers of each type should be chosen?
to obtain the maximum benefit and what is it?

PROBLEM 20:
To cover a certain route, an airline wants to
offer, at most, 5000 spots of two types: T(tourist) and P(first). The
The profit corresponding to each type T spot is 30 euros.
while the profit from type P is 40 euros.
The number of type T spaces cannot exceed 4500 and the type P must be,
at most, one third of those of type T that are offered.
Calculate how many of each class need to be offered for the profits
maximum limit.
Solution:

no. Profit
Tourist x 30x
First y 40y
Total 5000 30x + 40y
The objective function is:
f (x, y) = 30x + 40y

The restrictions:

The feasible region:

The vertices, A(0, 5000), B(3750, 1250), C(4500, 500) and D(4500, 0) (check
point B solving the corresponding system)
The graphical method tells us that the solution point is B (3750, 1250)
PROBLEM 21:

The fishing restrictions imposed by the EEC require certain


company to fish a maximum of 2,000 tons of hake and 2,000
tons of monkfish, in addition, in total, the catches of these two species
They cannot exceed 3,000 tons. If the price of hake is 1,000.
Bs/kg and the price of monkfish is 1,500 Bs/kg, what quantities should be fished?
to obtain the maximum benefit?

Let the decision variables be:


x = número de toneladas de merluza y = número de toneladas de rape
From the statement, we deduce the restrictions:
Up to 2000 tons of hake: x 2000
A maximum of 2000 tons of monkfish: and 2000
The catches of these two species cannot exceed 3000 tons.
+ y 3000

The objective function that gives the profit in thousands of pesetas and that must be
maximization is given by: f(x,y) = 1000x + 1500y

Representing the lines: x = 2000, y = 2000, x + y = 3000


corresponding to the boundaries of the restrictions we obtain the region
feasible
Where the obtained vertices are: A(2000,0); B(2000, 1000); C(1000,
2000), D(0,2000) and O(0,0)

By substituting their coordinates into the objective function f, it results in:

f(A) = 2000 millones de ptas. ; f(B) = 3500 millones de pesetas; f(C) = 4000
millions of pesetas; f(D) = 3000 million pesetas and f(O) = 0 pts.

The objective function reaches its maximum at vertex C, so the


the amounts to be fished are 1000 tons of hake and 2000 tons of
rape.

PROBLEM 22:

Two paintings A and B both have two types of pigments p and q; A is


composed of 30% p and 40% q, B is composed of a
50% of p and 20% of q, the rest being colorless. A and B are mixed with
the following restrictions:
The quantity of A is greater than that of B. Their difference is not less than
10 grams and does not exceed 30 grams. B cannot exceed 30.
grams nor be less than 10 grams.

a. Which mixture contains the highest amount of pigment p?


b. What mix does minimum make?

Let x be the grams of paints A and B respectively that


they appear in the mix. Let's translate the restrictions into inequalities
those that must be subjected to those amounts.

The amount of A is greater than that of B: x > y

Its difference is not less than 10 grams and does not exceed 30 grams:
30 > x - y > 10
B cannot exceed 30 grams or be less than 10 grams: 30> and

>10.

Moreover, we know that: >x0, y>0.

Let's look at the amounts of pigment of each type:

Amount of type p pigment: Fp (x, y) = 0.3x + 0.5y


type q pigment: Fq (x, y) = 0.4x + 0.2y

The feasible region is:

Its vertices are A(20,10), B(40,10), C(60,30), and D(40,30)

a) The largest amount of pigment p is produced for 60 grams of the


painting A and 30 of B: Fp (40,30) = 0.3·40 + 0.5·30 = 27; Fp (20,10) =
11 ; Fp (40, 10) = 17; Fp (60, 30) = 33

b) The smallest amount of pigment q is produced for 20 grams of the


paint A and 10 of B: Fq (40, 30) = 0.4·40 + 0.2·30 = 22; Fq (20, 10) =
10 ; Fq (40, 10) = 18 ; Fq (60, 30) = 30

PROBLEM 23:
On a chicken farm, a 'fattening' diet is provided with a
minimum composition of 15 units of a substance A and another 15 of
a substance B. In the market, only two classes of are found.
compounds: type X with a composition of one unit of A and five
of B, and type Y, with a composition of five units of A and one of
The price of type X is 1000 pesetas and that of type Y is 3000.
pesetas. One asks:
What quantities need to be purchased of each type to cover the
needs at a minimal cost?

Unidades Sustancia A Sustancia B Cost


Compound X x x 5x 1000x
Compound Y y 5y y 3000y
Total 15 15 1000x + 3000y

The objective function of the total cost, f, if x kg of compound X and y are used
kg of compound Y is:
Z = f(x,y) = 1000x + 3000y
El conjunto de restricciones es: x >0, y > 0; x + 5y >15; 5x + y > 15.

With this data, we represent the feasible region and the level curves of the
objective function.

Of all the level curves that touch the feasible region, it makes the cost
It is at least the one that passes through vertex A (2.5, 2.5).
The optimal solution is obtained by purchasing 2.5 units of X and 2.5 units.
from Y.
The total cost is: Z = f(2.5,2.5) = 1000·2.5 + 3000·2.5 = 10,000 bolivars

PROBLEM 24:
An individual has three farms of a certain size. Each one
it has certain specific characteristics of appropriate irrigation to the
region, and each of them has a summary of those
features that appear below.

Farm Hectares Water ft3/Ha


1 400 1500
2 600 2500
3 300 900
total 1300 4900

There are also three different classes of plants that can be cultivated.
wheat, barley, corn, each of them has restrictions on the number of
hectares that can be cultivated. On water consumption per hectare, and
each one is associated with a utility per cultivated hectare

cultivation Maximum Number of Consumption of Profit $/Ha


hectares water ft3/ha
Wheat 700 5 400
Barley 800 4 300
Corn 300 3 100

By government order, it is not possible to have different percentages of


cultivated areas in the three farms, the owner wonders what should be the
crop arrangement in each of the farms in a way that maximizes the
profit generated from the sale of the harvest product.
j = Number of crops T, C, M

You might also like