Results 51 to 60 of about 3,135,949 (80)
One of the most interesting models of the linear programming is the flexible linear programming problem. It is shown that by using a suitable membership function for their constraints, we can obtain an equivalent Fuzzy Variable Linear Programming (FVLP ...
S.H. Nasseri, A. Ebrahimnejad
core
A primal-dual method for linear programming problems with fuzzy variables
Linear programming problems with fuzzy variables have been investigated by many researchers in the recent literature. Some methods to solve these problems, such as the primal simplex method and the dual simplex method, are based on the concept of ...
M. Soltanifar +3 more
core
Integration of a primal simplex network algorithm with a large-scale mathematical programming system
, 1985 In this paper we discuss the implementation of a primal simplex algorithm for network problems in the MPSIII mathematical programming system. Because of the need to interface with the rest of the MPS this implementation is unorthodox, but computationally
J. A. Tomlin, J. S. Welch
core +1 more source
The intelligence of dual simplex method to solve linear fractional fuzzy transportation problem. [PDF]
Comput Intell Neurosci, 2015 Narayanamoorthy S, Kalyani S.
europepmc +1 more source
The airport gate assignment problem: a survey. [PDF]
ScientificWorldJournal, 2014 Bouras A +3 more
europepmc +1 more source
Equivalence of the Primal and Dual Simplex Algorithms for the Maximum Flow Problem
, 1996 In this paper, we study the primal and dual simplex algorithms for the maximum flow problem. We show that any primal simplex algorithm for the maximum flow problem can be converted into a dual simplex algorithm that performs the same number of pivots and
James B. Orlin, Ravindra K. Ahuja
core
SNPs selection using support vector regression and genetic algorithms in GWAS. [PDF]
BMC Genomics, 2014 de Oliveira FC +6 more
europepmc +1 more source
Commentary: an eye on PET quantification. [PDF]
Mol Imaging Biol, 2015 Walker MD, Sossi V.
europepmc +1 more source
An Interior-Point algorithm for Nonlinear Minimax Problems [PDF]
We present a primal-dual interior-point method for constrained nonlinear, discrete minimax problems where the objective functions and constraints are not necessarily convex.
E. Obasanjo, G. Tzallas-Regas, B. Rustem
core