Scribd Logo
Upload

Welcome to Scribd!

  • 46 views

    Linear+Programming MCQ by Testbook

    Uploaded by

    omar ahmed
    Linear+Programming MCQ By Testbook

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content

    You might also like

    Linear+Programming MCQ by Testbook

    Uploaded by

    omar ahmed
    46 views13 pages
    Linear+Programming MCQ By Testbook

    Original Title

    Linear+Programming MCQ By Testbook

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Linear+Programming MCQ By Testbook

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    Download as pdf
    46 views13 pages

    Linear+Programming MCQ by Testbook

    Uploaded by

    omar ahmed
    Linear+Programming MCQ By Testbook

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    Download as pdf
    of 13
    ft testbook.com Linear Programming Questions Question 1: In atransportation problem with 4 supply points and 5 demand points, how many number of constraints are required in its formulation? Options: 1.20 24 3.0 49 Correct Answer: Option 4 (Solution Below) Solution: Concept: In a transportation prablem with m supply paints and n demand points Number of constraints = m+n Number of variables = m xn Number of equations =m+n-1 Calculation: m=4,n=5 Number of constraints =m+n=4+5=9 fay BUR Cec n ale) aioli) Peery STC Fi Goegle Pay Question 2: For the following LPP - Max. = 0.1 x4 0.6 x2 2xq + 5x2 $ 80 xq + x2 20 4,220 to get the optimum solution, the values of x4, x2 are - Options: 1. (20,0) 3 (20 40 e2 2. (0, 16) 4. None of these Correct Answer: Option 3 (Solution Below) Solu Concept: Convert the inequality constraints into equations and find the common poirts of the bounded region. Calculations: Given, LPP. Max. Z = -O.1 x +0.5x3 Duy + 5xq $80 x #520 xy. 20 Convert the inequality constraints into equations, we have 2ny + Sxy = BO xy t= 20 2x, + 5xq = 80 passes through the point (0, 16) and (40, 0) X +Xq = 20 passes through the point (0, 20) and (20, 0) x, +x, = 20 2 x 2x, + 5x, = 80 20 40 Nowy, the co ordinates of the point A= (0, 15), B = (20, O)and C = & =) (0, 16) (20, 0) (Comer Point | Coordinate of point|value of Z| 8 ry Here, maximum value occurs at (0, 16) For given Max. Z=-0.1 x +0.5% 2x; + 5x) 80 xy tx) 520 Xp 20 to get the optimum solution, the values of x, x2 are (0, 16) Peed BU CRC el] aed iu Cues cd Question the ( constraint of a primal (maximisation) is equality, then the dual (minimisation) variable ‘y; is: Options: 1.20 2.0 3. Unrestricted in sign 4. None of the above Correct Answer: Option 3 (Solution Below) Solution: Explanation Duality + For every linear pragremming problem there exists a related unique iinear programming problem involving the same data which also describe and solve the original problem + In Duality our aim is to find a Transpose matrix of the iritial given problem known as Primel + Itis done by transposing row and column and the final solution of both the problem willbe the same Primal (Maximisation) Dual ( Minimisation) #* consiraint < i variable = 0 i constraint = i variable < 0 i constraint = J variable unrestricted iM variable 2 0 JP constraint = iM variable s 0 iM constraint s jt variable unrestricted i constraint = Ditestbook The Complete Exam Preparation aE Cela) | : Saat Question 4: In order that linear programming techniques provide valid results, Options: 1. Relations between factors must be linear (Positive) 2. Relations between factors must be linear (Negative) 3. aorb 4. none of the above Correct Answer: Option 3 (Solution Below) Solu Concept: Linear Programming: Linear programming is an important optimization (maximization or minimization) technique used in decision making in business and every — day life for obtaining the maximum or minimum values as required of linear expression, subjected to satisfy a certain number of gven linear restrictions Linear programming problem (LPP): The lineer programming problems general calls for optimizing (maxim zingéminimizing) a linear function of variables called the objective function subject to a set of linear equations andior Inear inequations called the corstraints or restrictons The function which is to be optimized (maxmized or minimized) is called objective function. The system of linear inequations (or equations) under which the objective function is to be optirrized ate called the constraints. A primary requirement of an LPP is that both the objective function and all the constraints must be expressed in terms of linear equations and inequalities. And all the decision variables must be non-negative. Ditestbook BN Mew cue ell) a rtselt) CUES’ Question 5: When did BCAS become an independent body under the Ministry of Civil Aviation? Options: 1. 1987 2. 1978 3. 1998 4. 1985, Correct Answer: Option 1 (Solution Below) Solu The correct answer is 1987. Cp key-Points * BCAS become an independent hody under the Ministry of Civil Aviation in 1987. + BCAS stands for Bureau of Civil Aviation Security. The BCAS was initially set up as @ cell inthe DGCA in January 1978 on the Recommendation of the Pande committee. + BCAS was reorganized into an independent department under the ministry of Civil Aviation on 1st April 1987. + BCAS headquarter is located at ‘A’ Wing Janpath Bhawan, New Delhi. + Senior IPS officer Kumar Rajesh Chandra was appoirtod as Chief of bureau of Civil Aviation security aviation, security wing of the government + BCAS became an independent agency of the Ministry of Civil Aviation as a result of the bombing of Air India flight 182 in 1985 by the Sikh militant group Babbar Khalsa + The main responsibilities of BCAS include laying down standards and measures with respectto security of civil fights et international and domestic airports in Incia Pale BUR Ce CHM Cele Cy Question 6: Which leading airline has the largest market share In India? Options: ee 2. Spice Jet 3. Indigo Airlines 4. Go Air Correct Answer: Option 3 (Solution Below) Solu The correct answer is Indigo Airlines. Cp key-Points * Indigo is an Indian low-cost Airline which is headquartered in Gurugram, Haryana in India. Indigo was founded in 2006 as a private company by Rahul Bhatia of interglobal Enterprises and Rakesh Gangwal. Indigo Airlines is a domestc airlines. Indigo has 43 % domestic market share. Additional Information + Jet Airways was an Indian international airline at Mumbai in India. Jet Airways was the largest commercial passenger airline in India with passenger market share of 22.6%. * Spice Jet Is an Indian low cost airline headquartered in Haryana. It Is second largest domestic airlines in our country. Spice Jet has market share of 13.6% as of March 2049. + Go Airis an Indian low cost airline headquartered in Mumbai, Maharashtra. Go Air airline is owned by the Indian business Vaidya group. Godir Airlines founded by Jehangir Wadia Wadia in 2005. Go Air has 8.4% passenger market share. yee BUM Cece el) BCC Question 7: Which of the following methods is commonly used to solve assignment problems? Options: Sn 2. Hungarian method 3. North - west corner method 4. Vogel's approximation method Correct Answer: Option 2 (Solution Below) Solution: Explanation There ere mainly four methods to solve assignment problems. + Hungarian method + Enumeration Method + Simplexmethod + Transportation method The most common method used for solving assignment is: Hungarian Method Hence, option B's the correct answer Ditestbook The Complete Exam Preparation aE Cla) ECCS Question 8: A product made in two factories, P and Q, is transported to two destinations, R and S. The per unit cost of transportation (in Rupees) from factories to destinations are as per the following matrix. —Qestination | RTS 7| 4] Factory P produces 7 units and factory Q produces 9 units of the product. Each destination requires 8 units. If the north-west corner method provides the total transportation cost as X (in Rupees) and the optimized (the minimum) total transportation cost is Y (in Rupees), in (X- Y), in rupees, is saeccvaa ee eeca? 1.0 2.15 3.28 4. 105 Correct Answer: Option 3 (Solution Below) Solu hnitial solution by North-west corner Rule R s P| 10 7 | 70 7 a} 3 4 | 9180 1 8 8/0 8/0 16 16 X=10x7+3x14+4x8 X=Rs 105 Optimality. As the total number of allocations are m + n-1 =3 and at independent positions. So optimality can be performed Modified distribution (MODI-Method) 1) Cost matrix or allocated cells only and finding u; & y, value taking vy = 0 1 uy 10] 10 u3} 3 4 uy HV, = 10 uy = 10 Ug + = 3 Ug =3 Up +¥)=4 59 =4 2} Develop u, + v, Matrix for unallocated cells by entering sum of u, & v, value for unallocated cells NW 1} u, + v, Matrix for unallocated cells. 3) Subtract cell values of u; + vj Matrix fram original cast Matrix ta get cell evaluation Matrix TA 47 Cell Evaluation Matrix As one cell value is still -ve so, the current solution is not optmum Cell Evaluation Matrix: Performing optimality we select the smallest allocation with — ve sign, to be alocated at identified cells. Smallest allocatian is 7 Units, which is allocated at identified cell So, the new allocations are and the corresponding cost R s P| 10 7 Z o| 2 4 8 1 =7K7T+3x8+4x1 =Rs77 Now again we have to check whether the current solution is optimum 4) cost Matrix for allocated calls and u, & vj value oO 1 6 7 Making 6 Meking uty, Matrix for 5 7 4 unallocated cells u, + v,for unallocated cells 2) Subtracting from original cost Matrix to get cell evaluation Matrix, Cell Evaluation Matrix As all the cell values are +ve in the cell evaluaton Matrix. So, the current solution is optimum. So,¥=Rs.77 And X.Y = 105-77 =Rs. 28 Ditestbook The Complete Exam Preparation Platform ACY Question 9: If there are m sources and n destinations in a transportation matrix, the total number of basic variables in abasic feasible solution is Options: 1m+n 2m+nt1 3.m+n-1 4m Correct Answer: Option 3 (Solution Below) Solution: Explanation: Fg 2 % is the number of units shipped trom ith source to jh destination, then the equivalent LPP model will be Minimize 2 = 22 2 cyt y Sua Subjected to Sey

    You might also like