Cone of recession and unboundedness of convex functions

European Journal of Operational Research

Volumn 133, Issue 2, 2001, Pages 409-415

  Obuchowska, W T ^a   Murty, K G ^b  

^a STATE UNIVERSITY OF NEW YORK AT FREDONIA   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Cone of recession; Convex programming; Unboundedness

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MATHEMATICAL PROGRAMMING; THEOREM PROVING; VECTORS;

CONVEX PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0034965260     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00136-3     Document Type: Article

References (6)

1. Convex functions with unbounded level sets and applications to duality theory
2. On checking unboundedness of functions
3. An algorithm to determine boundedness of quadratically constrained convex quadratic programmes