A Primal-Dual Exterior Point Algorithm for Linear Programming Problems
Nikolaos Samaras, Angelo Sifaleras, Charalampos Triantafyllidis (2009)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “A New Exterior Point Algorithm for Linear Programming Problems”
A Primal-Dual Exterior Point Algorithm for Linear Programming Problems
A Slight Modification of the First Phase of the Simplex Algorithm
T. Divnić, Lj. Pavlović (2012)
The Yugoslav Journal of Operations Research
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 implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximation
Ladislav Lukšan (1985)
Kybernetika
Similarity:
A Modified Step-Length Algorithm in Nonlinear Programming
Nada I. Žuranović-Miličić (2000)
The Yugoslav Journal of Operations Research
Similarity:
On Finite Termination in the Primal-Dual Method for Linear Programming
Nebojša V. Stojković (2001)
The Yugoslav Journal of Operations Research
Similarity:
Algorithm 3. Solution of zero-one integer linear programming problems by Balas' method
Z. Cylkowski, J. Kucharczyk (1969)
Applicationes Mathematicae
Similarity:
Algorithm 51. Solution of linear programming problems in zero-one variables
S. Zieliński (1977)
Applicationes Mathematicae
Similarity:
Algorithm 14. Initial solution to the zero-one integer linear programming problem
M. Sysło (1971)
Applicationes Mathematicae
Similarity:
A New and Constructive Proof of Two Basic Results of Linear Programming
Tibor Illès, Katalin Mèszêros (2001)
The Yugoslav Journal of Operations Research
Similarity:
An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem
Peng Wuliang, Huang Min, Hao Yongping (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an...
The Benders method and parametrization of the right-hand sides in the mixed integer linear programming problem
Jaroslav Hrouda (1976)
Aplikace matematiky
Similarity: