Home > B.Sc (CS) > Quizzes > Computer Aided Optimization Techniques
Computer Aided Optimization Techniques
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 18% • Most missed: “In marking assignments, which of the following should be preferred?”
Computer Aided Optimization Techniques
Time left 00:00
25 Questions

1. The process that performs the services to the customer is known as ___________.
2. For a salesman who has to visit n cities, following are the ways of his tour plan___.
3. Service mechanism in a queuing system is characterized by_____.
4. If all aij values in the entering variable column of the simplex table are negative, then _____.
5. The assignment problem is a special case of transportation problem in which ______.
6. Given arrival rate = 15/hr, service rate = 20/hr, the value of traffic intensity is ___________.
7. Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to___________.
8. The model in which only arrivals are counted and no departure takes place are called _________.
9. The initial solution of a transportation problem can be obtained by applying any known method. How-ever, the only condition is that__________.
10. While solving a linear programming problem in feasibility may be removed by _________.
11. A activity in a network diagram is said to be __________ if the delay in its start will further delay the project completion time.
12. In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are _______.
13. The method used to solve Linear Programming Problem without use of the artificial variable is called __________.
14. An assignment problem is a particular case of ____________.
15. An activity is represented by __________.
16. In the production lot size model, increasing the rate of production _______ .
17. Cells in the transportation table having positive allocation will be called___.
18. A set of feasible solution to a Linear Programming Problem is ___________
19. If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is ____.
20. When the sum of gains of one player is equal to the sum of losses to another player in a game, this situation is known as_____.
21. A mixed strategy game can be solved by ____.
22. An activity which does not consume neither any resource nor time is known as________.
23. The Hungarian method used for finding the solution of the assignment problem is also called ___________.
24. The activity cost corresponding to the crash time is called the _____.
25. The cost of a slack variable is _________.

⚡ Recently practiced quizzes in this topic
Live quiz activity
Digital Forensics Decision Support Systems & Intelligent System B.Sc IT - Mobile Application Development Artificial Intelligence Database Management System Quiz Data Mining Basics BSc IT - Numerical Methods Research Methodology MCQs Introduction To Artificial Intelligence Visual Basic Programming
 
❤ 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.