मराठी
महाराष्ट्र राज्य शिक्षण मंडळएचएससी वाणिज्य (इंग्रजी माध्यम) इयत्ता १२ वी

A doctor prescribed 2 types of vitamin tablets, T1 and T2 for Mr. Dhawan. The tablet T1 contains 400 units of vitamin and T2 contains 250 units of vitamin. If his requirement of vitamin is at least

Advertisements
Advertisements

प्रश्न

A doctor prescribed 2 types of vitamin tablets, T1 and T2 for Mr. Dhawan. The tablet T1 contains 400 units of vitamin and T2 contains 250 units of vitamin. If his requirement of vitamin is at least 4000 units, then the inequation for his requirement will be ______

रिकाम्या जागा भरा
Advertisements

उत्तर

400x + 250y ≥ 4000

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 2.6: Linear Programming - Q.3 (C)

व्हिडिओ ट्यूटोरियलVIEW ALL [1]

संबंधित प्रश्‍न

A rubber company is engaged in producing three types of tyres AB and C. Each type requires processing in two plants, Plant I and Plant II. The capacities of the two plants, in number of tyres per day, are as follows:

Plant A B C
I 50 100 100
II 60 60 200

The monthly demand for tyre AB and C is 2500, 3000 and 7000 respectively. If plant I costs Rs 2500 per day, and plant II costs Rs 3500 per day to operate, how many days should each be run per month to minimize cost while meeting the demand? Formulate the problem as LPP.


A manufacturer can produce two products, A and B, during a given time period. Each of these products requires four different manufacturing operations: grinding, turning, assembling and testing. The manufacturing requirements in hours per unit of products A and B are given below.

  A B
Grinding 1 2
Turning 3 1
Assembling 6 3
Testing 5 4


The available capacities of these operations in hours for the given time period are: grinding 30; turning 60, assembling 200; testing 200. The contribution to profit is Rs 20 for each unit of A and Rs 30 for each unit of B. The firm can sell all that it produces at the prevailing market price. Determine the optimum amount of A and B to produce during the given time period. Formulate this as a LPP.


Which of the following sets are convex?


The optimal value of the objective function is attained at the points


The maximum value of Z = 4x + 3y subjected to the constraints 3x + 2y ≥ 160, 5x + 2y ≥ 200, x + 2y ≥ 80; xy ≥ 0 is


Consider a LPP given by
Minimum Z = 6x + 10y
Subjected to x ≥ 6; y ≥ 2; 2x + y ≥ 10; xy ≥ 0
Redundant constraints in this LPP are 


The objective function Z = 4x + 3y can be maximised subjected to the constraints 3x + 4y ≤ 24, 8x + 6y ≤ 48, x ≤ 5, y ≤ 6; xy ≥ 0


If the constraints in a linear programming problem are changed


Which of the following is not a convex set?


Feasible region is the set of points which satisfy ______.


State whether the following is True or False:

The optimum value of the objective function of LPP occurs at the centre of the feasible region.


State whether the following statement is True or False:

The half-plane represented by 3x + 4y ≥ 12 includes the point (4, 3)


Tyco Cycles Ltd manufactures bicycles (x) and tricycles (y). The profit earned from the sales of each bicycle and a tricycle are ₹ 400 and ₹ 200 respectively, then the total profit earned by the manufacturer will be given as ______


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 ______


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.


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?


An optimisation problem becomes a Linear Programming Problem (LPP) when:


What is the correct sequential order of steps to formulate and solve a 2-variable Linear Programming Problem?


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\]?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×