Pages that link to "Item:Q2311118"
From MaRDI portal
The following pages link to Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases (Q2311118):
Displaying 3 items.
- Weak optimal inverse problems of interval linear programming based on KKT conditions (Q2057406) (← links)
- Checking weak and strong optimality of the solution to interval convex quadratic program (Q2244344) (← links)
- Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form (Q6181380) (← links)
