Feasible partition problem in reverse convex and convex mixed-integer programming

In this paper we consider the consistent partition problem in reverse convex and convex mixed-integer programming. In particular we will show that for the considered classes of convex functions, both integer and relaxed systems can be partitioned into two disjoint subsystems, each of which is consistent and defines an unbounded region. The polynomial time algorithm to generate the partition will be proposed and the algorithm for a maximal partition will also be provided.

MoreLess

Year of publication:	2014
Authors:	Obuchowska, Wiesława T.
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 235.2014, 1, p. 129-137
Publisher:	Elsevier
Subject:	Integer programming \| Infeasibility \| Reverse convex and convex constraints \| Feasible partition and maximal consistent partition problem

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011052791