Q.1.
Non-negative condition in an LP model implies
Q.2.
Before formulating a formal LP model, it is better to
Q.3.
Which of the following is assumption of an LP model
Q.4.
The best use of linear programming is to find optimal use of
Q.5.
Which of the following is a limitation associated with an LP model
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.
Q.7.
The graph of y ≥ x - 3 is shaded ???
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?
Q.9.
The graph of y ≥ x - 3 uses a __?__ line
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.
Q.11.
Decision Tables can be used to specify complex decision logic in a high level software specification?
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.
Q.13.
While plotting constraints on a graph paper, terminal points on both the axes are connected by a straight line because
Q.14.
Which of the following is not a characteristic of the LP model
Q.15.
Which of the following statements is true with respect to the optimal solution of an LP problem
Q.16.
If the number of available constraints is 3 and the number of parameters to be optimized isthen
Q.17.
Non-negativity condition is an important component of LP model because
Q.18.
Maximization of objective function in an LP model means
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
Q.20.
For the constraint of a linear optimizing function z=x1+x2 given by x1+x2≤3x1+x2≥3 and xx2≥0