You are on page 1of 2

# Tnaz Ekim Kbra Tannm

17.02.2015
IE 202 PS 1
1.

During each 4-hour period, the Smalltown police force requires the following number of on-duty

## police ofcers: 12 midnight to 4 A.M.8; 4 to 8 A.M.7; 8 A.M. to 12 noon6; 12 noon to 4 P.M.6; 4 to

8 P.M.5; 8 P.M. to 12 midnight4. Each police officer works two consecutive 4-hour shifts. Formulate an
LP that can be used to minimize the number of police officers needed to meet Smalltowns daily
requirements.
2.

3.

For a telephone survey, a marketing research group needs to contact at least 150 wives, 120

husbands, 100 single adult males, and 110 single adult females. It costs \$2 to make a daytime call and
(because of higher labor costs) \$5 to make an evening call. Table lists the results. Because of limited staff, at
most half of all phone calls can be evening calls. Formulate an LP to minimize the cost of completing the
survey.

4.

Person Responding

## Percent of Evening Calls

Wife

30

30

Husband

10

30

Single Male

10

15

Single Female

10

20

None

40

Carco has a \$150,000 advertising budget. To increase automobile sales, the rm is considering

advertising in newspapers and on television. The more Carco uses a particular medium, the less effective is
costs \$1,000, and each television ad costs \$10,000. At most, 30 newspaper ads and 15 television ads can be
placed. How can Carco maximize the number of new customers created by advertising? Explain why the
proportionality assumption is not violated.

New Customers

1-10

900

11-20

600

21-30

300

1-5

10,000

6-10

5,000

11-15

2,000

Newspaper

Television

5.

Consider the following problem, where the value of k has not yet been ascertained. The solution

## currently being used is

x1=2, x2=3. Use graphical analysis to determine the values of k such that this

## solution actually is optimal.

Maximize z= x1 + 2x2
s.t.

-x1 + x2 2
x2 3
kx1 + x2 2k+3

6.

where k0, x1 0, x2 0

Using graphical solution procedure identify which of Cases 14 (Unique optimal solution, multiple

## optima, infeasible, unbounded LP) apply to each of the following LPs:

a. max z= x1 + x2
s.t.

7.

b. max z= 4x1 + x2

x1 + x2 4

s.t.

8x1 + 2 x2 16

c. max z= - x1 + 3x2
s.t.

x1 -

x2 4

x1 - x2 5

5x1 + 2 x2 12

x1 + 2 x 2 4

x1 0, x2 0

x1 0, x2 0

x1 0, x2 0

## Convert the following LP into the standard form:

Minimize z = 3x1 + 11x2 + 8x3
s.t

x1 - 5 x2 + 2 x3 22
2x1 + 3 x2 - x3 36
x1 + 8x2 + 2 x3 = 64
x1 0, x2 0, x3 unrestricted.

8.

## max z= 2x1 +2.5 x2

s.t.

x1 + 2 x2 350
2x1 + x2 400
x1 0, x2 0

a. Find all the basic solutions and classify them as feasible and infeasible.
b. Determine the optimal basic feasible solution using direct substitution in the objective function.
c. Demonstrate the correspondence between corner points and basic feasible solutions.