TRANSPORTATION PROBLEM - OPTIMIZATION MODEL Input matrix ------------------------------------------------------------------------

CONS. FERTILIZER FACTORIES (Supply sources)

REQMENT. MFL SPIC NLC FCI NFCL MCF FACT ------------------------------------------------------------------------ 2616 292 512 152 495 495 340 330 .......................................................................

Requirement and Distances Matrix.

TAMIL NADU ....................................................................... Vellore 44.3 165 535 145 950 700 570 550

Kanchipuram 48.0 70 647 130 906 684 581 505 ........................................................................ Tuticorin 8.0 607 o 650 1300 1278 773 435 ........................................................................ Coimbatore 44.0 480 360 300 940 950 447 180 ------------------------------------------------------------------------ Dharmapuri 13.0 247 538 217 1008 930 572 407 ........................................................................ Dindigal 14.0 364 860 520 1127 991 580 970

Virudhunagar 17.0 550 110 360 1225 1200 650 525 ........................................................................ Kanniyakumari 7.0 714 135 503 1519 1311 716 3- ........................................................................ Madurai 46.0 461 146 258 1280 1032 627 363 ........................................................................ Nellai K 34.0 612 60 500 1315 1283 700 395 ........................................................................ Sivaganga 11.0 503 203 264 921 1024 743 361

Erode 31.0 274 770 430 1037 901 470 883 ........................................................................ Pudukottai 16.0 389 338 642 1194 1040 743 429 ........................................................................ Ramanathapur 13.0 528 258 325 1355 1199 780 477 ........................................................................ Salem 30.0 400 315 160 1243 1079 552 315 ........................................................................ Cuddalore 59.0 220 516 210 870 864 675 816 ------------_-----_----------------------------------------------------- Thanjavur 97.0 334 343 198 1183 1005 698 434 ........................................................................ TheNilgiris 6.0 486 374 721 1291 1157 490 183 ........................................................................ Tiruchirapalli 5.0 319 270 133 1013 990 643 379 ........................................................................

------------------------------------------------------------------------ Consumption S U P P L Y S O U R C E S Centroids Demand Madras Tuti Ney Ram Kak Man Chn

('000T) MFL SPIC NLC FCI NFCL MCF FACT ........................................................................ Requirement Distance matrix ........................................................................

Bangalore 33.0 351 581 315 868 890 347 659 ........................................................................ Belgaum 58.0 840 1084 1055 843 1043 424 836 ........................................................................ Bellary 54.0 499 690 549 849 952 442 905 ........................................................................ Bidar 9.0 840 1447 1051 418 645 547 1509 ........................................................................ Bi j apur 29.0 907 1190 1102 760 840 850 1095

Chickmagalur 16.0 550 974 581 1295 1199 200 720 ........................................................................ Chitradurga 28.0 556 784 518 748 960 312 862

Dakshina Kannada 10.0 701 740 894 1251 1261 0 402 ........................................................................ Dharwar 33.0 320 1180 765 1345 1170 380 1230 ........................................................................ Gulbarga 10.0 716 1367 940 1465 1395 350 1059

Hassan 23.0 640 1300 885 1465 1290 175 1350 ........................................................................ Mandya 41.0 438 934 599 1201 1065 310 1047 ........................................................................ Mysore 33.0 465 961 621 1228 1092 288 1074 ........................................................................ Raichur 71.0 703 1012 699 530 825 580 1002 ........................................................................ Shimoga 21.0 645 966 655 1405 1300 150 1081

Tumkur 21.0 406 650 475 901 948 '300 618 ........................................................................ UttaraKannada 19.0 812 1056 1015 902 1015 360 677 ........................................................................

ANDRA PRADESH. ------------------------------------------------------------------------ consumption S U P P L Y S O U R C E S

Centroids Demand Madras Tuti Ney Ram Kak Man Chn ( ' 0 0 0 T ) MFL SPIC NLC FCI NFCL MCF FACT ........................................................................

Requirement Distance matrix

........................................................................ Srikakulam 4 1 . 0 949 1556 1160 230 344 1800 1618 ---------*-------------------------------------------------------------- Vizianagaram 3 8 . 0 859 1466 1103 8 2 0 225 1400 1528 ........................................................................ Vishakapatnam 3 9 . 0 799 1406 1010 699 194 1 3 5 1 1468 ------------------------------------------------------------------------ East Godavari 1 5 5 . 0 6 5 1 1258 1 1 2 1 330 6 0 1 2 5 0 1323 ------------------------------------------------------------------------ West Godavari 1 5 6 . 0 575 1182 786 622 1 7 0 1 1 0 0 1244 ........................................................................ Krishna 1 0 9 . 0 433 1040 644 1155 238 9 7 0 1102 ........................................................................ Guntur 1 6 7 . 0 4 0 1 1008 1219 426 270 9 8 0 1070 ........................................................................ Prakasam 6 0 . 0 297 904 5 4 1 530 374 9 0 0 966

Nellore 6 7 . 0 1 8 5 7 6 0 340 700 450 8 8 1 853 ------------------------------------------------------------------------ Kurnool 42 .0 468 1 0 4 1 673 459 544 6 0 0 842 ........................................................................ Anantapur 29 .0 355 942 518 574 494 5 4 7 847 ........................................................................ Cuddapah 3 8 . 0 308 907 519 928 772 9 0 0 875

Chittoor 3 5 . 0 154 675 366 879 8 2 5 5 0 0 643 ------------------------------------------------------------------------ Hyderabad 3 3 . 0 704 1144 944 1409 509 9 1 3 1 1 1 2 ........................................................................ Nizamabad 7 7 . 0 1 0 7 8 1518 1289 1803 8 8 3 1 6 8 0 1 4 a 6 ------------------------------------------------------------------------ Mehbubnagar 4 6 . 0 807 1247 1018 1532 612 1 4 0 0 1215 ------------------------------------------------------------------------ Nalgonda 5 3 . 0 806 1246 1017 1 5 3 1 6 1 1 1 4 0 0 1214 ........................................................................ Warangal 8 9 . 0 686 1 2 8 5 897 1400 4 9 1 1 0 5 4 1253 ------------------------------------------------------------------------ Khammam 51.0 808 1407 1015 1533 6 1 3 1 4 1 0 1365 ........................................................................ Karimnagar 8 2 . 0 756 1 3 5 5 967 1 0 8 1 5 6 0 1 3 5 0 1223 -___---___--__-____--*-------------------------------------------------

Adilabad 25 .0 1364 1864 1 5 7 5 1589 1 1 6 9 1 9 6 0 1772 -----------------------------------------------------------------------

------------------------------------------------------------------------ consumption S U P P L Y S O U R C E S centroids Demand Madras Tuti Ney Ram Kak Man Chn

('000T) MFL SPIC NLC FCI NFCL MCF FACT ------------------------------------------------------------------------ Requirement Distance matrix ------------------------------------------------------------------------

Alappuzha 5.0 725 491 792 1400 1399 420 56 ........................................................................ Ernakulam 8.0 675 441 866 1390 1349 412 6 ------------------------------------------------------------------------ Idukki 7.0 807 579 1018 1532 1481 200 138 ........................................................................ Kannoor 4.0 900 1307 1111 1625 1500 300 560 ........................................................................ Kasargod 2.0 925 1332 1136 1625 1575 60 554

Kollam 7.0 850 1257 1061 1500 1521 250 521 ------------------------------------------------------------------------ Kottayam 14.0 756 522 906 1475 1430 190 € 7

Kozhikode 6.0 710 550 921 1435 1381 150 169 ------------------------------------------------------------------------ Malappuram 4.0 758 598 969 1483 1429 180 237 ........................................................................ Palakkad 15.0 534 422 700 1250 1205 150 231 ------------------------------------------------------------------------ Pathanamthitta 5.0 800 1407 1011 1525 1471 200 463 ------------------------------------------------------------------------ Thiruvanan- 5.0 790 218 1000 1500 1461 600 2:7 thapuram ------------------------------------------------------------------------ Trisoor 7.0 595 435 806 1300 1266 338 74 ........................................................................ Wayanad 3.0 780 1387 991 1500 1451 280 443

Source: Fertilizer Association of India, Southern Region, Madras

OPTIMIZATION SOFTWARE FOR TRANSPORTATION MODEL P

Soaware Program for generating an optimal soution to a * Transportation Problem based on Linear Programming

Technique. * * The initial feasible solution is obtained by using the * Least Cost Method. * * This &ware was developed by * a Mr. T.V. Madhavan, * Asst. Manager (R & Dl, .; HCL-Hewlett Packard Ltd., * Madras. * * Mr. L. Ravindranath, L Sr. Engineer (R & Dl, * HCL-Hewlett Packard Ltd., * Madras.

#define TRANS-FILE "input" #define LARGE-VALUE O~7frmff

#define ROW 0 #define COLUMN 1

#define SWAP(x, Y) \ I \

int temp; \ \

temp = (x); (x) = 6); (y) = temp;

}

FILE *trans-input;

int cost[ N ROWS I[ N-COLUMNS 1; int cells[ N~ROWS I[ N-COLUMNS I; int U[ N-ROWS I, V[ N-COLUMNS 1; int uset[ N-ROWS I, vsett N-COLUMNS I; int cost-change[N-ROWSI[N-COLUMNS];

int allocation[ N-ROWS I[ N-COLUMNS 1; int eallocation[ N-ROWS I[ N-COLUMNS 1; int save-allocation[ N-ROWS I[ N-COLUMNS 1; int supplyI N-ROWS 1, demand[ N-COLUMNS 1; int save-supply[ N-ROWS I, save-demand[ N-COLUMNS I; int rnin-cost-row, min-cost-column; int final-cost=LARGE-VALUE, prev-final-cost=LARGE-VALUE;

typedef struct MYCELL { int row; int column; struct MYCELL *next;

) CELL;

typedef struct MYCLOSED { int row[4]; int column[4]; int cost-cliff; int alloc; struct MYCLOSED *next;

} CLOSED;

CELL *row-cells; CELL *column~cells; CLOSED *closed;

main(argc, a r p ) int argc; char **argv; {

int iteration, row, column, prev-row;

get-cost 0; shadow-supply(); init-allocation-cellsO; iteration = 1; while (sornething~to~compute0) {

compute~least~cost(&row, &column); a4just-supply-demand(row, column);

1 xgrint-allocationO; compute~final~costO; xgrint-final-costO; restore-supply0; for (prev-row = 0;;) I

check-supply0;

check-demand(); init-u0; init-v0; init-sallocation(); row-cells = NULL; column-cells = NULL; closed = NULL; row = prev-row; while (unsolved(&row))

solve-row(row); init-cost-change(); if bin-cost-change()) {

find~row~cells(min~cost~row); find~column~cells(min~cost~column); if (find-closedqaths0) {

shadow-allocation0; optimal-solution(); compute-final-cost(); if (final-cost >= prev-final-cost) {

restore-allocation(); if (prev-row == N-ROWS)

break; final-cost = prev-final-cost; prev-row++;

} else {

prev-row = 0; xgrint-allocation(); xjrint-final-cost();

} } else

break; } else

break; } check-supply(); check-demand(); xqrint-allocation0; compute~final~costO; xqrint-final-cost0;

}

v i i i

int row, column, n;

trans-input = fopen(TRANS-FILE, "r"); if (!trans-input) {

fprintKstderr, "fopen failed \ nu); perror(""); exit(1);

1 for (row = 0; row < N-ROWS; row++) {

for (column = 0; column < N-COLUMNS; column++) { n = fscanf(trans-input, "%dl',

cost[row][columnl); i f ( n ! = l ) {

fprintftstderr, "fscanf failed \ n"); exit(1);

} 1 n = fscanf(trans-input, "%d", &supply[rowl); if (n != 1) {

fprintfbtderr, "fscanf failed\nU); exit(1);

} } for (column = 0; column < N-COLUMNS; column++) {

n = fscafltrans-input, "%d, &demand[columnl); if (n != 1) {

fprintfktderr, "fscanf failed\nU); exit(1);

1

int row, column;

for (row = 0; row < N-ROWS; row++) for (column = 0; column < N-COLUMNS; column++) {

allocation[row][column] = 0; cells[rowl[columnl = 1;

1 }

int row, column;

for (row = 0; row < N-ROWS; row++) for (column = 0; column < N-COLUMNS; column++) {

sallocation[rowl[column] = allocation[rowl[column];

}

shadow-supply() {

int row, column;

for (row = 0; row c N-ROWS; row++) save-supply[row] = supply[row];

for (column = 0; column < N-COLUMNS; column++) save~demand[column] = demand[column];

1

restore-supply0 t

int row, column;

for (row = 0; row < N-ROWS; row++) supply[rowl = save~supply[rowl;

for (column = 0; column < N-COLUMNS; column++) demand[column] = save~demand[columnl;

}

int row, column;

for (row = 0; row c N-ROWS; row++) for (column = 0; column < N-COLUMNS; column++)

save~allocation[row][columnl = allocation[rowl[columnl;

}

int row, column;

for (row = 0; row < N-ROWS; row++) for (column = 0; column < N-COLUMNS; column++)

allocation[row][columnl =

compute_least-rnst(prow, pcolumn) int *prow; int *pcolumn; {

int row, column, type, min; int found = 0;

min = LARGE-VALUE; for (row = 0; row < N-ROWS; row++)

for (column = 0; column < N-COLUMNS; column++){ if (cells[row][column]~

if (min z cost[rowl[column])~ min = cost[row][column]; *prow = row; 'pcolumn = column;

1

someth ing~to~compute0 {

int row;

for (row = 0; row < N-ROWS; row++) if (supply[rowl)

return (1); return (0);

1

aGust-supply-demand(row, column) int row; int column;

supply[rowl = 0; demand[column1 = 0; nullify-row(row); nullify~column(column); return:

allocation[rowl[columnl = demand[columnl; eupply[row] -= demand[colurnn]; demand[column] = 0; nullii~column(column); return;

I allocation[rowl[column] = supply[row]; demand[column] -= supply[row]; supply[row] = 0; nullify-row(row);

1

nullify-row(row) int row; {

int column;

for (column = 0; column < N-COLUMNS; column++) cells[rowl[columnl = 0;

1

nullify~column(column) int column; {

int row;

for (row = 0; row < N-ROWS; row++) cells[row][column] = 0;

int row, column;

printf("-------.--ALLOCATION----.-----\ n"); for (column = 0; column c N-COLUMNS; column++) I

for (row = 0; row < N-ROWS; row++) { printflN%d ", allocation[row][column]);

printf(" \nu);

}

int row, column;

prev-final-cost = final-cost; final-cost = 0; for (row = 0; row < N-ROWS; row++)

for (column = 0; column < N-COLUMNS; column++) { int cell-cost; cell-cost = allocation[rowl[columnl *

cost[rowl[columnl; final-cost += cell-cost;

}

xqrint-final-cost0 {

int row, column;

printf("- --------- FINAL COST ---------- \ n"); for (column = 0; column < N-COLUMNS; column++) {

for (row = 0; row c N-ROWS; row++) { int cell-cost; cell-cost = allocation[rowl~columnl *

cost[rowl[columnl; printf("%d ", cell-cost);

printf(" \n4'); } printf("fina1 cost = %d\nV, final-cost);

>

int row;

for (row = 0; row < N-ROWS; row++) uset[row] = 0;

}

int column;

for (column = 0; column < N-COLUMNS; column++) vset[columnl = 0;

}

solve-row(row) int row;

{ int column;

for (column = 0; column c N-COLUMNS; column++) solve-element(row, column);

}

solve~column(column) int column; {

int row;

for (row = 0; row c N-ROWS; row++) solve-element(row, column);

}

solve-element(row, column) int row; int column; {

if (!sallocation[rowl[columnl) return;

if (!(uset[row]) && !(vset[columnl)) { u[row] = 0; uset[rowl = 1; column] = cost[row][columnl; vset[columnl = 1; sallocation[rowl[columnl = 0; solve~column(column); return:

} if (uset[rowl) {

column] = cost[row][column] - u[rowl; vset[columnl = 1; sallocation[rowl[columnl = 0; solve~column(column); return:

unsolved(srow) int 'srow;

{ int row, column;

for (row = *mow; row < N-ROWS; row++) for (column = 0; column < N-COLUMNS; column++) {

if (sallocation[row][column]) { %row = row; return (1);

} }

for (row = 0; row < *STOW; row++) for (column = 0; column < N-COLUMNS; column++) {

if (sallocation[row][column]) { *STOW = row; return (1);

} 1

return (0); 1

int row, column;

for (row = 0; row < N-ROWS; row++) for (column = 0; column c N-COLUMNS; column++) {

if (!allocation[row][columnl) { cost~change[row][columnl =

cost[row][columnl - u[row] - column]; else

cost~change[row][column] = 0;

int row, column, type; int min, found = 0;

min = 0; for (row = 0; row < N-ROWS; row++)

for (column = 0; column < N-COLUMNS; column++){ if (cost~change[rowl[columnl < O){

if (min > cost~change[rowl[columnl)~ min = cost~change[row][columnl;

min-cost-row = row; min-cost-column = column;

} 1

1 if (min >= 0) {

printf("no more optimization\nM); return (0);

} return (1);

1

find-row-cells(row) int row; {

int column; CELL 'cell;

for (column = 0; column < N-COLUMNS; column++) { if (allocation[rowl[columnl) {

cell = (CELL *) malloc(sizeof (CELL)); if (!cell) {

printf("cou1d not malloc\n"); perror(""); exit(1);

} cell->row = row; cell->column = column; if (!row-cells){

row-cells = cell; cell->next = NULL;

1 else {

cell->next = row-cells; row-cells = cell;

1 1

1 }

find~column~cells(column) int column; {

int row; CELL *cell;

for (row = 0; row c N-ROWS; row++) { if (allocation[row][column]) {

cell = (CELL *) rnalloc(sizeof (CELL)); if (!cell) {

printff "could not malloc\nl'); perror(""); exit(1);

1 cell->row = row; cell->column = column; if (!column-cells) {

column~cells = cell; cell->next = NULL;

} else {

cell->next = column-cells; column-cells = cell;

1

int row, column; CELL 'rowc, *columnc; CLOSED *path;

if (!row-cells && !column~cells) { printffMNo closed paths found\nU); return (0);

} rowc = row-cells; while (rowc) {

columnc = column~cells; while (columnc) {

~ a t h = (CLOSED *) malloc(sizeof (CLOSED)); if (!path) {

~rintf("cou1d not malloc\nU);

} path->row[O] = min-cost-row; path->column[O] = min-cost-column; path->row[l] = rowc->row; path-zcolumn[l] = rowc->column;

path->row[2] = columnc->row; path->column[2] = rowc->column; path->row[3] = columnc->row; path->column[3] = columnc->column; if (!closed) {

closed = path; path->next = NULL;

1 else {

path->next = closed; closed = path;

1 columnc = columnc->next;

} rowc = rowc->next;

} if (!closed) {

printff1'No closed paths found\nM); return (0);

1 return (1);

1

CLOSED *path; int min;

path = closed; while (path) {

cost-dimpath); path = path->next;

1 solutionO;

}

cost-dimpath) CLOSED 'path; {

int alloc, a, cost-diff; int n, 'row, *column;

row = path->row; column = path->column; alloc = allo~ation[r0~[1]][~0lumn[l]l; a = allocation[row[3I][column[311;

if ((a) && (alloc r a)) { alloc = a;

1 path->allof = alloc; path->cost-diff = alloc * (cost[row[O]][column[Oll -

cost[row[l]][column[l]] + cost[row[2]][column[2]] - cost[row[3]l[column[3l]);

solution() {

CLOSED *path, 'rninpath; int cost-diff, *row, *column;

path = minpath = closed; while (path) {

if (cost-diff > path->cost-dim { rninpath = path; cost-diff = path->cost-die

1 path = path->next;

} path = minpath; row = path->row; column = path->column; allocation[row[0]][column[0]] = path-~alloc; allocation[row[l]][column[l]] -= path-~alloc; allocation[row[2]][column[2]] += path-~alloc; allocation[row[3lJ[column[3]] -= path->allot;

1

{ int row, column, alloc;

for (row = 0; row c N-ROWS; row++) { alloc = 0; for (column = 0; column < N-COLUMNS; column++)

alloc += allocation[rowl[columnl; if (alloc != supply[rowl) {

printf("supply[%d] = %d, alloc = %d\nq, row, supplylrowl, alloc);

printf("supply[%d] does not match\nV, row); }

check-demand0 {

int row, column, alloc;

for (column = 0; column c N-COLUMNS; column++) { alloc = 0; for (row = 0; row < N-ROWS; row++)

alloc += allocation[row][column]; if (alloc != demand[column]) {

printffndemand[%d] = %d, alloc = %d\n", column, demand[column], alloc);

printf("demand[%d] does not match \n", column); 1

FERTILIZER MANUFACTURING UNITS & OTHER ORGANIZATIONS CONTACTED FOR DATA:

Indian Farmer Fertilizer Cooperative Ltd, New Delhi

Gujarat State Fertilizer Co. Ltd, Baroda Zuari Agrochemicals Ltd , Goa.

Hindustan Liver Ltd, Calcutta Mangalore Chemicals & Fertilizers Ltd, Bangalore

Raatriya Chemicals & Fertilizers Ltd, Bombay Shaw Wallace & Co, Ltd , Madras

Indian Potash Ltd, New Delhi

Kothari Industrial Corporation Ltd, Madras

Gujarat Narmada Valley Fertilizers Ltd. Bharuch Deepak Fertilizers & Chemicals Ltd, Bombay Madras Fertilizers Ltd , madras

Fertilizer Corporation Ltd, New Delhi

Krishik Bharithi Coop Ltd, New Delhi Adharsh Chemicals & Fertilizers Ltd, Udhana

Indo - Gulf Fertilizers & Chemicals Corpn Ltd, New Delhi

National Fertilizers Ltd, New Delhi

Mysore Fertilizer Co, Madras Coramendal Fertilizers Ltd, Secunderabad

Sriram Chemicals & Fertilizers Ltd.New Delhi

Hindustan Fertilizers Ltd, New Delhi

National Cooperative Development Corporation , New Delhi

E.I.D. Parry Ltd, Madras Southern Petrochemical Industries Corpn Ltd, Madras

Fertilizers & Chemicals Travancore Ltd, Alwaye

Fertilizer Association of India, New Delhi Dharmsi Morarji Chemicals Co Ltd, Bombay

Paradeep Phosphates Ltd, Bhubaneshwar Nagarjuna Fertilizers & Chemicals Ltd, Secunderabad.

Godawari Fertilizers Ltd , Kakinada.

Neyveli Lignite Corporation Neyveli

Steel Authority of India. Rourkela

Ministry of Fertilizers, GOI, New Delhi.

SYMBOLS, ABBREVIATIONS & CONVERSION FACTORS

N P K-Nitrogen, Phosphate, Potash

FAI-Fertilizer Association of India

FICC-Fertilizer Industry Coordination Committee

NCAER- National Council of Applied Economic Research

ECA-Essential Commodities Act

RPS-Retention Price System

MFL-Madras Fertilizers Ltd

SPIC-Southern Petro Chemical Industries Corporation

MCF-Mangalore Chemicals & Fertilizers Lid

NCFL-Nagarjuna Fertilizers & Chemicals Ltd

FACT-Fertilizers And Chemicals Travancore

IFFCO-Indian Farmers Fertilizer Company.

FCI-Fertilizer Corporation of India

EWC-East-West Center, Honolulu Hawaii USA

A.P.. Andhra Pradesh, K.N.- Karnataka

T N-TamiNadu, KE-Kerala

RAM-Ramangundum ( FCI)

NLC-Neyveli Lignite Corporation

F N S R Fertilizer Association of South India Southern Region

GOI-Government of India.

VAP-VIllage Adoption Program

IADP-Intensive Agricultural Development Program

IARI-Indian Agricultural Research Institute, Delhi

IIMA-Indian Institute of Management, Ahmedabad

SOM-School of Management Pondicherry University, Pondicherr~.

HYVP-High Yielding Variety Program

Kharif-Agricultural season April - Sept

Rabi-Agricultural season Oct- March.

CWC-Central Warehousing Corporation

SWC-State Warehousing Corporation

Coops- Cooperatives.

L.P. Linear programming Model

STL-Soil Testing Laboratory

CONVERSION FACTORS

1 Hectare = 2.471 Acres

I Acre=4.048 square meters

1 Metric ton=2.204 pounds = 1000 kg

1 Long tore2240 pounds

1 Mile =1.6 kms

1 US dollar= 32 Indian Rupees.

MANAGEMENT OF FERTILIZER MARKETING SYSTEMS

Survey on Farmer's behaviour towards fertilizers use & readion to fertilizer marketing eystem

QUESTIONNAIRE (Reeponses to be obtained in a self tabulating format)

1. Name of the Farmer (sl.no)

2. Holding : hectare a) c2 b) 2-5 c) >5

3. Holding essentially : a) irrigated b) rainfed

4. Education : a) no formal edn. b) ele. Schooling c) Upto H.S.

d) College level

5. Age : a) < 25 b) 25-45 c) >45

6. Do you apply fertilizers : a) no b) Urea c) DAP d) complex e M i u t r e 1) any one but not specific g) Manure

7. Are you aware of the right of the fertilizer : a) Product b) Correct dosage c) not aware

8. What is the source of information & guidance on cultivation : a) Dealer b) Salesmen c) Dept. d) Cinema e) Radio f) TV g) news paper h) Neighbour i) Other

9. Are there fertilizer dealers in the Village : a) Yes b) No C) 5 kms. from village.

10. Where do you buy fertilizer : a) Local dealer b) Coop c) Dealer from outside

11. When you can't get the fertilizer you require in the village do you : a) wait till stock arrives b) go outside and get c) buy whatever available d) do not use at all

12. Do you apply fertilizers to : a) Irr. b) rainfed c) both d) none

13. Do you buy from coop because of : a) Quality b) credit c) price d) service e) other

Do You buy from private dealer because of: a) quality b) credit c) price d) service e) nearness fj other.

Do you apply the right quantity of fertilizers a) yes b) no

You do not apply the right product in right qty because a) Lack of funds b) not economical c) right product not available a t the time of application O high price g) Lack of irrigation

When prices of some fertilizer products increases do you : a) reduce the quantum b) shift to cheaper products c) maintain the same levels.

Are you aware that it is essential to apply balanced fertilizers in the right qty for maximum yields a) yes b) no

DO you avail the soil testing facility : a) yes b) no c) not aware d) service not accessible e) results delayed fj results unreliable g) service expensive h) other

Do you apply fertilizer one time or in split doses a) one time b) split doses

Did you reduce the quantum of fertilizer applied when the prices went up two years ago : a) yes b) no

Have you started using less of DAP & Complex after the price increase: a yes b) no c) lower dosage affected the yield d) lower dosage did not affect the yield

How frequently the fertilizer sales men visits your village : a) rarely b)) frequently c) only during season d) never

How often do the Agri. Dept, officials visit your village a) rarely b) frequently c) never

How effective are the farmer meetings arranged by manufacturers : a) not effective b) some what c) very

Are the publicity vans visiting the village : a) seldom b) frequently C) never

Are the messages and information given in the mobile vans useful : a) no b) yes c) to some extent

so.

What f a d r e would encourage use of right products in right quantity : rank a) lower price b) easy availability c) credit d) irrigation facility e) increase in procurement prices.

Are you aware that fertilizer products are highly subsidized by Government of India. a) yes b) no

Do you completely depend on farming for your livelihood a) yes b) no C) have other vocations

Are there any difficulty in getting seeds and pesticides : a) yes b) no

DO you grow high yielding varieties ? a) yes b) no cf not aware d) do not have the funds e) no guidance available

Have you visited any fertilizer demonstration plots : a) yes b) no c) not aware

From your experience, do you consider that the range of fertilizer products are too many and confusing. a) yes b) no c) do not know

In what ways fertilizer units can help you to improve the productivity of your land? a) by better product formulation b) timely supplies of right products to retail outlets c) improved publicity d) more interaction with salesmen e) better dealer net work O timely supplies g) providing effective soil testing service h) advice on cultivation

practices i) farmer meetings j) publicity vans k) demonstrations i) improved irrigation m) availability of credit on time

In what ways can the dealericoop assist you for increased consumption of right fertilizer products : a) stocking the product during the season b)) giving advice on cultivation c) extending credit

MANAGEMENT OF FERTILIZER MARKETING SYSTEMS A Study on

the Criticax Factors Influencing Fertilizer Consumption (A Survey of the IFFCO field Sales Force)

1. Respondent Education Agri/Science/Arts/other

2. Territory of operation District(s1

3. Experience in fert mktg. yrs. IFFCO - yrs.

4. Coop. outlets served Annual omake T urea.

5. Mostly used three product a. b. c. "Q 6. Reasons of farmers for usage a. Price b. Availability c. Credit d. Past

exp. e. Soil testing recommendations f. other

7. Has the consumption rate of urea increased after decontrol of P&K if so the extent -%.

8. Has the consumption of P&K significantly come down after decontrol, if so extent P % K %.

9. Has the decontrol affected application of balanced use if so, the extent % .

10. Are the farmers aware that it is still economical to apply P & K at recommended levels Y/N %Y.

11. Has the soil testing facility been used adequately, if not: a) not aware b) not accessible c) expensive d) results are delayed.

12. Do farmers prefer to purchase from cooperatives, if so, for reasons of : a) Price b) quality c) Credit e) Other

13. Would it be desirable to reduce the product ranges to DAP, Urea, Potash.

14. Hacc there been a significant shift towards Straight fertilizers and physical mixtures after decontrol. Y/N.

15. Would removal subsidy affect consumption in the long run, based ont he experience of past three seasons since decontrol. Y/N

16. What are the three key factors motivating the coops to deal with a particular type of product a. b. c.

17. What are three vital factors motivating the company sales personnel to improve their performance a. b. c.-

18. What are the logistics problems aced by the industry

a.

b.

C.

19. What are the three most effective ways of promoting fertilizers

a.

b.

C.

20. What are your suggestions for survival & growth of the industry.

a.

b.

C.