Disjunctive Programming for Multiobjective Discrete Optimisation

Bektas, Tolga ORCID: 0000-0003-0634-144X (2018) Disjunctive Programming for Multiobjective Discrete Optimisation. INFORMS JOURNAL ON COMPUTING, 30 (4). pp. 625-633.

Text moip_paper_final.pdf - Author Accepted Manuscript Download (579kB)

Abstract

<jats:p> In this paper, I view and present the multiobjective discrete optimisation problem as a particular case of disjunctive programming where one seeks to identify efficient solutions from within a disjunction formed by a set of systems. The proposed approach lends itself to a simple yet effective iterative algorithm that is able to yield the set of all nondominated points, both supported and nonsupported, for a multiobjective discrete optimisation problem. Each iteration of the algorithm is a series of feasibility checks and requires only one formulation to be solved to optimality that has the same number of integer variables as that of the single objective formulation of the problem. The application of the algorithm shows that it is particularly effective when solving constrained multiobjective discrete optimisation problem instances. </jats:p><jats:p> The online supplement is available at https://doi.org/10.1287/ijoc.2017.0804 . </jats:p>

Item Type:	Article
Uncontrolled Keywords:	multiobjective optimisation, disjunctive programming, integer programming
Depositing User:	Symplectic Admin
Date Deposited:	12 Oct 2018 10:37
Last Modified:	19 Jan 2023 01:15
DOI:	10.1287/ijoc.2017.0804
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3027317