Explicit solvability of dual pairs of infinite linear programs.
From MaRDI portal
Publication:2476435
DOI10.1007/BF03398737zbMath1158.90385MaRDI QIDQ2476435
K. C. Sivakumar, J. Mercy Swarna
Publication date: 19 March 2008
Published in: Opsearch (Search for Journal in Brave)
90C46: Optimality conditions and duality in mathematical programming
90C05: Linear programming
90C48: Programming in abstract spaces
90C34: Semi-infinite programming
Related Items
A review of infinite matrices and their applications, A new characterization of nonnegativity of Moore-Penrose inverses of Gram operators, Linear optimization with box constraints in Banach spaces
Cites Work
- A primal algorithm for interval linear-programming problems
- Explicit solvability of a class of infinite linear economic models
- On explicit solutions of interval programs
- An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
- A suboptimization method for interval linear programming: A new method for linear programming
- Applications of generalized inverses to interval linear programs in hilbert spaces
- An Explicit Solution of a Special Class of Linear Programming Problems
- A Decomposition Method for Interval Linear Programming
- Technical Note—Solutions of a Special Class of Linear Programming Problems
- Technical Note—Explicit Solutions of Interval Linear Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
