Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Found
97029 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A spectral approach to polyhedral dimension
1990,
Lee Jon
The spectrum spec( 𝒫) of a convex polytope 𝒫⊆ℝ E is defined as the order...
Cutting big M down to size
1990,
Raturi Amitabh S.
Some texts and applied research papers continue to advocate the use of ‘ M,’ an...
A ‘build-down’ scheme for linear programming
1990,
Ye Yinyu
The paper proposes a ‘build-down’ scheme for Karmarkar’s algorithm and the simplex...
Karmarkar’s algorithm with improved steps
1990,
Kalantari B.
The paper defines a function of the interior of the feasible region of Karmarkar’s canonical linear...
An exponential example for Terlaky’s pivoting rule for the criss-cross simplex method
1990,
Roos C.
Recently T. Terlaky has proposed a new pivoting rule for the criss-cross simplex method for linear...
A one-phase algorithm for semi-infinite linear programming
1990,
Hu Hui
The paper presents an algorithm for solving a large class of semi-infinite linear programming problems....
Asymptotic behaviour of Karmarkar’s method for linear programming
1990,
Asic Miroslav D.
The asymptotic behaviour of Karmarkar’s method is studied and an estimate of the rate of the...
On the improvement per iteration in Karmarkar’s algorithm for linear programming
1990,
McDiarmid Colin
We investigate the decrease in potential at an iteration of Karmarkar’s projective method for linear...
A recursive procedure to generate all cuts for 0-1 mixed integer programs
1990,
Wolsey Laurence A.
The authors study several ways of obtaining valid inequalities for mixed integer programs. They show how...
Linear updates for a single-phase projective method
1990,
Fraley C.
De Ghellinck and Vial developed a single-phase polynomial projective method for the primal linear...
The principal pivoting method revisited
1990,
Cottle Richard W.
The principal pivoting method (PPM) for the linear complementarity problem (LCP) is shown to be applicable...
CP-rays in simplicial cones
1990,
Kelly Leroy M.
This paper is dedicated to the memory of Paolo M. Camerini of Politecnico di Milano whose untimely passing...
Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
1990,
Kojima Masakazu
This paper deals with the LCP (linear complementarity problem) with a positive semi-definite matrix....
Error bounds for nondegenerate monotone linear complementarity problems
1990,
Mangasarian O.L.
Error bounds and upper Lipschitz continuity results are given for monotone linear complementarity problems...
An implementation of the dual local decomposition method
1991,
Van de Panne Cornelis
The paper deals with a method for solving a linear programming problem with a primal block-angular...
Direct algebraic solution for linear differential equations using PL transform
1989,
Nohara Kazuo
A new direct algebraic algorithm is developed for the numerical solution of linear differential equations....
Containing and shrinking ellipsoids in the path-following algorithm
1990,
Todd Michael J.
The authors describe a new potential function and a sequence of ellipsoids in the path-following algorithm...
A short proof of finiteness of Murty’s principal pivoting algorithm
1990,
Rohn Jiri
The paper gives a short proof of the finiteness of Murty’s principal pivoting algorithm for solving...
Generalized linear complementarity problems
1990,
Gowda M. Seetharama
It has been shown by Lemke that if a matrix is copositive plus on ℝ n , then feasibility of the...
An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations
1990,
Vaidya Pravin M.
The paper presents an algorithm for linear programming which requires arithmetic operations where m is the...
A new theorem of the alternative
1990,
Dax Achiya
Although the theorems of the alternative have been well known for a long time, their relationship to...
A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
1990,
Anstreicher Kurt M.
In his original analysis of the projective algorithm for linear programming, Karmarkar proposed a...
Mathematical foundations of nonsmooth embedding methods
1990,
Robinson Stephen M.
This paper establishes a mathematical foundation for application of the well known classical embedding...
Benders decomposition for variational inequalities
1990,
Lawphongpanich Siriphong
The partitioning technique of J.F. Benders, which was generalized to nonlinear programming by Geoffrion,...
First Page
3850
3851
3852
3853
3854
Last Page
Papers per page:
8 Papers
16 Papers
24 Papers
32 Papers
48 Papers
Paper Filter
Search Text
Journals
Authors
Keywords
Countries
Year
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
Filter It!