04.07.2020 Views

Food-Processing-Plant-Design-layout

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Food Processing Plant Design & layout

iv. Blending Problem. When a product can be made from a variety of available raw

materials, each of which has a particular composition and price, linear programming

technique is used to determine minimum cost blend.

v. Media Selection. Linear programming helps in determining the advertising media mix so

as to maximize the effective exposure at minimum cost.

vi. Traveling Salesman Problem

vii. Physical Distribution. It helps in selecting most economical and effective location for the

manufacturing plant and distribution centers.

viii. Staffing Problem. Linear programming helps to allocate optimum manpower to a

particular job so as to minimize total over time cost and total manpower.

ix. Job Evaluation and Selection. Selection of suitable person for a specified job and

evaluation of job in organization has been done with the help of linear programming.

x. Agriculture. To allocate limited resources such as land, labour, water supply and

working capital etc. in the way so as to improve productivity.

xi. Routing Problem. To determine the most economic pattern and timings for flights so as

to make the most efficient use of aircraft and crews.

14.4.5 Solution of Linear Programming Problems

Linear Programming Problems can be solved by following methods:

a. Graphical method, b. Simplex method, c. Transportation method and d. Assignment

models

The graphical method can be used only for two or three variables; whereas the other

methods can be used for any number of variables.

Illustrative Example on Formulation of Linear Programming Model

Example: The manager of an oil refinery must decide on the optimal mix of two possible

blending processes of which the input and output per production run are given as follows:

Process

Input (units)

Output

Crude A Crude B Gasoline X Gasoline Y

1

5

3

5

8

2

4

5

4

4

The maximum amount available 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. Formulate this problem as a linear programming model to maximize

profit. The profit per production run from process 1 and process 2 are Rs 300 and Rs

400, respectively.

92 www.AgriMoon.com

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!