The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Linear programming with inequality constraints via entropic perturbation.”

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

Shyam S. Chadha (1988)

Trabajos de Investigación Operativa

Similarity:

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.

Reformulations in Mathematical Programming: Definitions and Systematics

Leo Liberti (2009)

RAIRO - Operations Research

Similarity:

A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts...