On a general dynamic programming problem
A. Nowak (1977)
Colloquium Mathematicae
Similarity:
Displaying similar documents to “Contents of volume 35 issue 3”
On a general dynamic programming problem
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:
How to treat decision problems by different programming methodologies
G. Cioni, A. Miola (1988)
Banach Center Publications
Similarity:
Dynamic programming with bivalent variables
P. L. Ivanescu (1966)
Matematički Vesnik
Similarity:
Integer Programming Formulation of the Bilevel Knapsack Problem
R. Mansi, S. Hanafi, L. Brotcorne (2010)
Mathematical Modelling of Natural Phenomena
Similarity:
The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. In the first stage, a dynamic programming algorithm is used to compute the set of reactions of the follower. The second stage consists in solving an integer program reformulation of BKP. We show that ...
Interactive compromise hypersphere method and its applications
Sebastian Sitarz (2012)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The paper focuses on multi-criteria problems. It presents the interactive compromise hypersphere method with sensitivity analysis as a decision tool in multi-objective programming problems. The method is based on finding a hypersphere (in the criteria space) which is closest to the set of chosen nondominated solutions. The proposed modifications of the compromise hypersphere method are based on using various metrics and analyzing their influence on the original method. Applications of...