Linear Programming Problem

Linear Programming Problem
Consider the situation

A toy dealer goes to the wholesale market with Rs.1500.00 to purchase toys for selling. In the market there are various types of toys available. From quality point of view, he finds that the toy of type A and type B are suitable. The cost price of type A toy is Rs.300/- each and that of type B is Rs.250/- each. He knows that the type A toy can be sold for Rs.325/- each, while the type B toy can be sold for Rs.265/- each. Within the amount available to him he would like to make maximum profit. His problem is to find out how many type A and type B toys should be purchased so to get the maximum profit.
Solution?
A retailer of radio sets wishes to buy a number of transistors radio sets from the wholesaler. These are two types (type A and type B) of radio sets which he can buy. Type A costs Rs.360 each and type B costs Rs.240 each. The retailer can invest uptoRs.5760/-. By selling the radio sets, he can make a profit ofRs.50/- on each set of type A and of Rs.40/- on each set of type B. How many of each type should he buy to maximize his total profit?
Two tailors A and B earn Rs.150/- and Rs. 200/per day respectively. A can stitch 6 shirts and 4 pants per day, while B can stitch 4 shirts and 7 pants per day. How many days shall each work if they want to produce at least 60 shirts and 72pants at a minimum labour cost? In this problem we have to minimize the labour cost.
These type of problems of maximization and minimization are called optimization problems. The technique followed by mathematicians to solve such problems is called Linear Programming
DEFINITIONS OF VARIOUS TERMS INVOLVED IN LINEAR PROGRAMMING

In linear programming terminology the maximization or minimization of a quantity is referred to as the objective of the problem. In a linear programming problem, z, the linear function of the variables which is to be optimized is called objective function
Constraints The limitations on resources (like cash in hand, production capacity, man power, time, machines, etc.) which are to be allocated among various competing variables are in the form of linear equations or inequations (inequalities) and are called constraints or restrictions.
Non-negative restrictions All decision variables must assume non-negative values, as negative values of physical quantities is an impossible situation.
The formulation of linear programming problem

Step 1: Identify the decision variables to be determined and
express them in terms of algebraic symbols such as x1,x2, x3, ...... .
Step 2: Identify all the limitations in the given problem and

then express them as linear equations or inequalities in terms of above defined decision variables.
Step 3: Identify the objective which is to be optimized

(maximized or minimized) and express it as a linear function of the above defined decision variables.
An Example
A retailer wishes to by a number of transistor radio sets of types A and B. Type A cost Rs.360/- each and type B cost Rs.240/- each. The retailer knows that he cannot sell more than 20 sets, so he does not want to buy more than 20 sets and he cannot afford to pay more than Rs.5760/-. His expectation is that he would get a profit of Rs.50/- for each set of type A and Rs.40/- for each set of type B. How many of each type should be purchased in order to make his total profit as large as possible?
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 G and H. Type A requires one minute of processing time on G and 2 minutes on H, type B requires one minute on G and one minute on H. The machine G is available for not more than 6 hours and 40 minutes while machine H is available for 10 hours during one working day. Formulate the problem as a linear programming problem
A furniture manufacturer makes two types of sofas sofa of type A and sofa of type B. For simplicity, divide the production process into three distinct operations, say carpentary, finishing and upholstery. The amount of labour required for each operation varies. Manufacture of a sofa of type A requires 6 hours of carpentary, 1 hour of finishing and 2 hours of upholstery. Manufacture of a sofa of type B requires 3 hours of carpentary, 1 hour of finishing and 6 hours of upholstery. Owing to limited availability of skilled labour as well as of tools and equipment, the factory has available each day 96 man hours of carpentary, 18 man hours for finishing and 72 man hours for upholstery. The profit per sofa of type A is Rs.80 and the profit per sofa of type B is Rs.70. How many sofas of type A and type B should be produced each day in order to maximize the profit? Formulate the problems as linear programming problem

Linear Programming Problem

Uploaded by

Copyright:

Available Formats

Linear Programming Problem

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Linear Programming Problem

Uploaded by

Copyright:

Available Formats

Linear Programming Problem

Consider the situation

DEFINITIONS OF VARIOUS TERMS INVOLVED IN LINEAR PROGRAMMING

The formulation of linear programming problem

Step 2: Identify all the limitations in the given problem and

Step 3: Identify the objective which is to be optimized

You might also like