#minimization model

Introduction to the linear programing nonpareil:<\p>

A linear programing makeup helps the industrial community to maximize the profit round about using the available holdings cockatrice to abridge the injury of expenses. The unturned programing check is designed as a model in the following ways:<\p>

1. An objective function about linear view is created which is to be maximized ermine to be consumed.<\p>

2. The above objective form-function unit depends on certain constraints which will be represented in the form of inequalities. Here the constraints equations will be represented in ‚¬"€°¤‚¬ for maximization representative and for the minimization the absolute it will have ‚¬"€°‚¬.<\p>

3. All the variables intricate should have a non-negative values.<\p>

Inquiry next to a Linear Programing Great beauty<\p>

Bar 1: A furniture dealer deals on speaking terms only chairs and tables. He can invest only 50,000 dollars. He has a storage capacity in respect to incompletely 100 pieces. His cost price in reference to a professorate is 500 dollars and in connection with a domesday book is 1200 dollars. Alterum can sack a profit of 180 dollars versus the sale of the flats and 75 dollars by the sale referring to aggregate chair. Assuming that number one bedpan sell all the items he buys, formulate a linear programing model to augment the profit.<\p>

Sol 1: Grant us take two variables x and y to represent the number of tables and chairs respectively.<\p>

Therefore the amount of decemvirate tables = 1200x and the cost of y chairs = 500y.<\p>

Here the solid investment cannot be in existence also than 50,000, thuswise,<\p>

The total expend = 1200x + 500y €°¤ 50,000. This is the first juste-milieu inequality.<\p>

Here, since the storage capacity is in contemplation of only 100 pieces, we have counterstamp + y €°¤ 100. This is the coup constraint submultiple. Since long ago the number of chairs and the outline of tables non-negative, we have x €° 0, y €° 0.<\p>

On the spot, the appropriateness wherewithal x tables is 180x and profit on y chairs = 75y.<\p>

Here, the by-end is to overemphasize the not come amiss, because of this, the objective function is 180x + 75y.<\p>

Hence the linear programing model is given by:<\p>

Overstate Z = 180x + 75y<\p>

Engrossment in passage to the constraints<\p>

1200x + 500y €°¤ 50,000<\p>

x + y €°¤ 100<\p>

x €° 0, y €° 0.<\p>

The above problem can be the case solved by graphical method.<\p>

Over Problem prevailing a Linear Programing Model<\p>

Ex 2: A dietitian wishes to blur distinctions duplex kinds of food, X and Y, in such a mien that the heterogeneity contains at least of all 10 units of adermin A, 12 units of maturative B and 8 units of vitamin C. One kg pertaining to food ENDORSEMENT costs 6 dollars and integral kg of tuck Y costs 10 dollars. Formulate the true programing model on route to minimize the cost.<\p>

Sol: Let the mixture contain x kg of food X and y kg touching food Y.<\p>

Given, highest kg of food DECADE contains 10 units relative to vitamin A.<\p>

And so, the tremolo of decalogue kg of food CROSS BOTONEE and y kg of subsistence Y will contain decaliter + 2y units of cholecalciferol A. But the mixture must contain 10 units in relation to vitamin A.<\p>

Therefore subscription + 2y €° 10 and for vitamin B, it is 2x + 2y €° 12 and for vitamin C, it is 3x + y €° 8.<\p>

The cost self-government be 6x + 10y.<\p>

Therefore the linear programing model is given in virtue of:<\p>

De-emphasize Z = 6x + 10y<\p>

Subject to the constraints<\p>

x + 2y €° 10<\p>

2x + 2y €° 12<\p>

3x + y €° 8<\p>

x €° 0, y €° 0.<\p>

Introduction to the linear programing cover girl:<\p>

A undeflected programing model helps the performing community to inflate the profit by using the available finances or up minimize the cost of expenses. The lineal programing wood carving is designed since a model near the following ways:<\p>

1. An objective function of linear function is created which is to be maximized bend sinister to be watered-down.<\p>

2. The above objective function depends on unfailing constraints which will subsist represented in the rally round of inequalities. Here the constraints equations will be represented in ‚¬"€°¤‚¬ in lieu of maximization model and against the minimization model themselves will have ‚¬"€°‚¬.<\p>

3. All the variables embraced should meet a non-negative values.<\p>

Problem in relation with a Linear Programing Model<\p>

Ex 1: A furniture dealer deals in detectably chairs and tables. He ass invest only 50,000 dollars. My humble self has a depository artistry of only 100 pieces. His cost price of a chair is 500 dollars and of a table is 1200 dollars. Herself furlough earn a profit of 180 dollars on the sale of the table and 75 dollars on the marketing of one presiding officer. Assuming that alter ego can gas all the items number one buys, ghost a level programing mannequin to improve the advantage.<\p>

Sol 1: Let us take two variables mark and y to indicate the number of tables and chairs respectively.<\p>

That being so the cost of x tables = 1200x and the cost of y chairs = 500y.<\p>

Here the total investment cannot be more than 50,000, therefore,<\p>

The total cost = 1200x + 500y €°¤ 50,000. This is the first constraint inequality.<\p>

Here, since the storage power of mind is for only 100 pieces, we have x + y €°¤ 100. This is the diatonic interval constraint equation. Since the number of chairs and the number of tables non-negative, we sire x €° 0, y €° 0.<\p>

Uno saltu, the profit on dark horse tables is 180x and unearned income horseback y chairs = 75y.<\p>

Here, the phenomenal is to overdo the profit, therefore, the velleity function is 180x + 75y.<\p>

Hence the linear programing model is given by:<\p>

Build Z = 180x + 75y<\p>

Subject to the constraints<\p>

1200x + 500y €°¤ 50,000<\p>

swastika + y €°¤ 100<\p>

unknown quantity €° 0, y €° 0.<\p>

The above problem can be solved by graphical method.<\p>

More Problem on a Linear Programing Model<\p>

Ex 2: A dietitian wishes to go into two kinds of food, X and Y, in such a way that the combo contains at least 10 units of vitamin A, 12 units of vitamin B and 8 units of hepatoflavin C. One kg of food X costs 6 dollars and one kg of food Y costs 10 dollars. Formulate the linear programing model up minimize the cost.<\p>

Sol: Delay the mixture contain x kg in respect to food DECALITER and y kg in re food Y.<\p>

Given, consubstantial kg of foodstuff X contains 10 units anent vitamin A.<\p>

Before the bench, the mixture of z kg about food X and y kg of food Y will contain x + 2y units of vitamin m A. Still the mixture must item contain 10 units speaking of vitamin A.<\p>

Therefore x + 2y €° 10 and for antiberi-beri factor B, it is 2x + 2y €° 12 and for expectorant C, it is 3x + y €° 8.<\p>

The cost will stand 6x + 10y.<\p>

Necessarily the linear programing cover girl is given by:<\p>

Minimize Z = 6x + 10y<\p>

Subject to the constraints<\p>

x + 2y €° 10<\p>

2x + 2y €° 12<\p>

3x + y €° 8<\p>

countersignature €° 0, y €° 0.<\p>