Unboundedness in reverse convex and concave integer programming-Reference-Cited by-同舟云学术

Unboundedness in reverse convex and concave integer programming

Published:2010-06-10 Issue:2 Volume:72 Page:187-204
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-010-0315-4.pdf

Reference24 articles.

1. Bank B, Mandel R (1988) Parametric integer optimization. Mathematical research. Academie-Verlag, Berlin, p 39

2. 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

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

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

5. Hillestad RJ, Jacobsen SE (1980) Reverse convex programming. Appl Math Optim 6: 63–78

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

1. Irreducible Infeasible Sets in Convex Mixed-Integer Programs;Journal of Optimization Theory and Applications;2015-03-04

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

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