Pages that link to "Item:Q2545859"

The following pages link to A suboptimization method for interval linear programming: A new method for linear programming (Q2545859):

Displaying 12 items.

• Solving constrained matrix games with payoffs of triangular fuzzy numbers (Q692278) (← links)
• Page cuts for integer interval linear programming (Q754756) (← links)
• A new LAD curve-fitting algorithm: Slightly overdetermined equation systems in \(L_ 1\) (Q789142) (← links)
• An iterative row-action method for interval convex programming (Q1138236) (← links)
• A comparison of interval linear programming with the simplex method (Q1154389) (← links)
• Existence and representation of Diophantine and mixed Diophantine solutions to linear equations and inequalities (Q1235230) (← links)
• A primal algorithm for interval linear-programming problems (Q1247801) (← links)
• Explicit solvability of dual pairs of infinite linear programs. (Q2476435) (← links)
• On explicit solutions of interval programs (Q2540951) (← links)
• An interval programming algorithm for discrete linear \(L_ 1\) approximation problems (Q2544339) (← links)
• Complexity and computability of solutions to linear programming systems (Q3898028) (← links)
• A Decomposition Method for Interval Linear Fractional Programming (Q4086979) (← links)