Question Bank

 

UNIT-I

1. Objective Function

2. Decision Variable

3. Optimal Solution

4. Unbounded Solution

5. No Solution

6. Basic Feasible Solution

7. Degenerate

7. Linear Programming Problem

8. Standard Form of Linear Programming Problem

9. Inter Relationship between Primal and Dual.

Essay Questions

1. Solve the following LPP using graphical method

        Minimize Z = 20X1 + 10X2.

        Subject to Constraints X1 + 2X2  ≤  40

                                            3X1 + X2  ≥ 30

                                            4X1 + 3X2 ≥ 60  and X1, X2 ≥ 0

2. Find the Maximum value of Z = 5X1 + 7X2

    Subject to Constraints 3X1 + 8 X2 ≤ 24

                                        X1 + X2 ≤ 4

                                        10X1 + 7X2 ≤ 35        

3. Solve the LPP using graphicalmethod

    Max Z = 100X1 + 40X2

    Subject to 5X1 + 2X2 ≤ 1000

                    5X1 + 2X2 ≤ 900

                    X1 + 2X2 ≤ 500  and X1, X2 ≥ 0  

6, Solve the following LPP

    Max Z = 3X1 + 2X2

    Subject to X1 + X2  ≥ 1

                    X1 + X2  ≥  3, and X1, X2 ≥ 0  

7. Solve the following LPP

    Max Z = X1 + X2

    Subject to X1 + X2  ≤ 1

                   -3 X1 + X2  ≥  3, and X1, X2 ≥ 0 

7. Use the simplex method to solve LPP.

    Max Z = 3X1 + 2X2

    subject to constraints X1 + X2  ≤  4

                                            X1 - X2   ≤  2  and X1, X2 ≥ 0

8. Use the simplex method to solve LPP.

        Max Z = X1 + 2X2 + 3X3

        subject to 3X1 + 2X2 +X3  ≤ 3

                        2X1 + X2 +2X3  ≤ 2, and X1, X2, X3 ≥ 0

9. Solve by Big M method.

            Max Z = X1 + 2X2 + 3X3 -X4

            Subject to     X1 + 2X2 +3X3 = 15

                               2X1 + X2 + 5X3 = 20

                                X1 + 2X2 + X3 +X4 + 10, X1, X2, X3, X4   ≥ 0

10. Use penality method to solve the following LPP.

    MaxZ = 5X + 3Y

    subject to 2X + 4Y  ≤ 12

                    2X + 2Y = 10   

                    5X + 2Y ≥ 10 and X, Y  ≥ 0


11. Use two-phase simplex method to solve 

                    Minimize Z = X1-2X2 -3X3

                       subject to -2X1 + X2 +3X3 =2

                                            2X1 + 3X2 +4X3 =1 and X1, X2, X3  ≥ 0


12. Solve by two-phase simplex method.

            Max Z = -4X1 -3X2-9X3

            subject to 2X1 + 4X2 +6X3  ≥ 15

                            6X1 +X2 +6X3  ≥ 12

                                            and X1, X2, X3  ≥ 0

13. Use the duale Simplexmethode, to solve LPP

            Max Z = - 3X1 - 2X2

            subject to X1 + X2 ≥ 1

                             X1 + X2 ≤ 7

                              X1+2X2  ≥10

                               X2 ≤  3

                                    and X1, X2 ≥ 0

UNIT-II

Very Short and Short Answer Questions
1. Algorithm of NWC Rule
2. Algorithm of Matrix minima method
3. Algorithm of VAM.
4. Travelling Salesmen problem.
5. Hungarian Method.
6. Balanced and unbalanced TPP.
7.Degenerate solution in TPP.
8. Loop
 

Essay Questions

1. Obtain the IBFS of a transportation problem using NWC, Rowminima, Column minima, Matrixminima and VAM.



2. . Obtain the IBFS of a transportation problem using NWC, Rowminima, Column minima, Least Cost Entry method and Penality Method.



3. Obtain IBFS and then find the optimal solution by using MODI method.



4. Obtain the IBFS of a transportation problem using NWC, Rowminima, Column minima, Least Cost Entry method and Penality Method.



5.Consider the transportation problemm solve using MODI method.


6. A computer centre has four expert programmers and needs to develop four application programmes. The head of the computer centre, estimates the computer time (in minutes) required by the respective experts to develop the application programmes as follows. Find the assignment pattern that minimises the time required to develop the application programmes.


7. The company is faced with the problem of deciding on how to assign the existing agencies to dispatch the product to the additional cities in such a way that the travelling distance is minimised. The distances (in km) between the surplus and deficit cities are given in the following distance matrix.Determine the optimum assignment schedule.

8.  Five salesmen are to be assigned to five districts. Estimates of sales revenue (in thousands) for each salesman are given as follows:Find the assignment pattern that maximises the sales revenue.


9. A travelling salesman has to visit five cities. He wishes to start from a particular city, visit each city once and then return to his starting point. The travelling time (in hours) for each city from a particular city is given below:What is the sequence of visits of the salesman so that the total travelling time is minimised?


10. Solve the following travelling salesman problem so as to minimise the cost per cycle



11.  There are 5 jobs, each of which has to go through the machines A and B in the order AB. The processing times (in hours) are given as: Determine a sequence of these jobs that will minimise the total elapsed time T. Also obtain: i) the minimum elapsed time; and ii) the idle time for each of the machines.


12. 
There are 7 jobs, each of which has to go through the machines A and B in the order AB. Processing times (in hours) are given as follows:Determine a sequence of these jobs that will minimise the total elapsed time. Also calculate the various idle times.



13. There are six jobs, each of which must go through the machines A, B and C in the order ABC.Obtain the optimum sequence and minimum total elapsed time. 


14. There are four jobs are to be processed through on each of five machines. Find the optimum total minimum elasped time. 


UNIT-III

Short and Very Short Anser Questions
1. Project
2. Phases of Project
3.Network
4. Activity
5. Event
6. Dummay Activity
7.Predecessor and Successor
8. Construct a network for the project whose activities and their precedence relationship are given below.

9. Construct a network for the project whose activities and their precedence relationship are given below.

10. Indirect Cost
11. Direct Cost


Essay Questions
1. A project schedule has the following characters, construct network diagram, determine critical path, compute total and free floats.


2. . A project schedule has the following characters, construct network diagram, determine critical path, compute total and free floats.


3. The following table shows the jobs of a network alongwith their time stimates. Draw the network diagram and find the probability that the project is completed in 40 days.


4. Asmall project is composed of seven activities whose time estimates are listed in the below table. Draw the project diagram, determine the criticalpath, calculate variances of critical activities and also find what is the probability that the project will be completed 4 weeks earlier than expected, not more than 4weeks later than expected and of the project due date is 19 weeksm what is the probability of meeting the due date?


Cost-Consideration-PERT-Probleme

5. Determine the optimumproject duration and cost for the following data. Indirect cost is Rs. 70 per day.


6. The following time-cost table applies to a project. Use it to arrive at the network associated with completing the project in minimum time with minimum cost.


 UNIT-IV

Short Answer Questions

1. Dynamic Programming Problem

2. Bellman's Principle

3. Characteristics of  DPP

4. Steps to solve DPP

5. 



Essay Questions

1. Use the principle of optimality to find the

2. Use the Dynamic Programming to solve 
3. Use the DPP to solve 
4. The owner of four grocery stores has purchased six crates of fresh strawberries. The following table gives the estimated total profit at each store. Find the allocation of six crates to four stores so as to maximize the expected profit. 

 

No. of crates

Stores

1

2

3

4

0

0

0

0

0

1

4

2

6

2

2

6

4

8

3

3

7

6

8

4

4

7

8

8

4

5

7

9

8

4

6

7

10

8

4


5. 
       


    







 























Comments

Popular posts from this blog

Operations Research

Transportation Problems