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:
Displaying similar documents to “The Rayleigh quotient and dynamic programming.”
Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming.
A duality theorem for complex nonlinear programming
C. Das, J. Parida (1977)
Matematički Vesnik
Similarity:
On a general dynamic programming problem
A. Nowak (1977)
Colloquium Mathematicae
Similarity:
Two and Three-Dimensional Art Inspired by Polynomiography
Bahman Kalantari (2006)
Visual Mathematics
Similarity:
Contents of volume 35 issue 3
(2006)
Control and Cybernetics
Similarity:
Dynamic programming with bivalent variables
P. L. Ivanescu (1966)
Matematički Vesnik
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.
Relationship between dynamic programming and the maximum principle under state constraints.
Kim, Kyung-Eung (1999)
Journal of Convex Analysis
Similarity:
On the central path for nonlinear semidefinite programming
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...
Column-Generation in Integer Linear Programming
Nelson Maculan, Marcos de Mendonça Passini, José André de Moura Brito, Irene Loiseau (2010)
RAIRO - Operations Research
Similarity:
We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application...