Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
193 views

Linear Programming Data Formulation

The document outlines the steps in developing linear programming problems: 1) Formulate the problem by identifying decision makers, objectives, controlled variables, uncontrolled variables, and constraints. 2) Construct a mathematical model with decision variables, parameters, constraints, and an objective function. 3) Derive the optimal solution that maximizes or minimizes the objective function using techniques like the simplex method. The document then provides several examples of formulating problems as linear programming models to minimize or maximize objectives like cost and profit under given constraints.

Uploaded by

prosmatic
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
193 views

Linear Programming Data Formulation

The document outlines the steps in developing linear programming problems: 1) Formulate the problem by identifying decision makers, objectives, controlled variables, uncontrolled variables, and constraints. 2) Construct a mathematical model with decision variables, parameters, constraints, and an objective function. 3) Derive the optimal solution that maximizes or minimizes the objective function using techniques like the simplex method. The document then provides several examples of formulating problems as linear programming models to minimize or maximize objectives like cost and profit under given constraints.

Uploaded by

prosmatic
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 6

Steps in Developing Linear Programming:

Formulate the problem in the form of appropriate model by using the following
information:
1. Who has to take the decision?
2. What are the objectives?
3. What are the ranges of controlled variables?
4. What are the uncontrolled variable that may affect the possible solutions?
5. What are the restrictions or constraints on the variable?

PHASE II Constructing a Mathematical method:


Reformulate the problem in an appropriate form with suitable identification of both
static and dynamic structural elements. A mathematical model should include the
following three important basic factors.
i) Decision variable and parameters
ii) Constraints or restrictions
iii) Objective function.

PHASE III : Deriving the solutions from the model:


Compute those values of decision variable that maximize /minimize the objective
function. Such solution is called optimal solution which is always in the best interest
of the problem under consideration. The general techniques for deriving the solution
of OR model includes Distribution models ( LPP, transportation and assignment),
Queuing models ,Network analysis, Job sequencing , Replacement models,
Simulation models and etc.

Example: 2.9: (Media selection)


A producer is willing to spend Rs. 20,000 to produce a new model if pressure cooker
through advertisement. He wishes to advertise in daily newspaper, radio and prime
time television. The cost effectiveness of advertising depends on its exposure to
housewives.

The unit wishes that at least 5,000 housewives should exposed to T.V. advertising.
Also the expense on newspaper advertising must not exceed Rs.5,0000. Formulate
the problem as a linear programme problem.

Example: 2.12:
A research laboratory has two melts of A & B alloy to make up a new mix. The
compositions of metals are as under.
To make the new mix, at least 12 kgs of A and 8 kgs of B is needed. Melt x1 costs
Rs.20 per kg. While melt x2 costs Rs. 25 per kg.Formulate the problem as LPP to
minimize cost.

Example: 2.13:
A large factory has following requirements for supervisors.

Supervisors report to the factory at the beginning of each period and work for 8
consecutive hours. The factory wants to determine the minimum number of
supervisors to be employed so that there will be sufficient number of supervisors
available for each period. Formulate the problem as LPP.

Example: 2.16: (Product composition and Mix)


A manufacturer wants to market a new fertilizer produced from a mixture of two
ingredients I & II. The compositions of the two ingredients are as follows: (Per Kg)

The manufacturer insists that the fertilizer must contain at least 30 % meal, 20 %
nitrogen and 15 % phosphate. The cost of ingredients is Rs. 30 per kg for I and Rs.
25 per kg for II. Formulate the problem as LPP for the quantities of the ingredients to
be mixed per kg to minimized cost.

Example: 2.27:
Solve graphically the following linear programming problem:
Minimize Z = 3x1+5x2
Subject To:

Example: 2.28:
A company manufacturing animal feed must produce 500 kgs of a mixture daily. The
mixture consists two ingredients G and G2. Ingredient G1 costs Rs. 5 per kg and
ingredient G2 costs Rs. 8 per kg. Nutrient considerations require that the feed
contains not more that 400 kgs of G1 and minimum of 200 kgs of G2. Find the
mixture of two ingredients that would minimizes the cost of the feed.

Example: 2.29:
An oil refinery has to decide upon the optimal mix of two possible blending
processes. The inputs and outputs per production run are as follows.

The maximum amount of crude A and B are 200 units and 150 units respectively.
Market requirements show that at least 100 units of gasoline x and 80 units of
Gasoline Y must be produced. Profits per production run from process I & process II
are Rs. 4,000 and Rs. 5,000 respectively. Determine the optimum production runs of
each process to maximize the profit.

Example: 3.0:
A firm is engaged in producing two products A and B. Its costs ad selling price for
both the products and relevant data are given below.

No. of hours/employee/week = 40 in each department


No. of weeks per annum = 50

(1)Formulate the given problem as a linear programming problem, and solve


graphically to find:-
a) Production that will maximize the contribution margin of the firm
b) The amount of contribution margin and profit attainable per year.

(2) Do you observe any constraint that is redundant? If yes, which one is it?

You might also like