Advertisements
Advertisements
प्रश्न
Which of the following sets are convex?
पर्याय
{(x, y) : x2 + y2 ≥ 1}
{(x, y) : y2 ≥ x}
{(x, y) : 3x2 + 4y2 ≥ 5}
{(x, y) : y ≥ 2, y ≤ 4}
Advertisements
उत्तर
{(x, y) : y ≥ 2, y ≤ 4}
{(x, y) : y ≥ 2, y ≤ 4} is the region between two parallel lines, so any line segment joining any two points in it lies in it. Hence, it is a convex set.
APPEARS IN
संबंधित प्रश्न
A company is making two products A and B. The cost of producing one unit of products A and B are Rs 60 and Rs 80 respectively. As per the agreement, the company has to supply at least 200 units of product B to its regular customers. One unit of product A requires one machine hour whereas product B has machine hours available abundantly within the company. Total machine hours available for product A are 400 hours. One unit of each product A and B requires one labour hour each and total of 500 labour hours are available. The company wants to minimize the cost of production by satisfying the given requirements. Formulate the problem as a LPP.
A firm manufactures two types of products A and B and sells them at a profit of Rs 2 on type A and Rs 3 on type B. Each product is processed on two machines M1 and M2. Type A requires one minute of processing time on M1 and two minutes of M2; type B requires one minute on M1 and one minute on M2. The machine M1 is available for not more than 6 hours 40 minutes while machine M2 is available for 10 hours during any working day. Formulate the problem as a LPP.
A firm manufactures two products, each of which must be processed through two departments, 1 and 2. The hourly requirements per unit for each product in each department, the weekly capacities in each department, selling price per unit, labour cost per unit, and raw material cost per unit are summarized as follows:
| Product A | Product B | Weekly capacity | |
| Department 1 | 3 | 2 | 130 |
| Department 2 | 4 | 6 | 260 |
| Selling price per unit | Rs 25 | Rs 30 | |
| Labour cost per unit | Rs 16 | Rs 20 | |
| Raw material cost per unit | Rs 4 | Rs 4 |
The problem is to determine the number of units to produce each product so as to maximize total contribution to profit. Formulate this as a LPP.
An airline agrees to charter planes for a group. The group needs at least 160 first class seats and at least 300 tourist class seats. The airline must use at least two of its model 314 planes which have 20 first class and 30 tourist class seats. The airline will also use some of its model 535 planes which have 20 first class seats and 60 tourist class seats. Each flight of a model 314 plane costs the company Rs 100,000 and each flight of a model 535 plane costs Rs 150,000. How many of each type of plane should be used to minimize the flight cost? Formulate this as a LPP.
A firm has to transport at least 1200 packages daily using large vans which carry 200 packages each and small vans which can take 80 packages each. The cost of engaging each large van is ₹400 and each small van is ₹200. Not more than ₹3000 is to be spent daily on the job and the number of large vans cannot exceed the number of small vans. Formulate this problem as a LPP given that the objective is to minimize cost
The solution set of the inequation 2x + y > 5 is
Objective function of a LPP is
The optimal value of the objective function is attained at the points
If the constraints in a linear programming problem are changed
Which of the following is not a convex set?
A company manufactures two types of toys A and B. A toy of type A requires 5 minutes for cutting and 10 minutes for assembling. A toy of type B requires 8 minutes for cutting and 8 minutes for assembling. There are 3 hours available for cutting and 4 hours available for assembling the toys in a day. The profit is ₹ 50 each on a toy of type A and ₹ 60 each on a toy of type B. How many toys of each type should the company manufacture in a day to maximize the profit? Use linear programming to find the solution.
Feasible region is the set of points which satisfy ______.
Choose the correct alternative:
The constraint that in a college there are more scholarship holders in FYJC class (X) than in SYJC class (Y) is given by
Choose the correct alternative:
How does a constraint, “A washing machine can hold up to 8 kilograms of cloths (X)” can be given?
State whether the following statement is True or False:
The half-plane represented by 3x + 4y ≥ 12 includes the point (4, 3)
Heramb requires at most 400 calories from his breakfast. Every morning he likes to take oats and milk. If each bowl of oats and a glass of milk provides him 80 calories and 50 calories respectively, then as a constraint this information can be expressed as ______
Ms. Mohana want to invest at least ₹ 55000 in Mutual funds and fixed deposits. Mathematically this information can be written as ______
Determine the minimum value of Z = 3x + 2y (if any), if the feasible region for an LPP is shown in Figue.
Solve the following LPP graphically:
Maximise Z = 2x + 3y, subject to x + y ≤ 4, x ≥ 0, y ≥ 0
A manufacturing company makes two types of television sets; one is black and white and the other is colour. The company has resources to make at most 300 sets a week. It takes Rs 1800 to make a black and white set and Rs 2700 to make a coloured set. The company can spend not more than Rs 648000 a week to make television sets. If it makes a profit of Rs 510 per black and white set and Rs 675 per coloured set, how many sets of each type should be produced so that the company has maximum profit? Formulate this problem as a LPP given that the objective is to maximise the profit.
Minimise Z = 3x + 5y subject to the constraints:
x + 2y ≥ 10
x + y ≥ 6
3x + y ≥ 8
x, y ≥ 0
Feasible region (shaded) for a LPP is shown in the Figure Minimum of Z = 4x + 3y occurs at the point ______.
The common region determined by all the linear constraints of a LPP is called the ______ region.
A type of problems which seek to maximise (or, minimise) profit (or cost) form a general class of problems called.
Conditions under which the object function is to be maximum or minimum are called ______.
What is defined as a problem in which a linear objective function is to be maximised or minimised subject to a set of linear constraints and non-negative conditions on the variables?
A furniture dealer invests in tables (\[x\]) and chairs (\[y\]). He has \[\text{Rs } 50,000\] to invest and storage space for at most \[60\] pieces. A table costs \[\text{Rs } 2500\] and gives a profit of \[\text{Rs } 250\], while a chair costs \[\text{Rs } 500\] and gives a profit of \[\text{Rs } 75\]. What is the objective function to maximise total profit \[Z\]?
For a furniture dealer with an investment limit of \[\text{Rs } 50,000\] and space for at most \[60\] pieces, where a table costs \[\text{Rs } 2500\] and a chair costs \[\text{Rs } 500\], which set of inequalities correctly represents the investment and storage constraints (where \[x\] is tables and \[y\] is chairs)?
