Linear Optimization (Math3122), Exam Questions Prepared by Walle

1.In Degenerate solution value of objective function.

• increases infinitely
• basic variables are non zero
• decreases infinitely
• . One or more basic variables are zero

2.Minimize Z =

• –maximize(Z)
• -maximize(-Z)
• maximize(-Z)
• none

3.In graphical representation the bounded region is known as region.

• Solution
• basic solution

• feasible solution
• optimal

5. Graphical optimal value for Z can be obtained from

• Corner points of feasible region
• corner points of the solution region
• Both A and C
• none of the above

6. In LPP the condition to be satisfied is

• Constraints have to be linear
• Objective function have to be linear
• both A and B
• none of the above

7.A feasible solution of LPP

• Must satisfy all the constraints simultaneously
• Need not satisfy all the constraints, only some of them
• Must be a corner point of the feasible region
• all of the above

8.Maximization of objective function in LPP means

• Value occurs at allowable set decision
• highest value is chosen among allowable decision

• all of the above
• none

9.The linear function of the variables which is to be maximize or minimize is called

• Constraints
• Decision variable
• Objective function
• None

10.The first step in formulating a linear programming problem is

• Identify any upper or lower bound on the decision variables
• State the constraints as linear combinations of the decision variables
• Understand the problem
• Identify the decision variables

11.In Graphical solution the feasible region is.

• where all the constraints are satisfied simultaneously.
• any one constraint is satisfied.
• only the first constraint is satisfying
• any one of the above conditions.