Linear optimization with box constraints in Banach spaces

DOI10.1007/s10957-008-9481-4zbMath1169.90012OpenAlexW2054505036MaRDI QIDQ1028599

K. C. Sivakumar, J. M. Swarna

Publication date: 6 July 2009

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-008-9481-4

zbMATH Keywords

box optimization spacespartially-ordered Banach spaces

Mathematics Subject Classification ID

Linear programming (90C05) Programming in abstract spaces (90C48)

Related Items (1)

Nonnegative Generalized Inverses and Interval Linear Programs

Cites Work

• Unnamed Item
• Unnamed Item
• General forms for the recursive determination of generalized inverses: Unified approach
• An alternative proof of the Greville formula
• Sequential determination of the \(\{1, 4\}\)-inverse of a matrix
• Explicit solvability of a class of infinite linear economic models
• Explicit solutions for interval semidefinite linear programs
• Explicit solvability of dual pairs of infinite linear programs.
• On explicit solutions of interval programs
• Response to Bucy’s comment on a paper by Udwadia and Kalaba
• Applications of generalized inverses to interval linear programs in hilbert spaces
• An Explicit Solution of a Special Class of Linear Programming Problems
• Duality and asymptotic solvability over cones
• Technical Note—Explicit Solutions of Interval Linear Programs

This page was built for publication: Linear optimization with box constraints in Banach spaces