Scribd
Upload
4 views

or qb model

The document outlines key concepts and methods related to linear programming, game theory, and project management, including definitions of degenerate and non-degenerate solutions, optimal sequences, and critical paths. It also presents various mathematical problems and methods such as the graphical method, simplex method, and Vogel’s approximation method for solving linear programming and assignment problems. Additionally, it discusses the characteristics of zero-sum games and provides examples of project network activities and their durations.

Uploaded by

Boomika G
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

or qb model

The document outlines key concepts and methods related to linear programming, game theory, and project management, including definitions of degenerate and non-degenerate solutions, optimal sequences, and critical paths. It also presents various mathematical problems and methods such as the graphical method, simplex method, and Vogel’s approximation method for solving linear programming and assignment problems. Additionally, it discusses the characteristics of zero-sum games and provides examples of project network activities and their durations.

Uploaded by

Boomika G
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

1.

If one or more of the basic variables are non zero then the basic solution is said
to be Non –degenerate.
2. The set of feasible solution to a Linear programming problem is a convex set
3. The entering variable in the non-basic variable corresponding to zj -cj iS most
negative.
4. The leaving variable is the basic variable corresponding to Min(Θ)

5. The problem is of maximization type and maximum value of z is attained at a


Unique optimal solutions
6. Any feasible solutions which optimizes the objective function of the LPP is called
Optimal
7. The entering variable of key row and key column is known as the Pivot element.
8. The necessary and sufficient condition for a transportation problem to have a
unfeasible solution Balanced transportation.
9. A basic feasible solution that contains m+n-1 non negative allocations is said to
be Non degenerate.
10. vogel’s approximation method is also known as unit cost penalty method.
11. A basic feasible solution that contains less than m+n-1 non negative allocations
is said to be degenerate
12. An assignment problem is always a degenerate form of a Transportation.
13. VAM method is also known as Penalty method.
14. The time the machine remains idle during the total elapsed time Idle time.
15. The optimal sequence for n jobs on 2 machines Johnsons method.
16. The necessary condition for three machine problem is converted into two machine
problem is Min 𝐴𝑖2 ≥ 𝑀𝑎𝑥𝐴𝑖1
17. The necessary condition for n machine problem is converted into two machine problem
is Min 𝐴𝑖1 ≥ 𝑀𝑎𝑥𝐴𝑖𝑗 .
18. No passing rule is used in Sequencing problem.
19. The algebraic sum of gains and losses of all the players is non zero in a game is called
Non zero sum game.
20. The algebraic sum of gains and losses of all the players is zero in a game is called zero
sum game.
21. The gains resulting from a two person zero sum game can be represented in the matrix
form is called Rectangular games.
22. There are finite number of competitors called players.
23. Each player has a list of finite number of possible activities.
24. What is the value of game
-1 2 -2
6 4 -6

25. PERT - Program evaluation review technique.


26. All activities in any critical path are called as Critical activity.
27. The difference between the free float and slack tail of the activity is called Independents
floats.
28. Free float = Total float – slack event
29. Longest duration in any project network is said to be Critical path.
30. Dummy activity is also said to be Imaginary activity c.
1. Solve the following LPP by graphical method Max z = 100x+40y,
5x+2y≤ 1000,3x+2y≤900,x+2y≤500 ,x,y≥ 0
2. Solve the following LPP by Simplex method Max z = 20x+6y+8z,
8x+2y+3z≤ 250,4x+3y≤150,2x+z≤50 ,x,y, 𝑧 ≥ 0
3. Solve the assignment problem

3 6 2 6
7 1 4 4
3 8 5 8
6 4 3 7
5 2 4 3
5 7 6 4
Determine basic feasible solution to the following transportation problem by NWCR
1 2 1 4 30
3 3 2 1 50
4 2 5 9 20
20 40 30 10
Solve the assignment problem
8 5 2 6 1
0 9 5 5 4
3 8 9 2 6
4 3 1 0 3
9 5 8 9 5
There are five jobs each of which is to be processed through two machines M1 and M2 in order
M1,M2 processing hours are as follows
Job 1 2 3 4 5
M1 6 2 10 4 11
M2 3 7 8 9 5

Find the sequence that minimizes the total elapsed time required to
complete the following on machine M1,M2,M3
TASK A B C D
M1 5 7 6 9
M2 2 1 4 5
M3 3 7 5 6
Determine the optimum sequences ,total elapsed time and also elapsed
time
Determine the optimum sequences ,total elapsed time and also elapsed time
Find the sequence that minimizes the total elapsed time required to complete
the following on machine M1,M2,M3
TASK A B C D E F G
M1 3 8 7 4 9 8 7
M2 4 3 2 5 1 4 3
M3 6 7 5 11 5 6 12
Determine the optimum sequences ,total elapsed time and also elapsed time

Reduce the following game by dominance and final the game value

I II III IV
I3240
II 3 4 2 4
III 4 2 4 0
IV 0 4 0 8

Solve the following game without saddle point


5 1
3 4

Solve the following 3*3 game


-1 2 1
1 -2 2
3 4 -3

In a game of matching coins with two players suppose A wins one unit value when there
are two heads , wins nothing when there are two tails and looses half unit value when
there are head and one tails .determine the pay off matrix , the best strategy for each
players and the value of the game .
Construct the network for the project and it consists of the following activities
activity 1-2 2-3 1-4 2-5 2-6 3-6 4-7 5-7 6-7
Least time 3 2 6 2 5 3 3 1 2
Greatest 15 14 30 8 17 15 27 7 8
time
Most likely 6 5 12 5 11 6 9 4 5
Calculate network and critical path of the activity
Activity 1-2 2-3 2-4 3-5 3-6 4-6 4-7 5-8 6-8 7-8
duration 2 3 5 4 1 6 2 8 7 4

Draw the network


Activity A B C D E F G
predecessor - A A B C,D - E,F

You might also like