Conditions for boundedness in concave programming under reverse convex and convex constraints-Reference-Cited by-同舟云学术

Conditions for boundedness in concave programming under reverse convex and convex constraints

Published:2006-09-27 Issue:2 Volume:65 Page:261-279
ISSN:1432-2994
Container-title:Mathematical Methods of Operations Research
language:en
Short-container-title:Math Meth Oper Res

Author:

Obuchowska Wiesława T.

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s00186-006-0110-4.pdf

Reference17 articles.

1. Bank B, Mandel R (1988) Parametric integer optimization. Mathematical Research, Academie, Berlin, 39

2. Bertsekas DP (2003) Convex analysis and optimization. Athena Scientific, Belmont, MA

3. Caron RJ, Obuchowska WT (1992) Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints. Eur J Oper Res 63:114–123

4. Caron RJ, Obuchowska WT (1995) An algorithm to determine boundedness of quadratically constrained convex quadratic programmes. Eur J Oper Res 80:431–438

5. Hiriart-Urutty J-B (2001) Global optimimality conditions in maximizing a convex quadratic function under convex quadratic constraints. J Global Optim 21:445–455

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Feasible partition problem in reverse convex and convex mixed-integer programming;European Journal of Operational Research;2014-05

2. Feasibility in reverse convex mixed-integer programming;European Journal of Operational Research;2012-04

3. Unboundedness in reverse convex and concave integer programming;Mathematical Methods of Operations Research;2010-06-10

4. On boundedness of (quasi-)convex integer optimization problems;Mathematical Methods of Operations Research;2008-01-08