# Duality theorems for a class of non-linear programming problems.

Trabajos de Investigación Operativa (1988)

- Volume: 3, Issue: 1, page 141-147
- ISSN: 0213-8204

## Access Full Article

top## Abstract

top## How to cite

topChadha, Shyam S.. "Duality theorems for a class of non-linear programming problems.." Trabajos de Investigación Operativa 3.1 (1988): 141-147. <http://eudml.org/doc/40600>.

@article{Chadha1988,

abstract = {Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.},

author = {Chadha, Shyam S.},

journal = {Trabajos de Investigación Operativa},

keywords = {Programación no lineal; Funciones cuasimonótonas; Dualidad; strong duality theorem; linear fractional programming},

language = {eng},

number = {1},

pages = {141-147},

title = {Duality theorems for a class of non-linear programming problems.},

url = {http://eudml.org/doc/40600},

volume = {3},

year = {1988},

}

TY - JOUR

AU - Chadha, Shyam S.

TI - Duality theorems for a class of non-linear programming problems.

JO - Trabajos de Investigación Operativa

PY - 1988

VL - 3

IS - 1

SP - 141

EP - 147

AB - Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.

LA - eng

KW - Programación no lineal; Funciones cuasimonótonas; Dualidad; strong duality theorem; linear fractional programming

UR - http://eudml.org/doc/40600

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.