MCQs for LP.docx

MCQs for Linear Programing 1.

Linear programming is also called linear optimization. a) Linear optimization b) Linear cost c) Linear profit d) Linear loss

2.

Optimization is calculating maximum profit when selling. a) Loss b) Profit c)

Cost

d) Resource 3.

Optimization is calculating minimum cost when manufacturing a) Profit b) Cost c)

Loss

d) Resource 4.

In linear programming functions are subjected to c onstraints. a) Minimizing b) Maximizing c)

Constraints

d) Loss 5.

The corner points are called vert ices. a) Origin b) Scope c)

6.

Vertices

The area between the vertices ve rtices is called feasible region. a) Profit b) Loss c)

Feasible area

d) Scope 7.

Vertices are the largest or the smallest values. a) Largest, smallest b) Profit, loss

8.

Purpose of linear programming for an objective function is to a) Adjacent modelling b) Subset modelling c)

9.

Maximize or minimize

For a linear programming equations, convex set of equations is included in region of  a) Profit solution b) Loss solution c)

Feasible solution

10. In graphical solutions of linear inequalities, solution can be divided into a) One subset b) Two subsets

c)

Three subsets

d) Four subsets 11. Linear programming used to optimize mathematical procedure and is a) Subset of mathematical programming b) Linear mathematical programming c)

All of the above

12. In linear programming, objective function and objective constraints are a) Linear b) Solved c)

Adjacent

d) Quadratic 13. Linear programming model which involves funds allocation of limited investment is

classified as a) Ordination budgeting model b) Capital budgeting models c)

Funds origin models

14. In transportation models designed in linear programming, points of demand is classified

as a) Destination b) Origin c) Ordination 15. In linear programming, lack of points for a solution set is said to a) Have no feasible region b) Have feasible region c)

Have single point method

16. In linear programming, number of requirements must be satisfied in simplex method are a) Two requirements b) Three requirements c)

Four requirements

17. In linear programming problems, set of basic variables which are appeared in linear

problem consists of  a) Slack and artificial variables b) Slack and real variables c)

Departing basic variables

d) None of the above. 18. Non basic variable which is used to replace basic variable is variable which has a) Most positive column b) Most negative column c)

Most negative row

d) Most positive row 19. In linear programming, term which states value of objective function improvement is

classified as a) Stated function b) Improvement function c)

Better programed

d) Best 20. In linear programming, most popular non-graphical procedure is classified as a) Linear procedure b) Graphical procedure c) Simplex method d) Graphical procedure 21. Overall goal stated as to represent function of decision variable is best classified as a) Subset function b) Objective function c)

Functional modeling

d) Programmed module 22. Factors such as limitations of resources and all conditions imposed by setting of problem

are classified as a) Proportional constraints b) Structural constraints c)

Unstructured constraints

d) All of the above 23. Non-negativity constraints implies that decision variable's will a) To be negative b) To be positive c) Must be negative d) Must be positive 24. Conditions needed to solve objective function and that are to be satisfied in linear

programming are classified as a) Unsolved objective b) Solved objective c)

Programming requirements

d) Subset objective 25. Types of constraints to maximize or minimize linear objective function does not include a) Structural constraints b) Non negative constraints c)

Proportional constraints

d) None of the above