Pages that link to "Item:Q2511193"

The following pages link to Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints (Q2511193):

Displaying 14 items.

• Robust optimal solutions in interval linear programming with forall-exists quantifiers (Q323404) (← links)
• Farkas-type conditions of general interval linear systems for AE solvability (Q347502) (← links)
• AE solutions and AE solvability to general interval linear systems (Q471937) (← links)
• Necessary and sufficient conditions for unified optimality of interval linear program in the general form (Q491109) (← links)
• On interval-valued pseudolinear functions and interval-valued pseudolinear optimization problems (Q492568) (← links)
• AE solutions to two-sided interval linear systems over max-plus algebra (Q824845) (← links)
• On strong optimality of interval linear programming (Q1676494) (← links)
• Interval convex quadratic programming problems in a general form (Q1788939) (← links)
• Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases (Q2311118) (← links)
• AE solutions to interval linear systems over max-plus algebra (Q2321362) (← links)
• Inverse optimization: towards the optimal parameter set of inverse LP with interval coefficients (Q2358169) (← links)
• Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions (Q2943833) (← links)
• The best, the worst and the semi-strong: optimal values in interval linear programming (Q5147620) (← links)
• Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form (Q6181380) (← links)