Home > BCA > Quizzes > Computer Based Optimization Techniques
Computer Based Optimization Techniques
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 19% • Most missed: “If there exists a saddle point for a given problem it, implies that the players …”
Computer Based Optimization Techniques
Time left 00:00
25 Questions

1. Graphical method of linear programming is useful when the number of decision variable are ________.
2. An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero opportunity cost be equal to the number of______.
3. If there is no non-negative replacement ratio in a sllution which is sought to be improved, then the solution is_____.
4. An activity is represented by __________.
5. The transportation problem deals with the transportation of ________.
6. In an LPP functions to be maximized or minimized are called ___________.
7. ____________ method is an alternative method of solving a Linear Programming Problem involving artificial variables
8. The dummy source or destination in a transportation problem is added to_______.
9. If the operating characteristic vary within time is called_____.
10. To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are___________.
11. The cell without allocation is called_________.
12. _____________ is a completely degenerate form of a transportation problem
13. The __________ time for an activity can be reduced by using increased resources.
14. SIRO refers to _______in queueing theory.
15. Chose the correct statement: A degenerate solution is one that_________.
16. A queuing system is said to be a ________ when its operating characteristic are dependent upon time
17. The average annual cost will be minimized by replacing a machine when_____.
18. A feasible solution of an LPP that optimizes then the objective function is called _________.
19. While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to_________.
20. The initial solution of a transportation problem can be obtained by applying any known method. How-ever, the only condition is that__________.
21. All the basis for a transportation problem is ____________.
22. The cell with allocation can be called____
23. The assignment problem is a special case of transportation problem in which ______.
24. If the given Linear Programming Problem is in its standard form then primal-dual pair is ____________.
25. For finding an optimum solution in transportation problem ____________ method is used.

⚡ Recently practiced quizzes in this topic
Live quiz activity
Introduction To Computers: Basics Operating Systems Review Computer Networking Practice Test Theory Of Computation System Analysis & Design Android Application Development Introduction To Computers: Operating Systems and Networking Internet And Web Design Network Security Quiz Relational D.B.M.S.
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.