Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming.
Ram, Balasubramanian, Babu, A.J.G. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ram, Balasubramanian, Babu, A.J.G. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
C. Das, J. Parida (1977)
Matematički Vesnik
Similarity:
A. Nowak (1977)
Colloquium Mathematicae
Similarity:
Bahman Kalantari (2006)
Visual Mathematics
Similarity:
(2006)
Control and Cybernetics
Similarity:
P. L. Ivanescu (1966)
Matematički Vesnik
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.
Kim, Kyung-Eung (1999)
Journal of Convex Analysis
Similarity:
L. M. Grana Drummond, Alfredo Noel Iusem, B. F. Svaiter (2010)
RAIRO - Operations Research
Similarity:
In this paper we study the well definedness of the central path associated to a given nonlinear (convex) semidefinite programming problem. Under standard assumptions, we establish that the existence of the central path is equivalent to the nonemptiness and boundedness of the optimal set. Other equivalent conditions are given, such as the existence of a strictly dual feasible point or the existence of a single central point.The monotonic behavior of the logarithmic barrier and the objective...