Question 1 :
What is the solution of $x\le 4,y\ge 0$ and $x\le -4,y\le 0$ ?
Question 2 : The given table shows the number of cars manufactured in four different colours on a particular day. Study it carefully and answer the question.<br/><table class="table table-bordered"><tbody><tr><td rowspan="2"> <b>Colour</b></td><td colspan="3"><b>   Number of cars manufactured</b></td></tr><tr><td><b> Vento</b></td><td><b> Creta</b></td><td><b>WagonR </b></td></tr><tr><td> Red</td><td> 65</td><td> 88</td><td> 93</td></tr><tr><td> White</td><td> 54</td><td> 42</td><td> 80</td></tr><tr><td> Black</td><td> 66</td><td> 52</td><td> 88</td></tr><tr><td> Sliver</td><td>37</td><td> 49</td><td> 74</td></tr></tbody></table>What was the total number of black cars manufactured?
Question 3 :
The corner points of the feasible region determined by the system of linear constraints are $(0, 10),(5, 5), (25, 20)$ and $(0, 30)$. Let $Z = px + qy$, where $p, q > 0$. Condition on $p$ and $q$ so that the maximum of $Z$ occurs at both the points $(25, 20)$ and $(0, 30)$is _______.
Question 6 :
In linear programming, lack of points for a solution set is said to
Question 7 :
Solving an integer programming problem by rounding off answers obtained by solving it as a linear programming problem (using simplex), we find that
Question 9 :
If x + y = 3 and xy = 2, then the value of$\displaystyle x^{3}-y^{3}$ is equal to
Question 11 :
Given a system of inequation:$\displaystyle 2y-x\le 4$<br/>$\displaystyle -2x+y\ge -4$Find the value of $s$, which is the greatest possible sum of the $x$ and $y$ co-ordinates of the point which satisfies the following inequalities as graphed in the $xy$ plane.<br/>
Question 13 :
Apply linear programming to this problem. A firm wants to determine how many units of each of two products (products D and E) they should produce to make the most money. The profit in the manufacture of a unit of product D is $100 and the profit in the manufacture of a unit of product E is $87. The firm is limited by its total available labor hours and total available machine hours. The total labor hours per week are 4,000. Product D takes 5 hours per unit of labor and product E takes 7 hours per unit. The total machine hours are 5,000 per week. Product D takes 9 hours per unit of machine time and product E takes 3 hours per unit. Which of the following is one of the constraints for this linear program?
Question 15 :
The Convex Polygon Theorem states that the optimum (maximum or minimum) solution of a LPP is attained at atleastone of the ______ of the convex set over which the solution is feasible.
Question 16 :
How many acres of each (wheat and rye) should the farmer plant in order to get maximum profit?
Question 17 : The given table shows the number of cars manufactured in four different colours on a particular day. Study it carefully and answer the question.<br/><table class="table table-bordered"><tbody><tr><td rowspan="2"> <b>Colour</b></td><td colspan="3"><b>   Number of cars manufactured</b></td></tr><tr><td><b> Vento</b></td><td><b> Creta</b></td><td><b>WagonR </b></td></tr><tr><td> Red</td><td> 65</td><td> 88</td><td> 93</td></tr><tr><td> White</td><td> 54</td><td> 42</td><td> 80</td></tr><tr><td> Black</td><td> 66</td><td> 52</td><td> 88</td></tr><tr><td> Sliver</td><td>37</td><td> 49</td><td> 74</td></tr></tbody></table>Which car was twice the number of silver Vento?
Question 18 :
In order for a linear programming problem to have a unique solution, the solution must exist
Question 19 :
In order to obtain maximum profit, the quantity of normal and scientific calculators to be manufactured daily is:
Question 20 :
For a linear programming equations, convex set of equations is included in region of
Question 22 :
$\displaystyle z=10x+25y$ subject to$\displaystyle 0\le x\le 3$ and$\displaystyle 0\le y\le 3,x+y\le 5$ then the maximum value of z is<br>
Question 23 :
Corner points of the bounded feasible region for an LP problem are $A(0,5) B(0,3) C(1,0) D(6,0)$. Let $z = -50x + 20y$ be the objective function. Minimum value of z occurs at ______ center point.
Question 24 : <p>In graphical solutions of linear inequalities, solution can be divided into</p><ol></ol>
Question 25 :
An objective function in a linear program can be which of the following?<br>
Question 26 :
Choose the most correct of the following statements relating to primal-dual linear programming problems:
