Font size
WorksheetsDSN Part 2
Total questions: 10
Worksheet time: 5mins
Which one of the following is a valid objective function for a linear programming problem?
Max 5xy
Min 4x + 3y
Max 5x2 + 6y2
Min (x1 + x2)/x3
Certainty, additivity, linearity and divisibility are the properties of __________ model
Linear Programming
Matrices
Bayes Theorem
Queuing theory
Constraints in LP problem are called active if they
Represent optimal solution
At optimality do not consume all the available resources
Both a and b
None of the others
When solving LP model graphically, the area bounded by constraints are called
Infeasible Solution
Unbounded Solution
Feasible Region
Infinite Solution
________________ is used to determine how the optimal solution is affected by changes, within specified ranges of Objective function and Right Hand side of Constraints
Linear Analysis
Sensitivity Analysis
Pre Optimality Analysis
Decision Analysis
The __________ for each coefficient of objective function provides the range of values over which the current solution will remain optimal.
Range of Feasibility
Range of Infeasibility
Range of Optimality
Range of Shadow Price
A ________ shadow price indicates that the objective function will not improve if the RHS is increased.
Positive
Zero
Negative
Higher
If profit per unit from product A is Rs.7 and product B is Rs.9, then the objective function will be
Min S = 7X1+9X2
Max Z = 7X1+9X2
Max Z = 9X1+7X2
Min S = 9X1+7X2
The optimal solution lies in the corner points of the feasible region
True
False
The causes for Infeasible Solution (Select all that apply)
A formulation error has been made.
Management’s expectations are too high
Too many restrictions have been placed on the problem
Problem is properly constrained
