Add to ORKGIn a linear program (LP) in standard form, we show that the problem of finding a cheapest feasible basic vector among those containing a specified variable as a basic variable, is an NP-hard problem
Includes bibliographical references (p. 16-17).Supported by a Presidential Young Investigator Award....
In this paper we address the complexity of postoptimality analysis of 0/1 programs with a linear obj...
Linear programming (LP) stands for an optimization of a linear objective function, subject to linear...
AbstractIn a linear program (LP) in standard form, we show that the problem of finding a cheapest fe...
In a linear program (LP) in standard form, we show that the problem of finding a cheapest feasible b...
AbstractThe complexity of linear programming and other problems in the geometry of d-dimensions is s...
The complexity of linear programming is discussed in the "integer" and "real number" models of compu...
In this note, we show that linear programming and the prominent Basis Pursuit problem (i.e., minimiz...
We consider the problem of finding an −optimal solution of a standard linear pro-gram with real data...
Abstract. Recent years have brought some progress in the knowledge of the complexity of linear progr...
We consider the problem of finding an ε{lunate}-optimal solution of a standard linear program with ...
In this paper we show a simple treatment of the complexity of Linear Programming. We describe the sh...
AbstractWe describe an algorithm that first decides whether the primal-dual pair of linear programsm...
AbstractIn this paper, we consider the open problem of the complexity of the LLL algorithm in the ca...
It is proved that the computation of , the constrained gradient is equivalent (in a coMplexity, theo...
Includes bibliographical references (p. 16-17).Supported by a Presidential Young Investigator Award....
In this paper we address the complexity of postoptimality analysis of 0/1 programs with a linear obj...
Linear programming (LP) stands for an optimization of a linear objective function, subject to linear...
AbstractIn a linear program (LP) in standard form, we show that the problem of finding a cheapest fe...
In a linear program (LP) in standard form, we show that the problem of finding a cheapest feasible b...
AbstractThe complexity of linear programming and other problems in the geometry of d-dimensions is s...
The complexity of linear programming is discussed in the "integer" and "real number" models of compu...
In this note, we show that linear programming and the prominent Basis Pursuit problem (i.e., minimiz...
We consider the problem of finding an −optimal solution of a standard linear pro-gram with real data...
Abstract. Recent years have brought some progress in the knowledge of the complexity of linear progr...
We consider the problem of finding an ε{lunate}-optimal solution of a standard linear program with ...
In this paper we show a simple treatment of the complexity of Linear Programming. We describe the sh...
AbstractWe describe an algorithm that first decides whether the primal-dual pair of linear programsm...
AbstractIn this paper, we consider the open problem of the complexity of the LLL algorithm in the ca...
It is proved that the computation of , the constrained gradient is equivalent (in a coMplexity, theo...
Includes bibliographical references (p. 16-17).Supported by a Presidential Young Investigator Award....
In this paper we address the complexity of postoptimality analysis of 0/1 programs with a linear obj...
Linear programming (LP) stands for an optimization of a linear objective function, subject to linear...