Scribd
Upload
12 views2 pages

Sheet

The document outlines several linear programming problems involving different scenarios such as a small business making blouses and skirts, transportation of packages with cost constraints, workforce management in a factory, and manufacturing wood and metal screws. It also includes specific linear programming problems to be solved graphically, detailing objectives and constraints for maximizing or minimizing profit. Each scenario requires formulation into linear programming problems with defined variables and constraints.

Uploaded by

abdoharfosh1710
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
12 views2 pages

Sheet

The document outlines several linear programming problems involving different scenarios such as a small business making blouses and skirts, transportation of packages with cost constraints, workforce management in a factory, and manufacturing wood and metal screws. It also includes specific linear programming problems to be solved graphically, detailing objectives and constraints for maximizing or minimizing profit. Each scenario requires formulation into linear programming problems with defined variables and constraints.

Uploaded by

abdoharfosh1710
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
You are on page 1/ 2

Benha University- Benha Faculty of Engineering

Basic Engineering Sciences department


Sheet No. (6)
(1) Formulate into linear programming problems (LPP):
(a) Ann and Margaret run a small business in which they work together
making blouses and skirts. Each blouse takes 1 hour of Ann's time together
with 1 hour of Margaret's time. Each skirt involves Ann for 1 hour and
Margaret for half and hour. Ann has hours available each day and Margaret
had 5 hours each day. They could just make blouses or they could just make
skirts or they could make some of each. Their first thought was to make
the same number of each. But they get 8 profit on a blouse and only 6 on a
skirt.

(b) A firm has to transport 1200 packages using large vans which can carry
200 packages each and small vans which can take 80 packages each. The
cost for engaging each large van is Rs 400 and each small van is Rs 200.
Not more than Rs 3000 is to be spent on the job and the number of large
vans cannot exceed the number of small vans.

(c) A factory employs unskilled workers earning $135 per week and skilled
workers earning $270 per week. It is required to keep the weekly age bill
below $24,300. The machine requires a minimum of 110 operators, of
whom at least 40 must be skilled. Union regulations required that the
number of workers skilled should be at least half the number of unskilled
workers. If X is the number of unskilled workers and Y is the number of
skilled workers, write down all the constraints to be satisfied by X and Y.
Also, determine the minimum cost.

(d) A firm manufactures wood screws and metal screws. All the screws have
to pass through a threading machine and a slotting machine. A box of wood
screws requires 3 minutes on the slotting machine and 2 minutes on the
threading machine. A box of metal screws requires 2 minutes on the
slotting machine and 8 minutes on the threading machine. In a week, each
machine is available for 60 hours.
There is a profit of £10 per box on wood screws and £17 per box on metal
screws. Formulate this problem as a linear programming problem given
that the objective is to maximize profit.
Solve the following linear programming problems (LPP) graphically:
(a) Max 𝑧 = 2𝑥1 + 3𝑥2 (b) Max 𝑧 = 2𝑥1 + 5𝑥2
Subject to: 𝑥1 + 3𝑥2 ≤ 6, Subject to: 3𝑥1 + 2𝑥2 ≥ 6,
3𝑥1 + 2𝑥2 ≤ 6 2𝑥1 + 𝑥2 ≤ 2
𝑥1 , 𝑥2 ≥ 0 𝑥1 , 𝑥2 ≥ 0

(d) Min 𝑧 = 3𝑥1 − 3𝑥2


(c) Min 𝑧 = 2𝑥1 + 𝑥2 Subject to: 𝑥1 + 2𝑥2 ≤ 6,
Subject to: 𝑥1 + 𝑥2 ≤ 10, 𝑥1 − 𝑥2 ≤ 2
−𝑥1 + 𝑥2 ≥ 0, 𝑥1 ≤ 2
𝑥1 ≤ 4 𝑥1 , 𝑥2 ≥ 0
𝑥1 , 𝑥2 ≥ 0

(f) Min 𝑧 = 0.3𝑥1 + 0.9𝑥2


(e) Max 𝑧 = 2𝑥1 + 3𝑥2 Subject to: 𝑥1 + 𝑥2 ≥ 800,
Subject to: 3𝑥1 + 𝑥2 ≤ 6, 0.21𝑥1 − 0.3𝑥2 ≤ 0
−𝑥1 + 𝑥2 ≤ 0 0.03𝑥1 − 0.01𝑥2 ≥
𝑥1 , 𝑥2 ≥ 0 0
𝑥1 , 𝑥2 ≥ 0

You might also like