Q.1
Non-negative condition in an LP model implies
  • a positive coefficient of variables in objective function
  • a positive coefficient of variables in any constraint
  • non-negative value of resourse
  • none of the above
Q.2
Before formulating a formal LP model, it is better to
  • express each constraints in words
  • express the objective function in words
  • verbally identify decision variables
  • all of the above
Q.3
Which of the following is assumption of an LP model
  • divisibility
  • proportionality
  • additivity
  • all of the above
Q.4
The best use of linear programming is to find optimal use of
  • money
  • manpower
  • machine
  • all the above
Q.5
Which of the following is a limitation associated with an LP model
  • the relationship among decision variables in linear
  • no guarantee to get integer valued solutions
  • no consideration of effect of time & uncertainty on lp model
  • all of the above
Q.6
Write the system of inequalitiesCarlos works at a movie theater selling tickets. The theater hasseats and charges $7.for adults and $5.for children. The theater expects to make at least $for each showing.
  • x+y≤3007.5x+5.5y≥2000
  • x+y<3007.5x+5.5y≥2000
  • x+y≤3007.5x+5.5y≤2000
  • x+y>20007.5x+5.5y≤300
Q.7
The graph of y ≥ x - 3 is shaded ???
  • Over / Above
  • Under / Below
Q.8
Rachel owns a car and a moped. She has at mostgallons of gas to be used between the car and the moped. The car's tank holds at mostgallons and the moped's 3 gallons. The mileage for the car ismpg and for the moped ismpg. What are the variables you need to define?
  • x is gas, y is mileage
  • x is car, y is moped
  • x is gas, y is moped
  • x is car, y is mileage
Q.9
The graph of y ≥ x - 3 uses a __?__ line
  • Dashed
  • Solid
  • Horizontal
  • Vertical
Q.10
Cullin needs to save at least $for homecoming. He works 2 jobs earning $8/hour at Culvers and $25/hour mowing lawns. He only has time to workhours before homecoming.
  • x + y  ≥ 25x + y ≤ 8
  • 100x + 25 y ≤ 1002x + 8y ≤ 14
  • x + y ≥ 1008x + 25y ≤ 14
  • 8x + 25y ≥ 100x + y ≤ 14
Q.11
Decision Tables can be used to specify complex decision logic in a high level software specification?
  • True
  • False
Q.12
Programming Methods- the use for programming methodology it depends upon the size and the complexity of the program. When a program beyond a particular size and complexity, a traditional methodology may fail to give efficient results and in the case one has to either use a new method which will satisfy the need.
  • True
  • False
Q.13
While plotting constraints on a graph paper, terminal points on both the axes are connected by a straight line because
  • The resources are limited in supply
  • The objective function as a linear function
  • The constraints are linear equations or inequalities
  • All of the above
Q.14
Which of the following is not a characteristic of the LP model
  • Alternative courses of action
  • An objective function of maximization type
  • Limited amount of resources
  • Non-negativity condition on the value of decision variables.
Q.15
Which of the following statements is true with respect to the optimal solution of an LP problem
  • Every LP problem has an optimal solution
  • Optimal solution of an LP problem always occurs at an extreme point
  • At optimal solution all resources are completely used
  • If an optimal solution exists, there will always be at least one at a corner
Q.16
If the number of available constraints is 3 and the number of parameters to be optimized isthen
  • The objective function can be optimized
  • The constraints are short in number
  • The solution is problem oriented
  • None of these
Q.17
Non-negativity condition is an important component of LP model because
  • Variables value should remain under the control of the decision-maker
  • Value of variables make sense & correspond to real-world problems
  • Variables are interrelated in terms of limited resources
  • None of the above
Q.18
Maximization of objective function in an LP model means
  • Value occurs at allowable set of decisions
  • Highest value is chosen among allowable decisions
  • Neither of above
  • Both a & b
Q.19
In graphical method of linear programming problem if the iOS-cost line coincide with a side of region of basic feasible solutions we get
  • Unique optimum solution
  • unbounded optimum solution
  • no feasible solution
  • Infinite number of optimum solutions
Q.20
For the constraint of a linear optimizing function z=x1+x2 given by x1+x2≤3x1+x2≥3 and xx2≥0
  • There are two feasible regions
  • There are infinite feasible regions
  • There is no feasible region
  • None of these
0 h : 0 m : 1 s