Paper Tayyari

Final Term PreparationFinal term ki tayyari

Syllabus: lectures 19–45. Past-paper MCQs are shown first.Syllabus: lecture 19–45. Past paper ki MCQs pehle dikhai gayi hain.

57 MCQs · 9 short · 15 long questions · 57 MCQs from past papers57 MCQs · 9 short · 15 long sawal · 57 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/57
– correctsahi
1.
★ Final term 2012Lecture 21

The ______ variable is chosen by examining the cost coefficents in the objective function.

  1. Aentering
  2. Bleaving
  3. Cpositive slack
  4. Dnegative slack

The entering variable is picked from the objective-row (cost) coefficients; the leaving variable comes from the ratio test.

2.
★ Final term paper (screens, paper 2)Lecture 21

It is a property of simplex method that there always exist infinite numbers of basic feasible solutions. (True/False)

  1. ATrue
  2. BFalse

An LP has only a finite number of basic feasible solutions (at most C(n,m)).

3.
★ Final term paper (screens, paper 2)Lecture 21

If the objective function of a linear programming problem needs further improvement then which of the following will have to proceed?

  1. Aa new decision variable to be entered and other decision variable to leave the basis
  2. Ba new slack variable to be entered and other slack to leave the basis
  3. Ca new non-degenerate variable to be entered and other non-generate to leave the basis
  4. Da new basic variable to be included and other basic variable to leave the basis

Each simplex iteration brings an entering variable into the basis and removes a leaving basic variable.

4.
★ Final term paper (screens, paper 2)Lecture 21

The constrained 3x1 + 2x2 <= 18 in standard form can be written as: (Where R is artificial variable and S1 is Slack variable)

  1. A3x1 + 2x2 + S1 + R = 18
  2. B3x1 + 2x2 + S1 - R = 18
  3. C3x1 + 2x2 - S1 + R = 18
  4. D3x1 + 2x2 + S1 = 18

A <= constraint only needs a slack variable added; no artificial variable is required.

5.
★ Final term 2012Lecture 23

While solving a linear programming problem by big M – Method, traditionally the ______ variables are chosen in the initial basic feasible solution.

  1. Aneagtive slack
  2. Bpositive slack
  3. Centering
  4. Dartificial

Big M adds artificial variables to ≥ and = constraints and starts with them in the initial basis.

6.
★ Final term 2012Lecture 23

In the big-M method, if the introduced ______ variables do not leave the basis in the final iteration, then this indicates that the give linear programming problem cant be optimized.

  1. Aentering
  2. Bpositive slack
  3. Cnegative slack
  4. Dartificial

A positive artificial variable left in the final basis means the problem has no feasible solution.

7.
★ Final term paper (screens, paper 2)Lecture 23

If no ____ variable appears in the basis and the optimality conditions are satisfied, then the current solution will be optimal one.

  1. Aartificial
  2. Bnon basic
  3. Cslack
  4. Dsurplus

An optimal tableau is valid for the original problem only if no artificial variable remains in the basis.

8.
★ Final term 2012Lecture 25

By using Two phase method to solve a linear programming problem, in phase I, a new objective function is formed by assigning on left hand side, zero to every original variable (including slack and surplus variables) and -------- to each of the artificial variables.

  1. AM
  2. B−M
  3. C+1
  4. D−1

The Phase I objective (maximize form) gives cost 0 to original variables and −1 to each artificial variable, i.e. Max Z* = −ΣA; M is used only in the Big M method.

9.
★ Final term 2012Lecture 25

For the linear programming problem; Max Z = 2x + 3y Subject to x ≥ 2, y ≤ 3, x, y ≥ 0 ⇒ x − s1 + A = 2, y + s2 = 3, x, y, s1, s2, A ≥ 0. Which of the following is associated objective function of the 1st phase?

  1. AMax Z = 2x + 3y + A
  2. BMin Z = 2x + 3y + A
  3. CMax Z = A
  4. DMin Z = A

Phase I minimizes the sum of the artificial variables, here only A.

10.
★ Final term paper (screens, paper 2)Lecture 25

Min. Z = 0 and no artificial variable appears in the basic variables. ____ solution to original problem has been found and we proceed to phase II method.

  1. AA basic feasible
  2. BAn optimal
  3. CAn infeasible

Phase I ending with Z = 0 and no artificials in the basis gives a basic feasible solution to start Phase II.

11.
★ Final term paper (screens, paper 2)Lecture 25

If the problem has a ____ solution such that the minimum value of the objective function is zero along with zero values of artificial variables. Then proceed to phase II method.

  1. Aunbounded
  2. Bfeasible
  3. Cnon feasible
  4. Dde-generate feasible solution

Phase I with minimum zero and all artificials zero means a feasible solution exists, so Phase II follows.

12.
★ Final term Fall 2005Lecture 25

The Phase-I objective function Minimize R0 = sum_{i=1}^{n} R_i, where R_i are artificial variables is obtained by

  1. ADividing the Big-M method's objective function by 'M' and then dropping the negligible terms
  2. BDividing the Big-M method's objective function by '-M' and then dropping the negligible terms
  3. CMultiply the Big-M method's objective function by 'M' and then dropping the negligible terms
  4. DMultiply the Big-M method's objective function by '-M' and then dropping the negligible terms

Dividing Min Z = sum cx + M sum R by M and letting M grow leaves only sum R, the Phase-I objective.

13.
★ Final term paper (screens, paper 2)Lecture 26

If the degeneracy arises in the initial stage, then which of the following is true?

  1. AOne of the basic variables is zero.
  2. BMore than one variable is eligible to leave the basis.
  3. CTie in the ratio of each row, by taking right hand side of each row and dividing by the corresponding element of the key column.
  4. DIterative Cycling of basic solution exists without reaching the optimality.

Initial degeneracy means a basic variable starts at zero (a zero right-hand side); ties in the ratio test cause degeneracy in later iterations.

14.
★ Final term paper (screens, paper 2)Lecture 26

Consider the following simplex table corresponding to the maximization problem: Z: x1 0, x2 0, x3 M+1/2, x4 M, A1 16M-11, A2 0, RHS -0.6M-5.7 | x1: 1, 0, 5, 0, -1, 0, 3 | x2: 0, 1, -5, 0, 3, 0, 9 | A2: 0, 0, -1, -1, -0.6, 1, 0.6. This is the indication that problem has----------.

  1. Ainfeasible Solution
  2. Btemporarily Degenerate Solution
  3. Cunbounded Solution
  4. Ddegenerate Solution

All Z-row entries are non-negative (optimal) but artificial A2 stays in the basis at a positive value 0.6, so the problem is infeasible.

15.
★ Final term paper (screens, paper 2)Lecture 26

In the Simplex table, if the coefficient of non-basic variable says x1 in the z-row is zero, then it indicates that value of z ------------.

  1. Aincrease
  2. Bdecreases
  3. Cdoes not change
  4. Dbecomes infinity

Bringing in a non-basic variable with zero z-row coefficient leaves z unchanged, indicating alternative optima.

16.
★ Final term paper (screens, paper 2)Lecture 29

A primal's constraint equation produces ____ dual variable.

  1. Anon basic
  2. Ban unrestricted
  3. Cartificial
  4. Dbasic

An equality constraint in the primal corresponds to a dual variable unrestricted in sign.

17.
★ Final term Fall 2006Lecture 29

An unrestricted primal variable will result in an equality dual constraint.

  1. ATrue
  2. BFalse

A free primal variable corresponds to an equality constraint in the dual.

18.
★ Final term Fall 2006Lecture 29

The dual of the dual problem yields the original primal

  1. ATrue
  2. BFalse

Duality is symmetric: taking the dual twice returns the primal.

19.
★ Final term 2012Lecture 31

Any set of non negative allocations (Xij > 0) which satisfies the row and column sum is called a ______ solution.

  1. Afeasible
  2. Bnon basic feasible
  3. Cbasic infeasible
  4. Doptimal

Non-negative allocations meeting all supply and demand constraints form a feasible solution.

20.
★ Final term 2012Lecture 31

In which of the following models, Simplex algorithm is not preferred to use due to laborious computations?

  1. ATransportations models
  2. BDegenerate Linear models
  3. CNon-degenerate Linear models
  4. DDual or unbounded linear models

Transportation problems have many variables and constraints, so special methods (NWC, VAM, MODI) replace the laborious simplex.

21.
★ Final term 2012Lecture 31

Transportations models consist of ------- like the production centers and --------- which may be the sales centers.

  1. A(sinks, sources)
  2. B(sources, sinks)
  3. C(origins, sources)
  4. D(sinks, destinations)

Production centres are sources (origins) and sales centres are sinks (destinations).

22.
★ Final term paper (screens, paper 2)Lecture 31

Transportation problem is a special class of linear programming problem in which transport a commodity from the source to a destination in such a way that the total transportation cost is -------.

  1. AZero
  2. BMaximum
  3. CMinimum
  4. DAverage

The transportation problem minimizes total shipping cost while meeting supply and demand.

23.
★ Final term paper (screens, paper 2)Lecture 32

The Vogel Approximation method is an iterative procedure for computing a ______________ solution of the transportation problem.

  1. Abasic feasible
  2. Bnon basic feasible
  3. Cbasic infeasible
  4. Doptimal

VAM gives an initial basic feasible solution, which is then tested for optimality.

24.
★ Final term 2012Lecture 34

To convert the transportation problem into a maximization model we have to------------.

  1. Awrite the inverse of the coefficient matrix
  2. Bmultiply the feasibility condition by −1
  3. Cmultiply the coefficient matrix by −1
  4. DWe can't convert the transportation problem into a maximization problem, as it is basically a minimization problem.

A maximization transportation problem is solved by multiplying the profit (coefficient) matrix by −1 (or subtracting from the largest value) and minimizing.

25.
★ Final term 2012Lecture 35

Degeneracy in a 5×6 transportation problem occurs when the number of occupied cell is less than

  1. A20 but greater than 10
  2. B10
  3. CZero
  4. DInfinity

A non-degenerate basic solution needs m+n-1 = 5+6-1 = 10 occupied cells, so fewer than 10 is degenerate.

26.
★ Final term 2012Lecture 35

If a basic feasible solution contains less than "m + n – 1" (Here m is the number of rows, n is the number of columns in transportation problem) non negative allocation, then it is said to be

  1. ADegenerate
  2. BMultiple Solutions
  3. CNon degenerate
  4. DAlternative Optima

Fewer than m+n-1 basic allocations means the solution is degenerate.

27.
★ Final term Fall 2005Lecture 35

A transportation problem is degenerate, if while deriving a feasible solution an allocation to any cell

  1. ASatisfies the Column requirements
  2. BSatisfies the Row requirements
  3. CSatisfies column as well as row requirements simultaneously
  4. DNone of the above

When one allocation exhausts a row and a column together, fewer than m+n-1 cells get filled, giving degeneracy.

28.
★ Final term 2012Lecture 36

The cost matrix in assignment problem is always ___ (screen text: 'is always diagonal matrix')

  1. Asquare matrix
  2. Bidentity matrix
  3. Czero matrix

An assignment problem needs equal rows and columns (adding dummies if needed), so its cost matrix is square.

29.
★ Final term 2012Lecture 36

Which of the following binary operation in assignment problem among all the elements in the given profit matrix from the highest element in the matrix

  1. ASubtraction
  2. BDivision
  3. CMultiplication
  4. DAddition

A maximization assignment is converted by subtracting every profit from the largest element.

30.
★ Final term paper (screens, paper 2)Lecture 36

Transportation technique or the simplex method cannot be used to solve the assignment problem because of

  1. ADegeneracy
  2. BInvolvement of dummy activities
  3. CLooping among the entries of assignment matrix
  4. DInequilibrium between demand and supply

An n×n assignment has only n positive allocations instead of 2n-1, so it is highly degenerate.

31.
★ Final term paper (screens, paper 2)Lecture 36

In assignment problem, each job requires exactly one resource.

  1. ATrue
  2. BFalse
  3. CMay not be true

Assignment is one-to-one: each job gets exactly one resource and each resource one job.

32.
★ Final term Fall 2006Lecture 36

In assignment problem each job requires

  1. AExactly one resource
  2. BAt least one resource
  3. CAt most one resource

Each job is assigned to exactly one resource and each resource to exactly one job.

33.
★ Final term paper (screens, paper 2)Lecture 37

The name of the method in getting the optimum assignment is

  1. ASimplex method
  2. BNorth west corner method
  3. CVogal approximation method
  4. DHungarian method

The Hungarian method is the standard algorithm for the optimal assignment.

34.
★ Final term 2012Lecture 38

If the mean arrival and mean service rates are 4 and 7 respectively in a queue then expected waiting time in the system is

  1. A1/3
  2. B3
  3. C28
  4. D7/4

Ws = 1/(μ-λ) = 1/(7-4) = 1/3.

35.
★ Final term 2012Lecture 38

In a bank, every 15 minutes one customer arrives for cashing the cheque. The staff in the payment counter takes only 10 minutes for serving a customer on an average, then the service rate "μ" = ______.

  1. A6 per hour
  2. B4 per hour
  3. C10 per hour
  4. D1/6 per hour

One service per 10 minutes means μ = 60/10 = 6 per hour.

36.
★ Final term 2012Lecture 38

A duplicating machine maintained for office use is used and operated by people in the office who need to make copies. Since the work to be copied varies in length (number of pages of the original) and copies required, the service rate is randomly distributed, the arrival rate is 5 per hour and the service rate is 10 per hour then the equipment utilization "ρ" is equal to

  1. A0.50
  2. B0.20
  3. C5
  4. D2

ρ = λ/μ = 5/10 = 0.5.

37.
★ Final term 2012Lecture 38

A repairman services three machines. For each machine the time between service requirements is 8 hours following exponential distribution. The time of repair also has the same distribution with a mean of 2 hours. Then the average rate "λ" is

  1. A1/8 = 0.125
  2. B8
  3. C4
  4. D¼ = 0.25

Each machine calls for service once per 8 hours on average, so λ = 1/8 per hour.

38.
★ Final term Fall 2005Lecture 38

The formula for expected number of customers in a system is

  1. AL = lambda/(mu - lambda)
  2. BL = lambda/(lambda - mu)
  3. CL = mu/(lambda - mu)
  4. DL = mu/(mu - lambda)

For M/M/1, Ls = lambda/(mu - lambda).

39.
★ Final term 2012Lecture 40

During a replacement if the value of money decreases at the rate of 3% then the present worth factor of unit amount to be spent after one year is given by

  1. A0.25
  2. B0.333
  3. C0.9708
  4. D4

v = 1/(1+0.03) = 0.9708.

40.
★ Final term 2012Lecture 40

If the money carries a rate of interest of 12% per year, the present worth factor of one rupee due in one year is

  1. A0.08333
  2. B0.89285
  3. C0.0769
  4. D13

v = 1/1.12 = 0.89285.

41.
★ Final term 2012Lecture 40

We go in probabilistic replacement model when period between installation and failure is

  1. Avarying exponentially
  2. Bvarying linearly
  3. CConstant
  4. Dis not constant (varying arbitrarily)

Probabilistic replacement models handle items whose life until failure is random, not a fixed or regular pattern.

42.
★ Final term 2012Lecture 40

If "Ni" be the Number of replacement made at the end of the ith week and "Pi" be the probability of failure during the ith week, then N1 = ______.

  1. AN0P1
  2. BN1P1
  3. CN0P0
  4. DN1P2

Replacements at the end of week 1 are the original N0 items times the probability P1 of failing in week 1.

43.
★ Final term 2012Lecture 40

The present worth of a rupee to be spent after a year is denoted by v and given by

  1. Av = 1/(1 + r)
  2. Bv = (1 + r)
  3. Cv = (1 + r)/10
  4. Dv = (1/r)

Discounting one year at rate r gives v = 1/(1+r).

44.
★ Final term 2012Lecture 40

Formula for a geometric series "x + vx + v^2x + ... + v^(n-1)x" is

  1. AP(n) = x(1 - v^n)/(1 - v)
  2. BP(n) = (1 - v^n)/(1 - v)
  3. CP(n) = x(1 - v)/(1 - v^n)
  4. DP(n) = (1 - v)/(1 - v^n)

The sum of n terms with first term x and ratio v is x(1-v^n)/(1-v).

45.
★ Final term paper (screens, paper 2)Lecture 40

Under the individual replacement policy an item is replaced on its

  1. ASuccess
  2. BFailure
  3. CMaximum utilization
  4. DMinimum utilization

Individual replacement means each item is replaced only when it fails.

46.
★ Final term paper (screens, paper 2)Lecture 40

In replacement Models, Capital Cost = (Item / Machine Cots) - (--------------------).

  1. AResale Cost
  2. BRunning Cost
  3. CMaintenance Cost
  4. DOperating Cost

Capital cost is purchase price minus resale (scrap) value.

47.
★ Final term Fall 2005Lecture 40

According to ______ strategy, replace an item if it fails before the optimum period 'P'

  1. AIR
  2. BIPR
  3. CCPR (Common Preventive Replacement)

In individual preventive replacement an item is replaced on failure before age P, or preventively at P.

48.
★ Final term paper (screens, paper 2)Lecture 42

Many decision making problems involve a process that takes place in multiple stages in such a way that at each stage, the process is dependent on the strategy chosen. Such types of problems are called

  1. ALinear Programming problems
  2. BInteger programming problems
  3. CDynamic programming problems
  4. DAssignment problems

Multistage decision processes where each stage depends on the chosen policy are solved by dynamic programming.

49.
★ Final term 2012

In sequencing problems, the Johnson's algorithm in finding the optimal ordering of n jobs through 3 machines can be applied, if the problem is converted into following number of machines problems

  1. A3n
  2. B3n!
  3. C2×3 = 6
  4. D2

The n-jobs 3-machines case is reduced to an equivalent 2-machine problem (G = A+B, H = B+C) and Johnson's rule is applied.

50.
★ Final term 2012

Standard Deviation (S.D.) = ______ MAD

  1. A√(2π/3)
  2. B√(2/π)
  3. C√(π/2)
  4. D√(3π/2)

For a normal distribution SD ≈ 1.25 MAD = √(π/2) MAD.

51.
★ Final term 2012

MAD = ______ S.D.

  1. A√(2/π)
  2. B√(π/2)
  3. C√(2π/3)
  4. D√(3π/2)

For a normal distribution MAD ≈ 0.8 SD = √(2/π) SD.

52.
★ Final term 2012

If a company manufacture 'x' units of product 'A' and 'y' units of 'B' with associated profits of Rs.5 and Rs.3 then which of the following is the objective function to maximize is the profit?

  1. Az = 15xy
  2. Bz = 5x − 3y
  3. Cz = 3x − 5y
  4. Dz = 5x + 3y

Total profit is 5 per unit of A times x plus 3 per unit of B times y.

53.
★ Final term 2012

Zero valued artificial variables may appear as ______ variables in the final solution, when one or more of the original constraints equations is redundant.

  1. Anon basic
  2. Bbasic
  3. Cslacks
  4. Dsurplus

With redundant constraints an artificial variable can stay in the final basis at zero level, i.e. as a basic variable.

54.
★ Final term 2012

The inequality 2x + 3y ≥ 18 is equivalent to

  1. A2x + 3y ≤ −18
  2. B−2x − 3y ≥ 18
  3. C−2x − 3y ≥ −18
  4. D−2x − 3y ≤ −18

Multiplying both sides by −1 reverses the inequality sign.

55.
★ Final term paper (screens, paper 2)

The representation of reality in some physical form or in some form of mathematical equations may be discussed under the topic entitled as

  1. ATransportation problems
  2. BGame theory
  3. CSimulation
  4. DReplacement problems

Simulation imitates reality using a physical or mathematical model of the system.

56.
★ Final term paper (screens, paper 2)

Search and cutting methods are used to solve following types of problems

  1. ATransportation
  2. BAssignment
  3. CInteger Programming
  4. DQueuing problems

Branch-and-bound (search) and cutting-plane methods are integer programming techniques.

57.
★ Final term Fall 2005

For LP problem with 'n' decision variables, each of its corner point solution is at the intersection of ______ constraint boundaries.

  1. A(n - 1) constraint boundaries
  2. B'n' constraint boundaries
  3. C(n + 1) constraint boundaries
  4. DNone of the above

In n dimensions a corner point is fixed by n intersecting constraint boundaries.