Pages that link to "Item:Q1006541"
From MaRDI portal
The following pages link to Conditions for boundedness in concave programming under reverse convex and convex constraints (Q1006541):
Displaying 10 items.
- Feasibility in reverse convex mixed-integer programming (Q439456) (← links)
- Unboundedness in reverse convex and concave integer programming (Q604803) (← links)
- On boundedness of (quasi-)convex integer optimization problems (Q999128) (← links)
- Convex programs with an additional reverse convex constraint (Q1071651) (← links)
- Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints (Q1206605) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- Extension of Eaves theorem for determining the boundedness of convex quadratic programming problems (Q2663382) (← links)
- GOOD DEAL BOUNDS WITH CONVEX CONSTRAINTS (Q2976129) (← links)
- Efficiency of a Global Optimization Algorithm (Q3776516) (← links)
- On checking unboundedness of functions (Q3987194) (← links)
