A suboptimization method for interval linear programming: A new method for linear programming
From MaRDI portal
(Redirected from Publication:2545859)
Cites work
- A Decomposition Method for Interval Linear Programming
- An Explicit Solution of a Special Class of Linear Programming Problems
- Generalized upper bounding techniques
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3209723 (Why is no real title available?)
- scientific article; zbMATH DE number 3089575 (Why is no real title available?)
- Optimality and Degeneracy in Linear Programming
- Technical Note—Explicit Solutions of Interval Linear Programs
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
- Virtual work, linear programming and plastic limit analysis
Cited in
(13)- An iterative row-action method for interval convex programming
- A comparison of interval linear programming with the simplex method
- Existence and representation of Diophantine and mixed Diophantine solutions to linear equations and inequalities
- A primal algorithm for interval linear-programming problems
- Explicit solvability of dual pairs of infinite linear programs.
- On explicit solutions of interval programs
- An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
- Complexity and computability of solutions to linear programming systems
- A Decomposition Method for Interval Linear Fractional Programming
- Techniques of linear programming based on the theory of convex cones
- Solving constrained matrix games with payoffs of triangular fuzzy numbers
- Page cuts for integer interval linear programming
- A new LAD curve-fitting algorithm: Slightly overdetermined equation systems in \(L_ 1\)
This page was built for publication: A suboptimization method for interval linear programming: A new method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2545859)