Explicit solvability of dual pairs of infinite linear programs.

DOI10.1007/BF03398737zbMath1158.90385MaRDI QIDQ2476435

J. Mercy Swarna, K. C. Sivakumar

Publication date: 19 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398737

zbMATH Keywords

generalized inverses; Ben-Israel-Charnes spaces; interval linear programs

Mathematics Subject Classification ID

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, A dual scheme for solving linear countable semi-infinite fractional programming problems

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