List of top Mechanical Engineering Questions on Operations Research asked in TS PGECET

In a graphical solution of solving Linear Programming Problem to convert inequalities into equations, they
The penalty of a row in a transportation problem is obtained by
Which of the cost estimates and performance measures are not used for economic analysis of a queuing system?
The activities of W, X, Y and Z are the direct precursors of A. What is the earliest starting time for A, if the activities of earliest finishing times are 12, 15, 10 and 6?
The penalty of a row in a transportation problem is obtained by
Which of the cost estimates and performance measures are not used for economic analysis of a queuing system?
The activities of W, X, Y and Z are the direct precursors of A. What is the earliest starting time for A, if the activities of earliest finishing times are 12, 15, 10 and 6?
In a graphical solution of solving Linear Programming Problem to convert inequalities into equations, they
The pessimistic time and optimistic time of completion of an activity are given as 10 days and 4 days respectively. Then the variance of the activity is
In a graphical solution of solving Linear Programming Problem to convert inequalities into equations, they
The penalty of a row in a transportation problem is obtained by
Which of the cost estimates and performance measures are not used for economic analysis of a queuing system?
The activities of W, X, Y and Z are the direct precursors of A. What is the earliest starting time for A, if the activities of earliest finishing times are 12, 15, 10 and 6?
In critical path method, critical path moves along with the activities having total float of:
Hungarian method is generally used to solve the following type of problem:
The charts which present graphically the process of work by showing the machine operation, man hour performance, quantities completed, etc., to facilitate day-to-day planning of the work are termed as
The artificial activity which indicates that an activity following it cannot be started unless the preceding activity is complete, is known as
The optimality of a transportation problem is determined by the application of:
In the case of solution of a two-variable linear programming problem by graphical method, if one constraint line comes parallel to the objective function line, the problem will have:
The cost of proving service in a queuing system increases with: