Advanced Operational Research (FSCT6102)
Computer Science - COS
Semester: First Semester
Level: 500
Year: 2017
Instruction: Box all your answers
Exercise 1
Consider the LP
Minimize z = x1 + 2x2 – 3x3+x4+x5
subject to
x1 + 2x2 - 3x3 + x4 + x5 = 4
x1 + 2x2 + x3 + 2x4 +
X
5
=
4
_______________
x1 , x2, x3, x4, x5 >0
a. A basic solution of the constraint equations of this problem has how many basic variables, in
addition to -z?
b. What is the maximum number of basic solutions (either feasible or infeasible) which might exist?
(that is how many ways might von select a set of basic variables from the four variables x1 through
x4?)
c. Find and list all of the basic solutions of the constraint equations.
d. Is the number of basic solutions in (c) equal to the maximum possible number which you specified
in (b)?________________
e. How many of the basic solutions in (c) are feasible (i.e. nonnegative)?
f. By evaluating the objective function at each basic solution. Find the optimal solution.
Exercise 2
Dorian makes luxury cars and jeeps for high-income men and women. It wishes to advertise with 1
minute spots in comedy shows and football games. Each comedy spot costs 5000f and is seen by 700M
high-income women and 200M high-income men. Each football spot costs 10000f and is seen by
200M high-income women and 1200M high-income men. In order to find how can Dorian reach
2800M high-income women and 2400M high income men at the least cost?
1) Formulate the above as LPP
2) Solve graphically the LPP
3) Is there an Isoprofit line to the problem?
School/Faculty: HTTTC Department: Fundamental Sciences Lecturer(s): Mr. FOHAGUI Cyrille
Course Code:
MATH 511
Course
Advanced Operations Research
Date:
Hall Time: Duration: 1h 30 mins
Instructions:
REPUBLIC OF CAMEROON
Peace-Work-Fatherland
THE UNIVERSITY OF BAMENDA
P.O BOX 39 Bambili
www.schoolfaqs.net
