AbstractIn this paper duality theory for infinite dimensional linear programs is discussed in a topological vector space setting. Infinite dimensional linear programs occur in many different areas and the duality theory of such problems has been discussed by a number of authors. However, the results are scattered in the literature and are proved in a variety of different settings. The purpose of this paper is to bring together the main results on this subject and to present them in a unified setting and notation with some new simpler proofs
Strong duality for conic linear problems $(P)$ and $(D)$ generated by convex cones $S\subset X$, $T\...
ABSTRACT: We study a problem of linear programming in the setting of a vector space over a linearly ...
AbstractLinear programming is formulated with the vector variable replaced by a matrix variable, wit...
We consider the class of linear programs with infinitely many variables and constraints having the p...
AbstractLinear semi-infinite programming deals with the optimization of linear functionals on finite...
AbstractIn this paper, we consider a primal–dual infinite linear programming problem-pair, i.e. LPs ...
AbstractWe study the infinite dimensional linear programming problem. The previous work done on this...
In this paper we consider a primal-dual infinite linear programming problem-pair, i.e. LPs on infini...
AbstractPrevious duality theories for discrete-time linear systems over a field K have been restrict...
The main purpose of this paper is to extend the John theorem on nonlinear programming with inequalit...
Any linear (ordinary or semi-infinite) optimization problem, and also its dual problem, can be class...
by Yuen Chung Man.Bibliography: leaves 47-48Thesis (M.Ph.)--Chinese University of Hong Kong, 198
In this note we analyze the simultaneous preservation of the consistency (and of the inconsistency) ...
AbstractThis paper develops new duality relations in linear programming which give new economic inte...
AbstractA duality theory for algebraic linear (integer) programming (ALP) is developed which is of t...
Strong duality for conic linear problems $(P)$ and $(D)$ generated by convex cones $S\subset X$, $T\...
ABSTRACT: We study a problem of linear programming in the setting of a vector space over a linearly ...
AbstractLinear programming is formulated with the vector variable replaced by a matrix variable, wit...
We consider the class of linear programs with infinitely many variables and constraints having the p...
AbstractLinear semi-infinite programming deals with the optimization of linear functionals on finite...
AbstractIn this paper, we consider a primal–dual infinite linear programming problem-pair, i.e. LPs ...
AbstractWe study the infinite dimensional linear programming problem. The previous work done on this...
In this paper we consider a primal-dual infinite linear programming problem-pair, i.e. LPs on infini...
AbstractPrevious duality theories for discrete-time linear systems over a field K have been restrict...
The main purpose of this paper is to extend the John theorem on nonlinear programming with inequalit...
Any linear (ordinary or semi-infinite) optimization problem, and also its dual problem, can be class...
by Yuen Chung Man.Bibliography: leaves 47-48Thesis (M.Ph.)--Chinese University of Hong Kong, 198
In this note we analyze the simultaneous preservation of the consistency (and of the inconsistency) ...
AbstractThis paper develops new duality relations in linear programming which give new economic inte...
AbstractA duality theory for algebraic linear (integer) programming (ALP) is developed which is of t...
Strong duality for conic linear problems $(P)$ and $(D)$ generated by convex cones $S\subset X$, $T\...
ABSTRACT: We study a problem of linear programming in the setting of a vector space over a linearly ...
AbstractLinear programming is formulated with the vector variable replaced by a matrix variable, wit...