About the Problem of Disjunctive Programming
Ivan I. Eremin (2000)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “Semistochastic decomposition scheme in mathematical programming and game theory”
About the Problem of Disjunctive Programming
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.
A second order -approximation method for constrained optimization problems involving second order invex functions
Tadeusz Antczak (2009)
Applications of Mathematics
Similarity:
A new approach for obtaining the second order sufficient conditions for nonlinear mathematical programming problems which makes use of second order derivative is presented. In the so-called second order -approximation method, an optimization problem associated with the original nonlinear programming problem is constructed that involves a second order -approximation of both the objective function and the constraint function constituting the original problem. The equivalence between...
Linear programming with inequality constraints via entropic perturbation.
Tsao, H.-S.Jacob, Fang, Shu-Cherng (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Duality in vector optimization. I. Abstract duality scheme
Tran Quoc Chien (1984)
Kybernetika
Similarity:
Second order convexity and a modified objective function method in mathematical programming
Tadeusz Antczak (2007)
Control and Cybernetics
Similarity:
A Two-Phase Linear Programming Approach for Redundancy Allocation Problems
Yi-Chih Hsieh (2002)
The Yugoslav Journal of Operations Research
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 ...