Problem 20:

(Ecology) A fish pond supplies them every spring with two species of
Fish S and T. There are two types of food F.1y F2available in the pond. The weight
average of the fish and the average daily food requirement for each fish of
each species is given in the following table:

Species F1 F2 Average Weight

S 2 Units 3 Units 3 pounds
T 3 Units 1 Units 2 pounds

If there are six hundred of F1and three hundred of F2Every day. How do you debit supply?
The pool for what the total weight of fishes is at least 400 pounds?

Solution:

What are we going to Maximize?

x1the Supply Amount of Fish (SPECIES S) in Spring in Units

x2the Supply Quantity of Fish (SPECIES T) in Spring in Units

Max Z = x1+ x2…….(1)

Subject to:
2x1+ 3x2< 600 …….. (2)
3x1+ 1x2< 300 ……….(3)
3x1+ 2x2400 what remains Proposed
x1, x20

Problem 21:

A farmer has 200 pigs that consume 90 pounds of special food every
days. The food is prepared as a mixture of corn and soybean flour with the
following compositions:
Pounds per Pound of Food
Food Football Protein Fiber Cost ($/lb)
Corn 0.001 0.09 0.02 0.2
Soy Flour 0.002 0.6 0.06 0.6

The dietary requirements of pigs are:

1. At least 1% calcium
2. At least 30% protein
3. Maximum 5% fiber

Determine the food mix with the minimum cost per day.
Solution:

What are we going to minimize?

x1the Amount of Corn Pound for pound of Food
x2The amount of soybean flour per pound of food

Min Z = 0.2x1+ 0.6x2

Subject to:
0.001x1+ 0.002x2< (90)(0.01) …….. (2)
0.09x1+ 0.6x2(90)(0.3) ……….(3)
0.02x1+ 0.06x2(90)(0.05) .......... (4) what remains proposed
x1, x20

Problem 22:

A small bank allocates a maximum of $20,000 for personal loans and for
cars during the next month. The bank charges an annual interest rate of 14%
12% for personal loans and 12% for car loans. Both types of
loans are settled in periods of three years. The amount of the loans for
car must be at least more than twice the amount of the loans
personal. Past experience has shown that uncovered debts
they make up 1% of all personal loans How should they be allocated
funds?

Solution:

What are we going to maximize?

x1the Amount of Personal Loan Funds
x2the amount of car loan funds

Min Z = 0.2x1+ 0.6x2......(1)

Subject to:
(0.14)(20,000)x1+ (0.12)(20,000)x2< 20000 …….. (2)
x2(2)(0.14)(20,000) ……….(3)
x1(0.01)(0.12)(20,000) .......... (4) what remains proposed
x1, x20

Problem 23:

A radio assembly plant produces two models HiFi-1 and HiFi-2 on the same line
assembly. The assembly line consists of three stations. The times for
assembly in the workstations are:
 Minutes per Unit of Minutes per Unit of
Workstation HiFi-1 HiFi-2
1 6 4
2 5 5
3 4 6

Each workstation has a maximum availability of 480 minutes per day. Without
embargo, the workstations require daily maintenance, which contributes to
10%, 14% and 12% of the total 480 minutes available daily for
stations 1, 2, and 3 respectively. The company wishes to determine the units
daily that will be assembled from HiFi-1 and HiFi-2 in order to minimize the sum of non-time
used (inactive) in the three stations.

Solution:

What are we going to minimize?

x1the Daily Unit Amount of HiFi - 1

x2the Amount of Daily HiFi Units - 2

Min Z = x1+ x2…….(1)

Subject to:
6x1+ 4x2(0.1)(480) …….. (2)
5x1+ 5x2< (0.14)(480) ……….(3)
4x1+ 6x2(0.12)(480) .......... (4) what remains stated
x1, x20

Problem 24:

An electronic products company produces two radio models, each in

a production line of different volume. The daily capacity of the first line
it is 60 units and the second is 75 radios. Each unit of the first model uses
10 pieces of certain electronic components, as long as each unit of the second
models require eight pieces of the same component. The maximum daily availability
The special component consists of 800 pieces. The profit per unit for models 1 and 2 is
$30 and $20, respectively. Determine the optimal daily production of each model.
radio.

Solution:

What are we going to maximize?

x1the production quantity of model 1 of Radio

x2the Production quantity of model 2 of Radio
30x1+ 20x2…….(1)
Subject to:
x1< 60 …….. (2)
10 times1+ 8x2< 800 ……….(3)
x2< 75 .......... (4) what remains stated
x1, x20

Problem 25:

Two products are produced by passing successively through three machines. The time for
machine assigned to the products is limited to 10 hours per day. The time of
production and the profit per unit of each product are:
Minutes Per Unit
Product Machine 1 Machine 2 Machine 3 Profit
1 10 6 8 $2
2 5 20 15 $3
Note: Determine the optimal combination of products.

Solution:

What are we going to minimize?

x1the Quantity of Units of Product 1

x2the Quantity of Units of Product 2

Min Z = 2x1+ 3x2…….(1)

Subject to:
10x1+ 5x2< 10 …….. (2)
6x1+ 20x2< 10 ……….(3)
8x1+ 15x2what remains posed
x1, x20

Problem 26:

A company can advertise its product through the use of radio and television stations.
Their budget limits advertising expenses to $1000 per month every minute of
A radio ad costs $5 and each minute of advertising on television costs $100.
the company would like to use the radio at least two times more than television.
past experience shows that every minute of television advertising will generate in terms
General 25 more sales than every minute of advertising on the radio. Determine the allocation.
optimal monthly budget for radio and television advertising.

Solution:

What are we going to maximize?

x1the monthly budget amount for the Radio
x2the amount of monthly budget for the television

Max Z = x1+ x2
Subject to:
5x1+ 100x2< 1000 …….. (2)
x2(2)(x1)
x1(25)(x2
x1, x20

Problem 27:

A company produces two products: A and B. The sales volume of product A is

at least 60% of the total sales of the two products. Both products
They use the same raw material, whose daily availability is limited to 100 lbs.
products A and B use this raw material at rates of 2 lb/unit and 4
lb/unit, respectively. The selling price of the products is $20 and $40 per
unit. Determine the optimal allocation of raw materials to the two products.

Solution:

What are we going to maximize?

x1the Quantity of Units of Product A

x2the Quantity of Units of Product B

Max Z = 20x1+ 40x2…….(1)

Subject to:
2x1+ 4x2< 100 …….. (2)
x1(0.6)(60) ……….(3)
x1, x20

Problem 28:

A company manufactures two types of hats. Each hat of the first type requires
twice as much labor time as a second type product. If all the
hats are exclusively of the second type. The company can produce a total of
500 units per day. The market limits daily sales of the first and second types to
150 and 200 units. Suppose the profit obtained per product is $8 per
type 1 and $5 for type 2. Determine the number of hats of each type that must
developing to maximize profit.

Solution:
What are we going to maximize?

x1the Quantity of Units of Hat TYPE 1

x2the Quantity of Units of Hat TYPE 2

Max Z = 8x1+ 5x2…….(1)

Subject to:
150x1+ 200x2< 500 …….. (2)
x1(2)(200) ……….(3)
x1, x20

Problem 29:

A small company has two machines to produce two products. Each

The product has to go through machine A and then through machine B. Product 1
requires 3 hours from machine A and 2 from machine B, while product 2
It requires 1 hour of machine A and 2 hours of machine B. The capacity of the
Machine A and B are 500 and 650 weekly hours respectively. Product A leaves 350.
The first product leaves 600 pesos in profits, and the second product B leaves 600 pesos in profits. You analyze the situation.

from the operation of this, since due to a shortage of raw material it cannot produce more
of 21 units of the product.

Solution:

What are we going to maximize?

x1the Quantity of Units of Product A

x2the Quantity of Units of Product B

Max Z = 350x1+ 600x2

Subject to:
3x1+ 1x2< 500 …….. (2)
2x1+ 2x2< 650 …….. (3)
x1+ x2< 21 ......(4)
x1, x20

Problem 30:

The group 'IMPEXA' wants to advertise its products in three different ways.
media: radio, television, and magazine. The main objective is to reach as many clients as
It is possible. They have conducted a study and the result is:

Durante el día
Number of clients 450,000 800,000 675,000 200,000
potentials that it can
reach by units of
advertising
500,000 1,000,000 650,000

"IMPEXA" does not want to spend more than $1,200.00. Also, on television advertising, no
They want to spend more than 750 thousand pesos. They want to buy three television units.
during the day and 2 units at night. Formulate the problem as a model of
linear programming.

Solution:

What are we going to MAXIMIZE?

x1the number of potential customers per day

x2the Number of Potential Clients per night
x3the number of customers per radius
x4the number of clients by magazines

Max Z = x1+ x2+ x3+ x4…….(1)

Subject to: (BALANCE RESTRICTIONS)
x1+ x2+ x3+ x4< 1,200,000
x1+ x2< 750,000
x1450,000
x1< 500,000
x2800,000
x2< 1,000,000
x3375,000
x3< 650,000
x4200,000
x4< 250,000
3x1< 2x2

Problem 31:

Mrs. Morales has a diet to follow, which meets the following requirements
nutritional.
At least 4 mg of vitamin A
At least 6 mg of vitamin B
At most 3 mg of vitamin D

Likewise, the diet consists of bread, cheese, beef, and meat. The following table gives us
provide the requirements per vitamin in mg, as well as the cost
Content in mg per gram of product

PRODUCT COST VITAMIN A VITAMIN B Vitamin D

PAN 40 0.20 0.18 0.10
 CHEESE 31 0.15 0.10 0.14
Goodbye 19 0.15 0.40 0.15
MEAT 53 0.30 0.35 0.16

Solution:

What are we going to minimize?

x1the quantity to buy of bread

x2the quantity to buy of cheese
x3the quantity to buy of egg
x4the amount to buy of MEAT

Min W = 40x1+ 31x2+ 19x3+ 53x4…….(1)

Subject to:
0.20x1+ 0.15x2+ 0.15x3+ 0.30x44
0.18x1+ 0.10x2+ 0.40x3+ 0.35x46
0.10x1+ 0.14x2+ 0.15x3+ 0.16x43
x1, x2, x3, x40

Problem 32:

Julio, who is an investment advisor, has 4 projects presented to him with their
respective costs over a period of three years, as well as the total profit. It requires
maximize total utility having $50,000; $24,000; and $30,000 in each of
the following years:
PROJECT USEFULNESS COST COST COST
TOTAL YEAR 1 YEAR 2 YEAR 3
X1 100 6 14 5
X2 90 2 8 14
X3 75 9 19 18
X4 80 5 2 9

Solution:

What are we going to minimize?

x1the Amount of Corn Pound for Pound of Food

x2the Amount of Soy Flour per Pound of Food

Min Z = 0.2x1+ 0.6x2…….(1)

Subject to:
0.001x1+ 0.002x2< (90)(0.01) …….. (2)
0.09x1+ 0.6x2< (90)(0.3) ……….(3)
0.02x1+ 0.06x2(90)(0.05) .......... (4) what remains posed
x1, x20
Availability:
The available amounts per year are allocated to different variables or projects.
under these restrictions to optimize or maximize total utility.

Problem 33:
Suppose that the Agricultural Credit Bank has two investment plans.
the first in the irrigation land program, the second in the
temporary lands. The first program returns 30% of the investment at the end of the year.
while the second plan returns 65% of the investment, for the term of two
years. The interest received in both plans is reinvested again in either.
of both plans. Formulate the linear program that allows the bank to maximize the
total investment in a six-year period, if the investment is $100 million.

Solution:

What are we going to MAXIMIZE?

xiRthe amount of risky investment for one year i

xitthe Amount of Temporary Investment in 2 years i
where i = 1, 2, 3, 4, 5, 6.

Max Z = x1+ x2+ x3+ x4…….(1)

Subject to: (BALANCE RESTRICTIONS)
x1R+ x1T< 100,000
x2R+ x2T< 1.30x1R
x3R+ x3T< 1.30x2R+ 1.65x1T
x4R+ x4T< 1.30x3R+ 1.65x2T
x5R+ x5T< 1.30x4R+ 1.65x3T
x6R< 1.30x5R+ 1.65x4T
x1T, xR0

Problem 34:

A perfume company can advertise its product through the use of stations.
from radio and television. Its budget limits advertising expenses to $1,500 per month.
Every minute of advertising on the radio costs $15 and every minute of advertising on
The television costs $90. The company would like to use the radio at least twice.
more than television. Historical data shows that each minute of advertising for
television will generate in general terms 30 times more sales than every minute of
radio advertising. Determine the optimal allocation of the monthly budget for
radio and television advertisements.

Solution:
What are we going to maximize?

x1the amount of monthly budget for the Radio

x2the monthly budget amount for the television

Max Z = x1+ x2…….(1)

Subject to:
15x1+ 90x2< 1500 …….. (2)
x2(2)(x1)
x1(30)(x2……(3)
x1, x20

Problem 35:
An animal store has determined that each hamster should receive less than 70.
units of protein. 100 units of carbohydrates and 20 units of fat. If the
The store sells the six types of food shown in the table. What mix of
Does the food meet the needs at a minimal cost for the store?

Food Proteins Carbohydrates Fat Cost

(Units / Ounce) (Units / Ounce) (Units / Onza
Onza
A 20 50 4 2
B 30 30 9 3
C 40 20 11 5
D 40 25 10 6
E 45 50 9 8
F 30 20 10 8

Solution:

What are we going to minimize?

x1the amount to be mixed of A

x2the amount to mix of B
x3the amount to mix of C
x4the quantity to mix of D
x5the amount to mix of E
x6the amount to mix of F

Min W = 2x1+ 3x2+ 5x3+ 6x4+ 8x5+ 8x6…….(1)

Subject to:
20x1+ 30x2+ 40x3+ 40x4+45x5+ 30x6< 70 ......... PROTEIN
50 times1+ 30x2+ 20x3+ 25x4+ 50x5+ 20x6< 100 ------ CARBOHYDRATES
4x1+ 9x2+ 11x3+ 10x4+ 9x5+ 10x6< 20 ---------- FAT
x1, x2, x3, x40
Problem 35:
A local manufacturing company produces four different metal products that
They must be machined, polished, and assembled. The specific time requirements (in
The hours for each product are as follows:

Machining Polished Assembly

Product I 3 1 2
Product II 2 1 1
Product III 2 2 2
Product IV 4 3 1

The company has 480 hours available weekly for machining, 400 hours for the
polished and 400 hours for assembly. The unit profits per product are $6, $4,
$6 and $8 respectively. The company has a contract with a distributor in which it
commits to delivering 50 units of product 1 and 100 units weekly.
any combination of products II and III, depending on the production, but only one
maximum of 25 units of product IV. how many units of each product should I
manufacture weekly by the company in order to meet all the conditions of the
contract and maximize total profit?
Consider the incomplete pieces as a Linear Programming model.

Solution:

What are we going to minimize?

x1the quantity to be produced of product I

x2the quantity to be manufactured of product II
x3the quantity to be manufactured of product III
x4the quantity to be manufactured of product IV

Min W = 6x1+ 4x2+ 6x3+ 8x4…….(1)

Subject to:
3x1+ 2x2+ 2x3+ 4x4< 480
1x1+ 1x2+ 2x3+ 3x4< 400
2x1+ 1x2+ 2x3+ 1x4< 400
x1> 50
x2+ x3100
x4< 25
x1, x2, x3, x40

Problem 36:

Four products are processed successively on two machines. The times for
Manufacturing hours per unit of each product are tabulated below for the
two machines:
 Machine Product 1 Product 2 Product 3 Product 4
1 2 3 4 2
2 3 2 1 2

The total cost of producing one unit of each product is directly based on the
machine time. Assume that the cost per hour for machines 1 and 2 is $10 and
$15. The total hours budgeted for all products on machines 1 and 2
They are 500 and 380. If the selling price per unit for products 1, 2, 3, and 4 is $65,
$70, $55, and $45, formulate the problem as a linear programming model for
maximize total net profit.

Solution:

What are we going to maximize?

x1the quantity to be produced of product 1

x2the quantity to be manufactured of product 2
x3the quantity to be manufactured of product 3
x4the quantity to manufacture of product 4

Max W = 65x1+ 70x2+ 55x3+ 45x4…….(1)

Subject to:
2x1+ 3x2+ 4x3+ 2x4< 500
3x1+ 2x2+ 1x3+ 2x4< 380
x1, x2, x3, x40

Problem 37:

Delta company has specialized machinery in the plastics industry.

the company is set to start operations next January and has
$300,000 and ten machines. The operation of each machine requires $4,000.00 in
beginning of a month to produce and at the end of the month the amount of $9,000.00 however,
For every two machines, an operator is needed whose monthly salary is $3000.00
paying at the beginning of the month. The company aims to plan its production, employment
of operator and purchase of machinery that must have, at the beginning of the seventh month, to the
maximum number of machines in operation.

At the beginning of each month, the company has three alternatives available for acquisition.
machinery. In the first option, you can buy a machine for $20,000.00 each.
with a delivery period of one month. That is, if at the beginning of each month 't' is requested and
Pay for the machinery, it will be delivered at the beginning of month t + 1.

In the second option, each machinery can be purchased for $15,000.00, but the
The delivery period is in two months. The last alternative is to buy for $10,000.00.
each machine with a delivery period of three months.
Formulate a linear programming model to determine the purchasing policy.
of machinery, production, and payment of operators each month, in such a way that
At the beginning of the seventh month, have the maximum number of machines in operation.

Solution:

What are we going to minimize?

x1the quantity to be manufactured of product I

x2the quantity to be manufactured of product II
x3the quantity to be produced of product III
x4the quantity to be manufactured of product IV

Min W = 6x1+ 4x2+ 6x3+ 8x4...

Subject to:
3x1+ 2x2+ 2x3+ 4x4< 480
1x1+ 1x2+ 2x3+ 3x4< 400
2x1+ 1x2+ 2x3+ 1x4< 400
x1> 50
x2+ x3100
x4< 25
x1, x2, x3, x40

Problem 38:

A chemical company that operates 24 hours a day has the

following needs for technical and specialized personnel

Period Time of the day Technical staff Personal

Specialized
1 6 - 10 20 8
2 10–14 40 12
3 14 – 18 80 15
4 18 – 22 45 9
5 22 – 02 25 3
6 02 - 06 10 2

Note that period 1 follows period 6. Consider that each person in the
The company works 8 consecutive hours. Suppose that Xty Zt, denote the number of
technical and specialized personnel, respectively, who begin to work at the start
from period t on each day. In this company, the labor agreement states that throughout
there should be at least three times the number of technical staff than that
specialized personnel. Establish a linear programming model to determine
the minimum number of technical and specialized personnel to meet the needs
work diaries in the company.

Solution:
 xiRthe number of technical staff
xitthe amount of specialized personality
where i = 1, 2, 3, 4, 5, 6.

Min Z = x1+ x2
Subject to:
20x1+ 8x2> 60
40x1+ 12x2120
80x1+ 15x2240
45x1+ 9x23 times 45
25x1+ 3x2> 75
10x1+ 2x2> 30

Problem 39:

National Railways of Mexico has the following demand at the beginning of next year
of diesel locomotives to occupy their system throughout the country:

Trimester 1 2 3
Locomotives 750 800 780
Diesel

The management of railways can meet their demand by combining

the following alternatives:

a) Use of the existence of diesel locomotives in working condition

b) Purchase of locomotives from abroad which can be delivered at the beginning
from any quarter
c) Repair locomotives in the national workshops on a normal basis. The time re
The repair is for 6 months.
d) Report locomotives at the national workshops urgently. The time
The repair period is 3 months.

Alternative b has a cost of $5,000,000 per locomotive.

Alternative c has a cost of $100,000 per locomotive.
The alternative d has a cost of $250,000 per locomotive

It is estimated that at the beginning of the year there will be 650 locomotives in working condition and the
the operating budget for that year is $100,000,000 delivered in installments
quarterly of 40, 30, 20 and 10 million respectively.

It is supposed that at the end of each quarter, 5% of the locomotives must be maintained.
repair and 5% are out of service. Formulate a programming problem
linear that allows determining the combination of policies that should be taken into account
management of railways to minimize costs and meet the demand for locomotives.
Solution:

What are we going to minimize?

x1the Demand Quantity in quarter 1

x2the Quantity of Demand in the second quarter
x3the Quantity of Demand in quarter 3

Min W = 5,000,000x1+ 100,000x2+ 250,000x3…….(1)

Subject to:
x1+ x2+ x3< 100,000,000
750x1+ 800x2+ 780x3650
x1(0.05)(750)
x2(0.05)(800)
x3> (0.05)(780)
x1, x2, x3, x40

Problem 40:

A company produces brown sugar, white sugar, powdered sugar, and molasses.
with the syrup from sugar cane. The company purchases 4000 tons of syrup from
the week and has a contract to deliver a minimum of 25 tons weekly of
each type of sugar. The production process begins by manufacturing brown sugar and
molasses with syrup. One ton of syrup produces 0.3 tons of sugar
brown sugar and 0.1 tons of molasses. After that, white sugar is produced by processing
brown sugar. 1 ton of brown sugar is required to produce 0.8 tons.
of white sugar. Finally, powdered sugar is made from white sugar by
through a special grinding process, which has a 95% conversion efficiency (1
ton of white sugar produces 0.95 tons of powdered sugar). The
utilidades por tonelada de azúcar morena, azúcar blanca, azúcar pulverizada y melazas
are 150, 200, 230, and 35 dollars, respectively. Formulate the problem as a
linear program.

Solution:
The production of each type of sugar according to the production process is detailed in
continuation per ton of material used.

Production per ton.

the brunette molasses white powder
Syrup (1tn) 0.3 0.1
Az. Morena (1tn) 0.8
Blanca (1tn) 0.95

We determine the decision variables:

Xi = product obtained (tons per week), where i: 1, 2, 3, 4; represents the
diferentes tipos de productos. 1: azúcar morena, 2: melaza, 3: azúcar blanca, 4:
powdered sugar.
The restrictions:
X1 / 0.3 + X2 / 0.1 <= 4000 (Restriction for syrup TN.)
X1 >=25000 (Restriction for brown sugar tn.)
X3 / 0.8 >= 25000 (Restriction for white sugar tn.)
X4 / 0.95 >= 25000 (Restriction for powdered sugar weight)
X1, X2, X3, X4 >=0 (Non-negativity constraint)
The objective function to maximize profits:
f.o: max. z = 150X1 + 200X3 + 230X4 + 35X2

The structure of the model is as follows:

product obtained (tons per week) i: 1, 2, 3, 4
F.O Max z = 150X1 + 200X3 + 230X4 + 35X2
S.a:
X1 / 0.3 + X2 / 0.1 <= 4000 (Restriction for syrup tn.)
X1 >=25000 (Restriction for brown sugar tn.)
X3 / 0.8 >= 25000 (Restriction for tn. of white sugar)
X4 / 0.95 >=25000 (Restriction for powdered sugar tn.)
X1, X2, X3, X4 >=0 (Non-negativity constraint)

Problem 41:

Four products are processed in sequence by two machines. The following table
provide the relevant data for the problem.

Manufacturing time per unit (hour)

Machine Cost Prod. 1 Prod. 2 Prod. 3 Prod. 4 Capacity
($) / hour (hour)
1 10 2 3 4 2 500
2 5 3 2 1 2 380
Selling price 65 70 55 45
Per unit ($)

Formulate the model as a linear programming model.

Solution:
We determine the decision variables:
Xij: units produced by product type j: 1, 2, 3, 4.
using each machine i: 1, 2.

The restrictions:
2X11 + 3X12 + 4X13 + 2X14 <= 500 (Capacity restriction of machine 1)
3X21 + 2X22 + 1X23 + 2X24 <= 380 (Capacity constraint of machine 2)

The objective function to maximize profits:

Max z = 65(X11 + X12) + 70(X12 + X22) + 55(X13 + X23) + 45(X14 + X24) -
10 (2X11 + 3X12 + 4X15 + 2X14) - 5(3X21 + 2X22 + 1X23 + 2X24)
Simplifying:
45X11 + 50X21 + 40X12 + 60X22 + 15X13 + 50X23 + 25X14 + 35X24
The structure of the model is as follows:

units produced by product type j: 1, 2, 3, 4.

Using each machine i: 1, 2.
F: O Max z = 45X11 + 50X21 + 40X12 + 60X22 + 15X13 + 50X23 + 25X14 + 35X24
S.a:
2X11 + 3X12 + 4X13 + 2X14 <= 500 (Capacity constraint of machine 1)
3X21 + 2X22 + 1X23 + 2X24 <= 380 Capacity restriction of machine 2
X11, X12, X13, X14, X21, X22, X23, X24 >=0 (Non-negativity constraint)

Problem 42:

With rubies and sapphires, a businessman produces two types of rings. A type 1 ring requires 2
rubies, 3 sapphires and 1 hour of work from a jeweler. A type 2 ring requires 3 rubies, 2 sapphires and 2
working hours of a jeweler. Each type 1 ring is sold for 400 dollars, and each type 2 ring for
500 dollars. All the produced rings can be sold. Currently, there are 100 available.
rubies, 120 sapphires, and 70 hours of a jeweler's work. More rubies can be bought at a cost
of 100 dollars per ruby. Market demand requires a production of at least
20 rings of type 1 and at least 25 rings of type 2. Formulate the problem to maximize the
profit.

Solution:
Requirement per unit
Type of
ring Availability
Type 1 Type 2
Rubies (unit) 2 3
Sapphires (unit) 3 2
Man-hours 1 2 70
Price ($/unit) 400 500
Demand (unit) 20 25

We determine the decision variables:

number of rings of type i = 1, 2
The restrictions:
2X1 + 3X2 - X3 <= 100 (Restriction on the amount of rubies)
3X1 + 2X2 <= 120 (Restriction on the number of sapphires)
X1 + 2X2 <= 70 Restriction on working hours of a jeweler
X1 >= 20 (Restriction for type 1 demand)
X2 >= 25 (Restriction for type 2 demand)

The objective function to maximize profits:

Max z = 400X1 + 500X2 - 100X3

The structure of the model is as follows:

number of rings of type i = 1, 2

F.O: Max z = 400X1 + 500X2 - 100X3
 2X1 + 3X2 - X3 <= 100 (Restriction on the amount of rubies)
3X1 + 2X2 <= 120 (Restriction on the amount of sapphires)
X1 + 2X2 <= 70 Restriction on working hours of a jeweler
X1 >= 20 (Restriction for type 1 demand)
X2 >= 25 (Restriction for type 2 demand)
X1, X2, X3 >= 0 (Non-negativity constraint)

Problem 43:
For a 24-hour shift, a hospital is requiring the following staff for the area of
nursing, defines 6 shifts of 4 hours each.

Number
Shift minimum
of personal
2:00 - 6:00 4
6:00 - 10:00 8
10:00 AM - 2:00 PM ten
2:00 PM - 6:00 PM 7
18:00 - 20:00 12
20:00 - 24:00 4

Labor contracts are for 8 consecutive hours per day. The objective is to find the number
fewer people who meet the requirements. Formulate the problem as a model
of linear programming.

Solution:
We determine the decision variables:
Xi = Amount of personnel per shift i = 1, 2, 3, 4, 5, 6.

Staff needs by schedule

10:00 - 14:00 6:00 PM 20:00
Hours 2:00 - 6:00 6:00 - 10:00 14:00 6:00 PM 20:00 24:00
X1 X1
X2 X2
X3 X3
X4 X4
X5 X5
X6 X6
Persona
l 4 8 10 7 12 4

The staffing restrictions per shift are:

X1 + X6 >= 4
X1 + X2 >= 8
X2 + X3 >= 10
X3 + X4 >= 7
X4 + X5 >= 12
 X5 + X6 >= 4

The objective function to minimize the amount of personnel

Min z = X1 + X2 + X3 + X4 + X4 + X5 + X6

The structure of the model is as follows:

Xi = Quantity of staff per shift i = 1, 2, 3, 4, 5, 6.
F :O Min z = X1 + X2 + X3 + X4 + X4 + X5 + X6
S.a:
X1 + X6 >= 4
X1 + X2 >= 8
X2 + X3 >= 10
X3 + X4 >= 7
X4 + X5 >= 12
X5 + X6 >= 4
X1, X2, X3, X4, X5, X6 >= 0 (Non-negativity constraint)