Pages that link to "Item:Q4228409"
From MaRDI portal
The following pages link to Linear Programming with Inexact Data is NP‐Hard (Q4228409):
Displaying 9 items.
- Farkas-type conditions of general interval linear systems for AE solvability (Q347502) (← links)
- Weak and strong solvability of interval linear systems of equations and inequalities (Q389688) (← links)
- Checking solvability of systems of interval linear equations and inequalities via mixed integer programming (Q1042106) (← links)
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming (Q1758029) (← links)
- Optimal value bounds in interval fractional linear programming and revenue efficiency measuring (Q2201303) (← links)
- A Farkas-type theorem for interval linear inequalities (Q2448223) (← links)
- Farkas-type theorems for interval linear systems (Q4981968) (← links)
- Letter to the editor (Q5300055) (← links)
- Interval systems of max-separable linear equations (Q5956251) (← links)
