Simplex Method Questions oa xo mS Perera recy Start Complete Exam Preparation Wea Practice ean (lee Ce Cpr Download App Question 1: View this Question Online > Simplex problem is considered as infeasiblewhen 1. All the variablesin entering column are negative 2. Variablesin the basisare negative 3. Artificial variable is present in basis. 4. Pivotal value is negative (Detailed Solution Below) Option 3: Artificial variable is present in basis De er) Reta Reocoaching India's Super Teachers for all govt. exams Under One Roof — ‘Simplex Method Question 1 Detailed Solution Explanation: Simplex Method: + Simplex Method is a stand optimized solution, typically. in inequalities, + The inequalities define a polygonal ique of solving linear programming problems for an g a function and several constraints expressed as jon and the solution is typically at one of the verticles. ‘Some Special Conditions of the Simplex Method: 1. Unbounded Solution: In the simplex method, if in the pivot column all the entries are negative or zero when choosing to leave the variable then the solution is unbounded. 2. infeasible Solution: In the simplex method, if artificial variables are present in the basis, then the solution obtained is infeasible. 3. Degenerated Solution: In the simplex method, if some of the values in the constant column are zero, then the solution becomesdegenerated. 4. Multiple Solution: In the simplex method, if the non-basic variable in the final simplex table showing the optimal solution to 2 problem, has a net zero contribution, then the condition of multiple optimal solutions arises. ge eRe ane or tieral Start Complete Exam Preparation Rey ete A) Dally Live eared Pacis Dos restos Er D> Download App Question 2:Based on final table of simplex LPPis said to have alternate solution if in (Cy- E,) row 1. One or more basic variable haszero value 2. Entering variable hasnegative coefficient 3. Below anon basicvariable there iszero 4, Optimum function value is oo” G Answer (Detail ii non basicvariable there is zero plex Method Question 2 Detailed Solution Explanation: ‘Simplex Method: + The simplex method is the most popular method used for the solution of linear programming problems (LPP). + The simplex method is a search procedure that shiftsthrough the set of basic feasible solutions, one ata time until the optimal basic feasible solution is identified. It can be used for two or more variablesas well It isnot used to examine all the feasible solutions. It deals only with a smalland unique set of feasible solutions, the set of vertex points (i.e. extreme points/corner points) of the convex feasible space that contains the optimal solution. All the resource values or constraintsshould be non-negative. All the inequalities of the constraintsshould be converted to equalities with the help of slack or surplus variables. Following are the special casesof the simplex method: Optimal solution: + If at least one of the non-basic variables in the (Cj - E,) row of the final simplex table has a zero value, it indicates that there is more than one optimal solution or has an alternate solution. Here, C; represents the values of the first row and E; represents the values of the last Tow. + If all the values in (C, - §) row are negative then it means that the optimal solution has been reached. Unbounded solution: + Ifall the replacement ratios, b;/ a, (a;- key column or pivot column coefficientsare nea: then it is an unbound solution ee rare ea,+ If artificial variables are present in the base, then the solution obtained is the infeasible solution. Degenerate solution: + If some of the values in the constantgalu'nn (b) are zero, then the solution becomes degenerate. Following are the set of variables in the simplex method: Artificial variables: + Thisveriable is introduced in caseof greater than or equal to type constraint to not violate the non- negativity constraint. Basic variables: + They can be defined asvariables which can take any value other than zero. Non-basic variables: + This variable is not in the basic solution and is having a value of zero. ‘Slack variables: + This variable is introduced in the simplex method to eliminate less-than (<) constraints. Surplus variable: + This variable is introduced in the simplex method to eliminate greater-than (>) constraints. PE ABR ola) Rn Se oa Start Complete Exam Preparation Pio bad rete Download App Question 3: View this Question Oniine > The simplex method is used for solving problems. 1. octagonal programming 2. Cartesiancorrelation3. queue matching, ~ Answer (Detailed Solution Below) Option 4: linear programming ‘Simplex Method Question 3 Detailed Solution Explanation: Simplex Method + The simplexmethod is the most popular method used for the solution of Linear Programming Problems (LPP). aff® + The Simplex method is a search procedure that shiftsthrough the set of basic feasible X solutions, one ata time until the optimal basic feasible solution is identified. .” + The simplex method is a step-by-step procedure in which we proceed in a systematicmanner from an initial feasible solution with an improvement in every iteration until we reach an ‘optimum solution. * If non- basic variables have non- positive coefficients it means that they ‘can not enter in solution and the current solution is optimum i) All the resource values or constraints should be nonnegative, il) Allthe inequalities of the constraint should be converted to equalities with the help of slackor surplus variables. WwW, iii) It canbe used for two or mors blesaswell. Following is the set of variables Simplex Method. + Artificial Variable + Thisvariable is introduced in caseof greater than or equal to type constraint to not violate the non- negativity constraint. + Basic Variables < They can be defined asvariables that cantake any value other than zero. + Non- basic Variables * Thisvariable is not in the basic solution and is having the value zero. + Slack Variable * Thisvariable is introduced in the simplex method to eliminate less-than (<) constraints. + Surplus Variable * This variable is introduced in the simplex method to eliminate greater-than (>) constraints. Fe rod Eee Becca) Ree Dae etn Start Complete Exam PreparationPena Practice Mock Tests [3] Masterclasses oreo Pave Question 4: View this Question Oniine > In simplexmethod, if basic variables satisfythe non- negativity constraints, the basic solution i. is ARR ra > 2. is basicfeasible solution 3. is basicinfeasiblesolution 4. does not exist ‘Answer (Detailed Solution Below) Option 2: is basic feasible solution ‘Simplex Method Question 4 Detailed Solution Explanation: BASIC SOLUTION (BS.) Asolution obtained by setti (n- m) variables to zero is called a basic solution, provided the determinant of the coefficie © remaining m variables is not zero. Basis Feasible Solution. A 8.FS.isa basicsolution which also satisfiesthe non-negativity restrictions. Thusin B.F.S.all basicvariables are #0 i.e., all basic variables are non-negative. Optimum Basic Feasible Solution. A basic feasiblesolution is said to be optimum, if it also optimizes (max. or min.) the objective function & eee rea icy Start Complete Exam Preparation RCC SectPeay Pi (w] Paes restau Py onz ra Download App Question 5: View this Question Online > In the Simplex method if in pivot column all the entries are negative or zero when choosing leaving variable then 1. Solution is Degenerate 2. Solution isinfeasible 3. Alternative optima oi J 4. Unbounded Answer (Detailéd Solution Below) Option 4: Unbounded ~ ‘Simplex Method Question 5 Detailed Solution Explanation: Simplex method: It is a step by step method in which solution is started with initial feasible solution and in the next step the initial feasible solution is improved, the steps are repeated until the ‘optimum solution is reached. Following are the set of variables in Simplex Method. * Artificial Variable = Thisvariable is introduced in caseof greater than or equal to type constraint to not violate the non- negativity constraint. * Basic Variables ° They canbe defined asthe variables which can take any value other than zero. + Non basic Variables ° Thisvariable is not in the basic solution and is having the value zero. + Slack Variable » Thisvariable is introduced in the simplex method to eliminate less-than (<) constraints. + Surplus Variable ° This variable is introduced in the simplex method to eliminate greater-than (>) eesA simplex table is shown below for example for the given objective function and constraints Maximize Z = 4x; + 6X2 + X3 Subject to 2x1- x2+ 3x95 5 Xs 2 Xa Xa, X32 0 - Cc | 4 0 0 “ [CB | Basis| X; S$, _S,|Solution| Ratio |. um | R,} 0 S$), 2 a e% vin Fa|.0 |BeEo 8 at z= XCBa; | 0 0 a= Saat 0 Entering variable Following are the special casesof simplex method: Under Simplex Method, the existenceof multiple optimal solutionsis indicated by a situation under which a non-basic variable in the final simplextable showing optimal solution to a problem, hasa net zero contribution. Optimal solution: If at least one of the non- basic variable in the (G- Z) row of the final simplex table has a Zero value, it indicates that there is more than one optimal solution. Unbounded solution: If all the replacement rations, bi/ai (ai - key column or pivot column coefficient are negative) then it is the solution is unbounded. Infeasible solution: If artificial variables are present in the base, then the solution obtained is infeasible. Degenerate solution: If some of the values in the constant column (b) are zero, then the solution becomes degenerate. eRe se econ etielal Start Complete Exam Preparation RoC Sct i ete oad Cons Dosh res ieacoag Extra)Download App Question 6 View this Question Online > In the Simplex method if in pivot column all the entries are negative or zero when choosing leaving variable then 1. Solution is Degenerate 2. Solution Isinfeasible NS vere: (Detailed Solution Below) Option 4: Unbounded ‘Simplex Method Question 6 Detailed Solution Explanation: Simplex method: It is a step by step method in which solution is started with initial feasible solution and in the next step the initial feasible solution Is improved, the steps are repeated until the optimum solution is reached. Following are the set of variables in Simplex Method. + Artificial Variable * Thisvatiable is introduced in caseof greater than or equal to type constraint to not violate the non- negativity constraint. ~ Basic Variables 2 They canbe defined asthe variables which can take any value other than zero. + Non basic Variables » Thisvatiable is not in the basicsolution and is having the value zero. * Slack Variable » Thisvariable is introduced in the simplex method to eliminate less-than (<) constraints. + Surplus Variable © This variable is introduced in the simplex method to eliminate greater-than (>) constraints. A simplex table is shown below for example for the given objective function and constraintsMaximize Z = 4x, + 6X2 + X3. Subject to 2x - x2+ 3x9< 5 xs 2 X, Xa X32 0 cGi{4 6 1 0 0 ‘a [CB, | Basis| X, XS, §, | Solution Riot 2:i4: 3 4 oO 7 fo" o” leaving Palo oli ok a 2 variable %=208a [0 0 0 a=e-% | 4 Or 0 | Entering variable Following are the specialcasesof simplex method: Under Simplex Method, the existenceof multiple optimal solutionsis indicated by a situation under which a non-basic variable in the final simplextable showing optimal solution to a problem, hasa net zero contribution. Optimal solution: If at least one of the non- basicvariable in the (C- Z) row of the final simplex table has a Zero value, it indicates that there is more than one optimal solution. Unbounded solution: If all the replacement rations, bi/ai (ai - key column or pivot column coefficient are negative) then it is the solution is unbounded. Infeasible solution: If artificial variables are present in the base, then the solution obtained is infeasible. Degenerate solution: If some of the valuesin the constant column (b) are zero, then the solution becomes degenerate. Eee eo) Start Complete Exam Preparation aca Secor Po Ree bcd ote reise B® Download AppQuestion 7 View this Question Online > simy ethod of solving linear programming problem uses 1. all the points in the feasibleregion 2. only the comer points of the feasible reaion 3. intermediate points within the infeasible region 4. only the interior points in the feasible region Anewer (Detailed Solution Below) Option 2:: only the comer points of the feasible region ‘Simplex Method Question 7 Detailed Solution Explanation : Ms ‘Simplex method: + The simplex method is the gost popular method used for the solution of Linear Programming Problems(LPP). + The Simplex method is as rocedure that shiftsthrough the set of basic feasible solutions, one ata time until the optimal basic feasiblesolution is identified. + It canbe used for two or more variablesas well (alwaysadvisable for more than two variables to avoid lengthy graphical procedure). + The simplex method is not used to examineall the feasible solutions. + It deals only with a small and unique set of feasible solutions, the set of vertex points (Le. extreme points/corner points) of the convex feasible space that contain the optimal solution. + All the resource values or constraintsshould be non-negative. + All the inequalities of the constraint should be converted to equalities with the help of slackor surplus variables. & eR SBR ur Berl) Start Complete Exam Preparation rao Cee sx M eed Question BankD Download App Question 8 View this Question Online > Comprehension: One unit of product P, requires 3 kg of resource R, and 1 kg of resource Rp. One unit of product P, requires 2 kg of resource R; and 2 kg of resource Ro. The profits per unit by selling product P, and P, are Rs. 2000 and Rs. 3000 respectively. The manufacturer has 90 kg of resource R; and 100kg of resource Ry. The unit worth of resource Rj i.e., dual price of resource R2 in Rs. Perkg is 2. 1350 3. 1500 4. 2000 Answer (Detailed Solution Below) Option 1:0 ‘Simplex Method Question 8 Detailed Solution Concept: . Unit worth or Dual price or Shadow prize or Marginal prize: If the RHS of given constraints increased by 1 unit, then the correcsonding increse in Z value (Profite) isKnown asDula Prize of that constraint. The unit worth of redundent constraint will be zero. From the given data, the table below can be extracted, _ Resources P; Py Availability R; 3 2: 90 Ro 1 2 100 Profit per unit 2000 3000Number of units x y Znax= 2000x+ 3000y Subjected to ax+2ys90 > oe tHe <1 x+2y<100 3 ae + & <1 For the above contraints, Graphical method can be employed to maximizethe profite ¥ 50 B(0, 45) A(30,0) 100 calulation: The feasibleregion cosistsof comer points where the optimal solution lies. The optimal solution is one of the best feasible solution where the objective function value is maximum in caseof maximization problem and minimum in minimization problem. Corner points of the feasiblereason are A(30 ,0) B(0, 45) Z, = 2000 x 30+ 3000 x 0 = 60,000 Z, = 2000x 0 + 3000x 45 = 1,35,000 Solution is optimal at B, x= 0, y = 45 Zmax= 1,35,000 for B(0, 45) To calulate the unit worth of resource R, 3x+ 2y+ S,= 90,3x 0+ 2x 45+S, = 90 S, = DieR, resources fully utilised X+ 2y+Sp= 100,042% 45+ S)= 100,S)= 10 Le Ry resource is unutilized at optimality. Hence dual price of Re is zero. Alternate method: Concept: Unit worth or Dual price or Shadow prize or Marginal prize:he creas ected Choker hh meechaded Whee cid, odds oo ks nee a oe is Known asDula Prize of that constraint. The unit worth of redundent constraint will be zero. From the given data, the table below can be extracted, Resources P, Py Availablity - R, 3 2 ~ 90 Ro 1 2 100 Profit per unit 2000 3000 Number of units x ¥ Znax= 2000x+ 3000y ‘Subjected to 3x+ 2y< 90 = a + ds S ---(1) x+2ys100 3 40+ <1 ---(2) For the above contraints, Graphical method can be employed to maximizethe profite Y 50 B(O, 45) (30,0) 100 Explantion: From the above representation of the feasibleregion, it can be noticed that the constraint 2 (constraint correspondinmg to R2) is redundent constraint es there will be no effect on feasible Tegion even after decrese of the resource Ro. = Rz resource Is unutilized, hence dual price of R2 Is zero. eerie) “a en Start Complete Exam Preparation Ca te a Caer Coa increQuestion 9 ‘View this Question Online > While solving an LPP (defined by n variablesand m equations, m < n) through simplex method, basic solutions are determined by setting n - m variables equal to zero and solving m equations to obtain solution for remaining m variables, provided the resulting solutions are unique. Thismeans that ‘the maximum number of basicsolutions is: 1. etm aA 3. antfrctm}t 4. teem Answer (Detailed Solution Below) Option 1: mmtgr-m}:Co Pee na ar omplete Exam Preparation Start C aS Pi t CA Serena ire. od eins MasterCl oresieacrg Download App Px r) Question 10 View this Question Online > Maximum Z= 5x; + 3% ‘Subject to Xt 2% 10, XX 5 8, X Xz 0. In the starting Simplex tableau, x, and x2 are non-basic variables and the value of Z is zero. The value of Z In the next Simplex tableau Is Answer (Detailed Solution Below) 40India's #1 Learning Platform Re err Pela mee) (CM cies rte la lel) ete @ Download App Se oe ian variable of LPPand unrestricted in sign then this variable can be converted into x= x’ -x" so asto solve the LPPby simplexmethod, where: 1. x's Oandx">0 2. x= Oandx"< 0 3. x'andx"s 0 4. x andx">0 Answer (Detailed Solution Below) Option 4: x’and x" = 0 India’s #1 Learning Platform ay ae PSE Ta mM) CM d elec Lacela) ieee feared is Des helen resus Exe) jownload App Question 12 View this Question Online >One unit of product P; requires 3 kg of resource R, and 1 kg of resource Rp. One unit of product P, requires 2 kg of resource R; and 2 kg of resourceRp. The profits per unit by selling product P; and P, are Rs. 2000.and Rs.3000 respectively. The manufacturerhas 90 kg of resource R and 100 kg of Tesource Rp. The manufacturer can make a maximum profit of Rs. 1. 60000 2. 135000 3. 150000 4. 200000 Answer (Detailed Solution Below) Option 2: 135000Ra & ieee ac Pela eMC mre L eel) Pann oe Bik. Question Bank Download App Question 13 Simplex problem is considered as infeasiblewhen 1. All the variables in entering column are negative 2. Variablesin the basisare negative 3. Artificial variable is present in basis 4. Pivotal value is negative Bec tar cert View this Question Online >rs dereertptacaiy eters ences te htt Option 3 : Artificial variable is present in basis Ro India’s #1 Learning Platform Ree eet Start Complete Exam Preparation Ca Eran one Eigse Des Chelen resinous Ext ez) Question 14 View this Question Online > Basedon final table of simplex LPPis said to have alternate solution if in (Cj- E) row 1. One or more basic variable haszero value 2. Entering variable hasnegative coefficient3. Below anon basic variable there iszero 4. Optimum function value is zero Answer (Detailed Solution Below) Option 3: Below anon basicvariable there is zeroal GRE ABR Re rl) Start Complete Exam Preparation Wears ia ree Coase Download App ‘Question 15 The simplex method isused for solving 1. octagonal programming 2. Cartesiancorrelation 3. queue matching 4. linear programming Answer (Detailed Solution Below) Option 4: linear programming problems. een Ae oe View this Question Online >