Optimization Theory
Uploaded by
drazharalizafarOptimization Theory
Uploaded by
drazharalizafarGC UNIVERSITY LAHORE
OBJECTIVE QUESTION PAPER
EXAMINATION: FINAL 2022 SEMESTER:VIII
TITLE: OPTIMIZATION THEORY COURSE CODE:MATH-4202
TIME ALLOWED: 20 MINUTES MAX MARKS:10
ROLL. NO._____________________ NAME:______________________________
NOTE: Erasing/ Cutting and over writing shall bear NO MARKS
Question. No. 1.Encircle the alphabets of correct choice
Part MCQ Marks
i Parameter estimation is usually 1
(a) Unconstrained optimization (b) Multi-objective optimization
(c) Constrained optimization (d) All of them
ii A feasible solution of Linear Programming Problem that optimizes the objective 1
function is called
(a) Basic feasible solution (b) Optimal solution (c) Solution
(d) Feasible solution
iii Feasible solution satisfies 1
(a) Only constraints (b) Only non-negative restriction (c) Both (a) & (b)
(d) None of these
iv Transportation problem is all about the -------------- of the objective function. 1
(a) Minimization (b) Maximization (c) (a) and (b) both (d) None of these.
v The method used for solving the one-one assignment model is called 1
(a) Hungarian method (b) Transportation method
(c) Simplex method (d) Least cost method
vi For every primal constraint there is a dual 1
(a) Constraint (b) Slack variable
(c) Surplus variable (d) None of these.
vii When demand exceeds supply then to balance the model we add 1
(a) Dummy destination (b) Dummy source Primal
(c) Dummy demand (d) Dummy supply
viii The dual of a dual is a 1
(a) Dual primal (b) Primal (c) Constraint
(c) None of these
ix A two variable model can always be solved with the help of 1
(a) Simplex method (b) North-west corner method
(c) Transportation method (d) Graphical method
x A slack variable is associated with a 1
(a) = (b) (c) (d) None of these.
Signatures:_______________________________
GC UNIVERSITY LAHORE
SUBJECTIVE QUESTION PAPER
SUBJECT: BS MATHEMATICS
EXAMINATION: FINAL 2019 SEMESTER:VIII
TITLE: OPTIMAZATION THEORY COURSE CODE:MATH-4202
TIME ALLOWED: 155 MINUTES MAX MARKS:48
NOTE: Attempt any FOUR questions.
Q. No. Question Marks
2 (a) Use the simplex method to find the maximum value of 6
z 2 x1 x2 2 x3 subject to the constraints
2 x1 x2 10
x1 2 x2 2 x3 20
x2 2 x3 5
where x1 , x2 and x3 0 .
(b) Solve by unbounded solution in graphical method;
6
Maximize z 3x1 2 x2 subject to the constraints
x1 x2 1
x1 x2 3 .
where x1 , x2 0.
3 (a) Find the minimum value of w 3x1 2 x2 subject to the 6
constraints
2 x1 x2 6
x1 x2 4
where x1 , x2 0.
(b) Solve the problem by no optimal solution in graphical method
max z 3x1 2 x2 , subject to the constraints 6
x1 x2 1
x1 x2 3
where x1 , x2 0.
4 6
y y 2 xy dx that
2
2
(a) Find the extremal of the function
0
satisfy the boundary conditions y(0) 0, y( ) 0 .
2
(b) Solve by column minimum method 6
10 13 6 10
16 7 13 12 available
8 22 2 8
6 11 13
requirement
5 Solve by Big M method to 12
max z 2 x1 x2 , subject to the constraints
3 x1 x2 3
4 x1 3 x2 6
x1 2 x2 4
where x1 , x2 0.
6 (a) Solve by Vogel Approximation method 6
19 30 50 10 7 Supply
70 30 40 60 9
40 8 70 20 18
5 8 7 14
demand
(b) Solve the following problem using Hungarian method. The 6
matrix entries represent the processing time in hours
9 11 14 11 7 jobs
6 15 13 13 10
12 13 6 8 8
11 9 10 12 9
7 12 14 10 14
operator
