Generalization of Multi-Level Programming Technique - A Brief Description
R. Vasanthi*
Dept. of Physical Sciences & IT, Tamil Nadu Agricultural University, Coimbatore, Tamil Nadu (641 003), India
B. Sivasankari
Dept. of Agricultural Economics, Agricultural College and Research Institute, Madurai, Tamil Nadu (625 104), India
R. Pangayar Selvi
Dept. of Social Sciences, Agricultural College and Research Institute, Killikulam, Tamil Nadu (628 252), India
DOI: NIL
Keywords: Mathematical Programming, Multilevel Programming, Optimization, Simplex Algorithm
Abstract
The separation of policy problems into two components has long been accepted as a rational approach. Multilevel programming is applicable in those cases in which a mathematical programming model describes the implicit behavioral set. It encompasses multiple levels of optimization, multilevel programming constitute a generalization of mathematical programming. The algorithm handles two objective functions simultaneous in sequence of steps similar to those used in simplex algorithm.
Downloads
not found
Reference
Dantzig, G. B., and P. Wolfe, 1961. “The decomposition principle for Linear programs.” Econometrica, October, 1961.
Malinvaud, E., 1967. “Decentralized Procedures for planning.” Ch.7 in E. Malinvaud and M.O.L. Bacharach, eds., Activity analysis in the theory of growth and planning, Macmillan, London, 1967.
Theil, H., 1961. “Economic Forecasts and Policy.” Ch.7, North-Holland publishing company, Amsterdam, 1961.