On the general minimax theorem
Hoàng Tụy (1975)
Colloquium Mathematicae
Similarity:
Displaying similar documents to “Primal interior point method for generalized minimax functions”
On the general minimax theorem
Remarks on minimax solutions
V. Lakshmikantham, S. Leela (1967)
Annales Polonici Mathematici
Similarity:
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.
Transformations of Dual Problem and Decreasing Dimensions in Linear Programming
Nebojša Stojković, Predrag Stanimirović (2002)
Matematički Vesnik
Similarity:
On Finite Termination in the Primal-Dual Method for Linear Programming
Nebojša V. Stojković (2001)
The Yugoslav Journal of Operations Research
Similarity:
How to treat decision problems by different programming methodologies
G. Cioni, A. Miola (1988)
Banach Center Publications
Similarity:
About the Problem of Disjunctive Programming
Ivan I. Eremin (2000)
The Yugoslav Journal of Operations Research
Similarity:
On the relationship of interior-point methods.
Sheu, Ruey-Lin, Fang, Shu-Cherng (1993)
International Journal of Mathematics and Mathematical Sciences
Similarity: