scholarly works

Permanent URI for this collectionhttps://repository.ui.edu.ng/handle/123456789/473

Browse

Filters

19992

Settings

Start date: 1990End date: 1999

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    A biobjective production planning model and application of three LP procedures
    (Nigerian Metallurgical Society, 1999) Adeyeye, A. D.; Charles-Owaba, O. E.
    A biobjective model is proposed for production planning in a multi-stage, multi-facility production system. The decision situation considered was a case where the Decision Maker (DM) wants to determine the quantities of materials to be fed into each production facility at each stage of production that gives maximal realization of his objectives. A numerical example is solved using three Linear Programming procedures. The methods used are: Compromise Constraint Biobjective LP (CCBLP), Linear Combination of the Objective Functions (LCOF) and Goal Programming (GP). The behaviour of the CCBLP model shows that it is superior to LCOF and non-preemptive GP in terms of its sensitivity to relaxations in the objectives. It also supports the result of an earlier research that the CCBLP gives the real compromise solution.
  • Thumbnail Image
    Item
    A set of sequencing heuristic and the computer code for the TSP.
    (1999) Charles-Owaba, O. E.; Oladokun, V. O.
    This paper proposes a set sequencing heuristic solution for the travelling salesman problem (TSP). It attempts to first select, preferably a set of M smallest elements of the TSP matrix and then form a sequence. A computer code of the procedure was developed in Fortran 77 and used to examine its efficiency and relative effectiveness. It was found to be as effective as, but more efficient than the best of the nearest neighbour heuristics.