Scribd
Upload
61 views

QT

This document discusses key concepts in linear programming including: 1. Defining the feasible region and slack variables. 2. Describing different types of basic solutions and when a linear programming problem has a unique, infinite, or unbounded solution. 3. Distinguishing between a resource and a constraint in linear programming. It also covers transportation and assignment problems, asking about defining features, methods for solving them like MODI and Vogel's approximation, and the differences between transportation and assignment models.

Uploaded by

sureya smiley
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
61 views

QT

This document discusses key concepts in linear programming including: 1. Defining the feasible region and slack variables. 2. Describing different types of basic solutions and when a linear programming problem has a unique, infinite, or unbounded solution. 3. Distinguishing between a resource and a constraint in linear programming. It also covers transportation and assignment problems, asking about defining features, methods for solving them like MODI and Vogel's approximation, and the differences between transportation and assignment models.

Uploaded by

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

1. Define feasible region.

2. Define slack variables.


3. Define
i) Non degenerate basic solution
ii) Degenerate basic solution
4. When we say that an LPP have
i) unique solution
ii) an infinite number of solutions.
iii) An unbounded solution
iv) No solution

5. What do you understand by the term constraint? Give an example.


6. State the limitation of graphical method of solving a LPP.
7. What are the assumption underlying linear programmings?
8. What does the non-negativity restriction mean?
9. Name any two major requirements of LPP.
10. Distinguish between a resource and a constraint.
11. State any three salient features of a LPP.

Transportation models

12. What do you mean by transportation problem?


13. What is the purpose of MODI method?
14. How many basic variables will be there for a balanced transportation problem with 3 row
and 3 columns?
15. What is the use of vogels approximation method?
16.
Assignment problem
17. Distinguish between transportation model and assignment model.
18. What are assignment problems?

FILL IN THE BLANKS

1. Production should always ------------ or ----------- to the requirement so as to meet the


demand. (greater than, equal)
2. An LPP having more than one optimal solution is said to have ------- or ----------optimal
solutions. (multiple, alternative)
3. The set of feasible solutions to an LPP is a ----------. (convex set)
4. A basic solution is said to be -------- if none of the basic variable is zero. (non
degenerate)
5. For any transportation problem, the coefficients of all xij in the constraints are ---------
.(unity)
6. The co-efficient of artificial variables are –M in the objective function for ----------.
(maximization problems)
7. Row wise and column wise difference between two minimum costs is calculated under -
------method. (VAM)
8. An assignment problem is said to be unbalanced if -----------. (no. of rows≠ no.of
columns)
9. An assignment problem represents a transportation problem with all demands and
supplies equal to --------(1)

SAY TRUE OR FALSE


1. Linear programming is a mathematical technique used to solve the problem of
allocating limited resources among the competing activities. (true)
2. The main components of a decision model include the decision alternatives, the
constraints and the objective function. (true)
3. For the solution of any LPP by simplex method, existence of an initial feasible need
not be assumed. Is this true? (false)
4. Every equality constraint can be replaced equivalently by two inequalities. (true)
5. In a transportation problem, North West corner rule gives a better starting solution
than VAM method. (false)
6. A transportation problem can always be represented by balanced model. ( true)
7. Assignment problem is a particular case of LPP. (true)

CHOOSE THE CORRECT ANSWER

1. Linear programming model which involves funds allocation of limited


investment is classified as
a) ordination budgeting model b) capital budgeting models
c) funds investment models d) funds origin models
2.

You might also like