Lasserre Jean B.

Jean B. Lasserre

Information about the author Jean B. Lasserre will soon be added to the site.
Found 14 papers in total
On counting integral points in a convex rational polytope
On counting integral points in a convex rational polytope
2003
Given a convex rational polytope Ω(b):={x∈ℝ n + | Ax=b} ,...
An alternative algorithm for counting lattice points in a convex polytope
An alternative algorithm for counting lattice points in a convex polytope
2005
We provide an alternative algorithm for counting lattice points in the convex polytope...
Generating functions and duality for integer programs
Generating functions and duality for integer programs
2004
We consider the integer program: max c′x | Ax=y;x ∈ N n ....
A discrete Farkas lemma
A discrete Farkas lemma
2004
Given A ∈ ℤ m × n and b ∈ ℤ m , we consider the issue of...
Integer programming, Barvinok's counting algorithm and Gomory relaxations
Integer programming, Barvinok's counting algorithm and Gomory relaxations
2004
We propose an algorithm based on Barvinok's counting algorithm for P...
The optimal value of integer programs
The optimal value of integer programs
2002
We present a formula for the optimal value ƒ c (y) of the integer program max...
Semidefinite programming vs. linear programming relaxations for polynomial programming
Semidefinite programming vs. linear programming relaxations for polynomial programming
2002
We consider the global minimization of a multivariate polynomial on a semi-algebraic...
Solving the knapsack problem via ℤ-transform
Solving the knapsack problem via ℤ-transform
2002
Given vectors a,c∈ℤ n and b ∈ℤ, we consider the (unbounded)...
Fatou's Lemma and Lebesgue's convergence theorem for measures
Fatou's Lemma and Lebesgue's convergence theorem for measures
2000
Analogues of Fatou's Lemma and Lebesgue's convergence theorems are established for...
Why the logarithmic barrier function in convex and linear programming?
Why the logarithmic barrier function in convex and linear programming?
2000
We provide a simple interpretation of the use of the logarithmic barrier function in...
Quasi-Feller Markov chains
Quasi-Feller Markov chains
2000
We consider the class of Markov kernels for which the weak or strong Feller property...
Invariant probabilities for Feller-Markov chains
Invariant probabilities for Feller-Markov chains
1995
The authors give necessary and sufficient conditions for the existence of invariant...
Linear programming and average optimality of Markov control processes on Borel spaces-unbounded costs
Linear programming and average optimality of Markov control processes on Borel spaces-unbounded costs
1994
This paper is concerned with the linear programming formulation of Markov control...
Using linear programming in Petri net analysis
Using linear programming in Petri net analysis
1989
The algebraic representation of polyhedral sets is an alternative tool for the...
Papers per page: