THE POLYTECHNIC, ILE-IFE.
P.M.B. 5533, Ile-Ife. Osun State.
RAMON ADEDOYIN COLLEGE OF ENGINEERING AND TECHNOLOGY.
DEPARTMENT OF COMPUTER SCIENCE
FIRST SEMESTER EXAMINATIONS. 2024/2025.
STA 412 OPERATIONS RESEARCH II. (3 Units).
Instruction: Answer ANY FOUR (4) Questions. Time Allowed: 2 Hrs.
WARNING: Please note that you are not allowed to bring mobile phone(s) or related materials into the
examination hall. Non-compliance will amount to examination misconduct and attract stiff penalty.
1. (a). GrainCo supplies corn from three silos to three poultry farms. The supply amounts at the three
silos
are 100, 200, and 50 thousand bushels and the demands at the three farms are 150, 80, and 120
thousand bushels. GrainCo mostly uses railroads to transport the corn to the farms, with the
exception of three routes where trucks are used.
Represent this problem as a network model.
(b). Maximize f ( x )=4 x 1 +6 x 2−2 x 12−2 x 1 x 2−2 x 22 . Assume X 0=( 1 ,1 ) .
2. (a). Explain the Golden Search and Dichotomous algorithms.
(b). Hence, find the maximum of the function, f ( x )= {4−x , 2 ≤ x ≤ 4}
4 x ,0 ≤ x ≤ 2
.
Assume that △=0.05 .
3. (a). Maximize: (b). Minimize:
x 0=5 x 1+ 4 x 2
x 0=2 x 1+ x 2
Subject to:
Subject to:
6 x 1+ 4 x 2 ≤24
3 x 1+ x 2 ≥3
x 1+ 2 x 2 ≤6
4 x1 +3 x 2 ≥ 6
−x 1+ x2 ≤1
x 1+ 2 x 2 ≤3
x2 ≤ 2
x1 , x2 ≥ 0 .
x1, x2≥ 0 .
4. Find the maximum of the following functions:
(a). f ( x )=xcos x for 0 ≤ x ≤ π .
1
(b). f ( x )= 2 ≤ x ≤ 4 . Assume that △=0.05 .
|( x−3 )3|
5. Carry out at least 5 iterations for each of the following problems, using the method of steepest
ascent (or descent). Assume X 0=0 in each case:
2
(a). Minimize f ( x )=x 1−x 2 + x 1 −x 1 x 2.
( )
−1
−5 −3
2
T
(b). Maximize f ( x )=CX + X AX , where C=( 1 3 5 )∧ A= −3 −2 0 .
−1 −1
0
2 2
6. (a). Find the maximum of the function, f ( x )=−( x−3 )2 for 2 ≤ x ≤ 4 . Assume △=0.05 .
(b). Use Wolfe’s method to solve the following Quadratic Programming Problem:
Maximize:
2
Z=2 x 1 + x 2−x 1
Subject to:
2 x1 +3 x 2 ≤ 6
2 x1 + x 2 ≤ 4
x1, x2≥ 0 .
BEST OF LUCK!!!
