Scribd
Upload
57 views4 pages

Numericals - LP Formulation

Uploaded by

sahil.mp2026
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
57 views4 pages

Numericals - LP Formulation

Uploaded by

sahil.mp2026
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/ 4

Q1. A small airline, Ivy Air, flies between three cities: Ithaca, Newark, and Boston.

They offer several flights but, for this problem, let us focus on the Friday afternoon
flight that departs from Ithaca, stops in Newark, and
continues to Boston. There are three types of passengers:

(a) Those traveling from Ithaca to Newark.


(b) Those traveling from Newark to Boston.
(c) Those traveling from Ithaca to Boston.

The aircraft is a small commuter plane that seats 30 passengers. The airline offers three
fare classes:

(a) Y class: full coach.


(b) B class: non-refundable.
(c) M class: non-refundable, 3-week advanced purchase.

Ticket prices, which are largely determined by external influences (i.e., competitors),
have been set and advertised as follows:
Ithaca–Newark Newark–Boston Ithaca–Boston

Y 300 160 360

B 220 130 280

M 100 80 140

Based on past experience, demand forecasters at Ivy Air have determined the following
upper bounds on the number of potential customers in each of the nine possible origin
destination/fare-class combinations:
Ithaca–Newark Newark–Boston Ithaca–Boston

Y 4 8 3

B 8 13 10

M 22 20 18
The goal is to decide how many tickets from each of the nine origin/ destination/fare
class combinations to sell. The constraints are that the plane cannot be overbooked on
either of the two legs of the flight and that the number of tickets made available cannot
exceed the forecasted maximum demand. The objective is to maximize the revenue.
Formulate this problem as a linear programming problem.
Q2. A steel company must decide how to allocate next weeks’ time on a rolling mill,
which is a machine that takes unfinished slabs of steel as input and can produce either
of two semi-finished products: bands and coils. The mill’s two products come off the
rolling line at different rates:
Bands: 200 tons/h
Coils: 140 tons/h.

They also produce different profits:


Bands: $25/ton
Coils: $30/ton.

Based on currently booked orders, the following upper bounds are placed on the
amount of each product to produce:

Bands: 6,000 tons


Coils: 4,000 tons.
Given that there are 40 h of production time available this week, the problem is to
decide how many tons of bands and how many tons of coils should be produced to
yield the greatest profit. Formulate this problem
as a linear programming problem.

Q3. A 24-mhour supermarket has the following minimal requirements for cashiers:
Period 1 2 3 4 5 6
Time of day 3-7 7-11 11-15 15-19 19-23 23-3
(24-h clock)
Minimum No. 7 20 14 20 10 5

Period 1 follows immediately after period 6. A cashier works eight


consecutive hours, starting at the beginning of one of the six periods.
Determine a daily employee worksheet which satisfies the
requirements with the least number of personnel.
Q4. A plastic manufacturer has 1200 boxes of transparent wrap in
stock at one factory and another 1000 boxes at its second factory. The
manufacturer has orders for this product from three different
retailers, in quantities of 1000, 700, and 500 boxes respectively. The
unit shipping costs (in cents per box) from the factories to the
retailers are as follows:
Retailer 1 Retailer 2 Retailer 3

Factory 1 14 13 11
Factory 2 13 13 12

Determine a minimum-cost shipping schedule for satisfying all


demand from current inventory.

Q5. George Johnson recently inherited a large sum of money;


he wants to use a portion of this money to set up a trust fund
for his two children. The trust fund has two has two
investment options: 1) a bond fund and 2) a stock fund. The
projected returns over the life of the investments are 6% for
the bond fund and 10% for the stock fund. Whatever portion
of the inheritance he finally decides to commit to the trust
fund, he wants to invest at least 30% of that amount in the
bond fund. In addition, he wants to select a mix that will
enable him to obtain a total return of at least 7.5%. Formulate
a linear programming model that can be used to determine the
percentage that should be allocated to each of the possible
investment alternatives.

You might also like