The concept of ‘loop’ is used ina) transportation problem b) assignment problemc) queuing problem d) none of these.ii) In LPP, feasible solution regions are restricted bya) negative restriction b) positive restrictionc) non-negative restriction d) none of these.iii) An assignment problem can be solved bya) Hungarian method b) VAMc) Matrix minima method d) None of these.iv) What is the method to solve an LPP involving artificial variables ?a) Simplex method b) Charnes-M-methodc) VAM d) None of these.v) The optimality condition for minimization LPP in the simplex method isa) Z j – C j ≥ 0 ∀ j b) Z j – C j ≤ 0 ∀ jc) Z j – C j < 0 ∀ j d) none of these.
Question
The concept of ‘loop’ is used ina) transportation problem b) assignment problemc) queuing problem d) none of these.ii) In LPP, feasible solution regions are restricted bya) negative restriction b) positive restrictionc) non-negative restriction d) none of these.iii) An assignment problem can be solved bya) Hungarian method b) VAMc) Matrix minima method d) None of these.iv) What is the method to solve an LPP involving artificial variables ?a) Simplex method b) Charnes-M-methodc) VAM d) None of these.v) The optimality condition for minimization LPP in the simplex method isa) Z j – C j ≥ 0 ∀ j b) Z j – C j ≤ 0 ∀ jc) Z j – C j < 0 ∀ j d) none of these.
Solution
i) The concept of 'loop' is used in a) transportation problem.
ii) In LPP, feasible solution regions are restricted by c) non-negative restriction.
iii) An assignment problem can be solved by a) Hungarian method.
iv) The method to solve an LPP involving artificial variables is a) Simplex method.
v) The optimality condition for minimization LPP in the simplex method is b) Z j – C j ≤ 0 ∀ j.
Similar Questions
The method used to solve LPP with out the use of artificial variables is called the .............. method.ans.
The method used to solve LPP with out the use of artificial variables is called the .............. method.ans.dual simplex methodcutting plane methodBig M methodsimplex method Previous Marked for Review Next
Which of the following statements is true regarding the solution methods for solving a linear programming (LP) model?Group of answer choicesThe Simplex algorithm is not the basis of most LP optimization software.The computer solution method uses the Evolutionary algorithm.The graphical solution method can handle LP models with any number of decision variables and constraints.None of the above.
Linear Programming(LP)（part 2）
When do we use linear programming technique? Explain mathematical formulation of Linear programming Problem (LPP).
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.