Generalization of Multi-Level Programming Technique - A Brief Description

Authors

  • R. Vasanthi
  • B. Sivasankari
  • R. Pangayar Selvi

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

Download data is not yet available.

Author Biographies

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

Downloads

Published

2020-10-28

How to Cite

[1]
Vasanthi, R. et al. 2020. Generalization of Multi-Level Programming Technique - A Brief Description. Biotica Research Today. 2, 10 (Oct. 2020), 1065–1067.

Issue

Section

General Article

Categories