A Primal-Dual Exterior Point Algorithm for Linear Programming Problems
Nikolaos Samaras, Angelo Sifaleras, Charalampos Triantafyllidis (2009)
The Yugoslav Journal of Operations Research
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A New and Constructive Proof of Two Basic Results of Linear Programming”
A Primal-Dual Exterior Point Algorithm for Linear Programming Problems
On Finite Termination in the Primal-Dual Method for Linear Programming
Nebojša V. Stojković (2001)
The Yugoslav Journal of Operations Research
Similarity:
A New Exterior Point Algorithm for Linear Programming Problems
Konstantinos Dosios, Konstantinos Paparrizos (1994)
The Yugoslav Journal of Operations Research
Similarity:
An algorithm for solving multiple objective integer linear programming problem
Moncef Abbas, Djamal Chaabane (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In the present paper a complete procedure for solving Multiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.
Algorithm 51. Solution of linear programming problems in zero-one variables
S. Zieliński (1977)
Applicationes Mathematicae
Similarity:
A Slight Modification of the First Phase of the Simplex Algorithm
T. Divnić, Lj. Pavlović (2012)
The Yugoslav Journal of Operations Research
Similarity:
An Enumerative Algorithm for Non-Linear Multi-Level Integer Programming Problem
Ritu Narang, S.R. Arora (2009)
The Yugoslav Journal of Operations Research
Similarity:
Parametric integer programming
Paul Feautrier (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Algorithm 3. Solution of zero-one integer linear programming problems by Balas' method
Z. Cylkowski, J. Kucharczyk (1969)
Applicationes Mathematicae
Similarity:
Algorithm 14. Initial solution to the zero-one integer linear programming problem
M. Sysło (1971)
Applicationes Mathematicae
Similarity:
A quadratic programming algorithm for large and sparse problems
Miroslav Tůma (1991)
Kybernetika
Similarity:
Effects of ordering and updating techniques on the performance of the Karmarkar algorithm
Abdellah Salhi, George R. Lindfield (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
José Luis Quintero, Alejandro Crema (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.
An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
José Luis Quintero, Alejandro Crema (2009)
RAIRO - Operations Research
Similarity:
The multiparametric 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to a generalized min max objective function such that the min sum and min max are particular cases.