Explicit solvability of dual pairs of infinite linear programs.
From MaRDI portal
Publication:2476435
Recommendations
Cites work
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 3558452 (Why is no real title available?)
- scientific article; zbMATH DE number 1102620 (Why is no real title available?)
- scientific article; zbMATH DE number 3396557 (Why is no real title available?)
- A Decomposition Method for Interval Linear Programming
- A primal algorithm for interval linear-programming problems
- A suboptimization method for interval linear programming: A new method for linear programming
- An Explicit Solution of a Special Class of Linear Programming Problems
- An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
- Applications of generalized inverses to interval linear programs in hilbert spaces
- Explicit solvability of a class of infinite linear economic models
- On explicit solutions of interval programs
- Technical Note—Explicit Solutions of Interval Linear Programs
- Technical Note—Solutions of a Special Class of Linear Programming Problems
Cited in
(6)- A dual scheme for solving linear countable semi-infinite fractional programming problems
- A review of infinite matrices and their applications
- Linear optimization with box constraints in Banach spaces
- Explicit solvability of a class of infinite linear economic models
- scientific article; zbMATH DE number 3941266 (Why is no real title available?)
- A new characterization of nonnegativity of Moore-Penrose inverses of Gram operators
This page was built for publication: Explicit solvability of dual pairs of infinite linear programs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476435)