Reformulations in Mathematical Programming: Definitions and Systematics

Leo Liberti

Displaying similar documents to “Reformulations in Mathematical Programming: Definitions and Systematics”

Second order convexity and a modified objective function method in mathematical programming

Tadeusz Antczak (2007)

Control and Cybernetics

Similarity:

A comparative study of redundant constraints identification methods in linear programming problems.

S., Paulraj, P., Sumathi (2010)

Mathematical Problems in Engineering

Similarity:

A comparative study on optimization methods for the constrained nonlinear programming problems.

Yeniay, Ozgur (2005)

Mathematical Problems in Engineering

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 ...

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: