Scribd
Upload
25 views7 pages

IND315 Operations Research I, Fall 2023, by Ç. Özgün Kibiroğlu

Uploaded by

Elif Patlak
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
25 views7 pages

IND315 Operations Research I, Fall 2023, by Ç. Özgün Kibiroğlu

Uploaded by

Elif Patlak
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/ 7

PS Handout #2 - IND315 Operations Research

IE 3001 Operations Research, IFall


, Fall 2023,
2009, by by
S. Ç. Özgün
Ağralı Kibiroğlu
& Ç. Özgün 1

1. Dorian Auto manufactures luxury cars and trucks. The company believes that its most likely
customers are high-income women and men. To reach these groups, Dorian Auto has embarked
on an ambitious TV advertising campaign and has decided to purchase 1-minute commercial
spots on two types of programs: comedy shows and football games. Each comedy commercial is
seen by 7 million high-income women and 2 million highincome men. Each football commercial
is seen by 2 million high-income women and 12 million high-income men. A 1-minute comedy ad
costs $50,000, and a 1-minute football ad costs $100,000. Dorian would like the commercials to
be seen by at least 28 million high-income women and 24 million high-income men. Use linear
programming to determine how Dorian Auto can meet its advertising requirements at minimum
cost.
IND315
PS Handout #2 - IE Operations Research,
3001 Operations Research Fall
I , Fall 2023,
2009, by by Ç. Özgün
S. Ağralı & Ç.Kibiroğlu
Özgün 2

2. Graphically solve the following LP:

max z = 2x1 −x2


s.t. x1 − x2 ≤ 1
2x1 − x2 ≥ 6
x1 , x2 ≥ 0
IND315
PS Handout #2 - IE OperationsResearch,
3001 Operations Research Fall
I , Fall 2023,
2009, byAğralı
by S. Ç. Özgün& Ç.Kibiroğlu
Özgün 3

3. Money manager Boris Milkem deals with French currency (the franc) and American currency (the
dollar). At 12 midnight, he can buy francs by paying .25 dollars per franc and dollars by paying 3
francs per dollar. Let x1 : number of dollars bought (by paying francs) and x2 : number of francs
bought (by paying dollars). Assume that both types of transactions take place simultaneously,
and the only constraint is that at 12:01 A.M. Boris must have a nonnegative number of francs
and dollars.

(a) Formulate an LP that enables Boris to maximize the number of dollars he has after all
transactions are completed.
(b) Graphically solve the LP and comment on the answer.
IND315
PS Handout #2 - IE OperationsResearch,
3001 Operations Research Fall
I , Fall 2023,
2009, byAğralı
by S. Ç. Özgün& Ç.Kibiroğlu
Özgün 4

4. Graphically solve the following LPs:

max z = 4x1 −x2


s.t. 8x1 − 2x2 ≤ 16
5x1 − 2x2 ≤ 12
x1 , x2 ≥ 0

max z = x1 −3x2
s.t. x1 − x2 ≤ 4
x1 − 2x2 ≥ 4
x1 , x2 ≥ 0

max z = 3x1 −x2


s.t. 2x1 − 3x2 ≤ 6
x1 − x2 ≤ 9
x1 , x2 ≥ 0
PS Handout #2 - IND315 Operations Research,
IE 3001 Operations Research IFall
, Fall 2023,
2009, by by Ç. Özgün
S. Ağralı Kibiroğlu
& Ç. Özgün 5

5. True or False

• For an LP to be unbounded, the LP’s feasible region must be unbounded.


• Every LP with an unbounded feasible region has an unbounded optimal solution.
IND315
PS Handout #2 - IE OperationsResearch,
3001 Operations Research Fall
I , Fall 2023,
2009, byAğralı
by S. Ç. Özgün& Ç.Kibiroğlu
Özgün 6

6. Consider the following linear program

Maximize z = 5x1 + 3x2


Subject to 3x1 + 5x2 ≤ 15
5x1 + 2x2 ≤ 10
−x1 + x2 ≤ 2
x2 ≤ 2.5
x1 , x2 ≥ 0

• Show the equality form of model.


• Sketch the graph of the feasible region and identify the extreme point solutions. From this
representation, find the optimal solution.
• Analytically determine all solutions that derive from the intersection of two constraints or
non negativity restrictions. Identify whether or not these solutions are feasible, and indicate
the corresponding objective function values. Which one is optimal?
• Let the slack variables fort he first two constraints, call them x3 and x4 , be the axes of
the graph, sketch the geometric representation of the model. Show an objective isovalve
contour in these variables, and determine the optimal solution.
PS Handout #2 - IND315
IE 3001 Operations
Operations Research
Research, IFall
, Fall 2023,
2009, by by
S. Ç. Özgün
Ağralı Kibiroğlu
& Ç. Özgün 7

7. Consider the following linear program

Maximize z = 10x1 + 5x2 + 8x3 −3x4


Subject to − 2x1 + x2 + 2x3 − 3x4 ≥ 1
x1 + x2 + x3 + x4 ≤ 20
xj ≥ 0, j = 1, . . . , 4

• Constract the equality form of model by introducing slack variables x5 , x6 for the two
constraints
• What is an upper bound on the number of basic solutions?
• Analytically determine the set of basic solutions by listing all possible selections of the basic
variables. Identify whether or not these solutions are feasible, and indicate the corresponding
objective function values. Which one is optimal?

You might also like