Linear Programming Fundamentals 2Nd Year - Ensia: Exercice C1
Linear Programming Fundamentals 2Nd Year - Ensia: Exercice C1
(b) Prove that if and are convex sets, then their intersection is
also convex.
Exercice C2
Farmer Jones bakes two types of cake (chocolate and vanilla) to supplement his
income. Each chocolate cake can be sold for $1, and each vanilla cake can be sold
for 50¢ ($ 0.5). Each chocolate cake requires 20 minutes of baking time and uses 4
eggs. Each vanilla cake requires 40 minutes of baking time and uses 1 egg. Eight
hours of baking time and 30 eggs are available. Formulate an LP to maximize Farmer
Jones’s revenue, then graphically solve the LP. (A fractional number of cakes is
okay.)
Exercice C3
During each 4-hour period, the Algiers police force requires the following number
of on-duty police officers: 12 midnight to 4 A.M. ⇒ 8 ; 4 to 8 A.M. ⇒ 7; 8 A.M. to
12 noon ⇒ 6; 12 noon to 4 P.M. ⇒ 6; 4 to 8 P.M. ⇒ 5; 8 P.M. to 12 midnight ⇒4. 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 Algiers’s daily
requirements.
Exercice P1
Consider the following problem, where the value of c1 is still unknown.
subject to
x1 + x2 ≤ 6
x1 + 2x2 ≤ 10
x1 ≥ 0, x2 ≥ 0
Use graphical analysis to determine the optimal solution(s) for (x1, x2) for the
various possible values of c1(-∞ < c1 < ∞).
Exercice P2 (Optional)
The demand for an item over the next four quarters is 280, 400, 450, and 300
units,respectively. The price per unit starts at $20 in the first quarter and
increases by $1 each quarter thereafter. The supplier can provide no more than 400
units in any one quarter.Although we can take advantage of lower prices in early
quarters, a storage cost of $3.80 is incurred per unit per quarter. In addition,
the number of units that can be held over from one quarter to the next must be 80
or less. Develop an LP model to determine the optimum schedule for purchasing the
item to meet the demand
Exercice P3 (Optional)
Consider the following problem, where the values of c1 and c2 have not yet been
ascertained.
subject to
2x1 + x2 ≤ 11
–x1 + 2x2 ≤ 2
x1 ≥ 0, x2 ≥ 0.
Use graphical analysis to determine the optimal solution(s) for (x1, x2) for the
various possible values of c1 and c2. (Hint: Separate the cases where c2 = 0, c2 > 0,
and c2 < 0. For the latter two cases, focus on the ratio of c1 to c2.)
Exercice P4 (Optional)
In the electrical circuit of Figure above, 𝐼𝑡 = current (in amperes) flowing through
resistor 𝑡, 𝑉𝑡 = voltage drop (in volts) across resistor 𝑡, and 𝑅𝑡 = resistance (in
ohms) of resistor 𝑡. Kirchoff’s Voltage and Current Laws imply that 𝑉1 = 𝑉2 = 𝑉3 and
2
𝐼1 + 𝐼2 + 𝐼3 = 𝐼4.The power dissipated by the current flowing through the resistor 𝐼𝑡 𝑅𝑡 .
Ohm’s Law implies that 𝑉𝑡 = 𝐼𝑡𝑅𝑡. The two parts of this problem should be solved
independently.
decision variables.)