About the Problem of Disjunctive Programming
Ivan I. Eremin (2000)
The Yugoslav Journal of Operations Research
Similarity:
Ivan I. Eremin (2000)
The Yugoslav Journal of Operations Research
Similarity:
I. I. Eremin (1995)
The Yugoslav Journal of Operations Research
Similarity:
Anatolly Anatolijevich Vatolin (1996)
The Yugoslav Journal of Operations Research
Similarity:
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...
S., Paulraj, P., Sumathi (2010)
Mathematical Problems in Engineering
Similarity:
Sanjo Zlobec (1991)
The Yugoslav Journal of Operations Research
Similarity:
Predrag S. Stanimirović, Milan B. Tasić, Miroslav Ristić (1999)
The Yugoslav Journal of Operations Research
Similarity:
Ellis L. Johnson, George L. Nemhauser (1992)
The Yugoslav Journal of Operations Research
Similarity:
Ram, Balasubramanian, Babu, A.J.G. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Tsao, H.-S.Jacob, Fang, Shu-Cherng (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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.