Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"nondominated set"”.

  1. MULTIPLE OBJECTIVE LINEAR PROGRAMMING IN OBJECTIVE SPACE

    … linear objectives over a convex polyhedral set. The MOLP problem is max Cx, subject to x (ELEM) X = {x: Ax (LESSTHEQ) b, x (GREATERTHEQ) 0} where C is the k x n cost coefficient matrix and A is the m x n constraint matrix. x (ELEM) X is efficient and y = Cx (ELEM) Y = C(X) is nondominated if …

    nebraska Repository record for MULTIPLE OBJECTIVE LINEAR PROGRAMMING IN OBJECTIVE SPACE (opens in a new tab)

  2. Multiple Objective Linear Programming in Radiotherapy Treatment Planning

    … Then in order to approximate the true nondominated set we propose a modification of Benson’s algorithm which is called an approximation version of Benson’s algorithm. Our approximation algorithm computes an inner and an outer approximation of the nondominated set. We prove that the …

    auckland-ms Repository record for Multiple Objective Linear Programming in Radiotherapy Treatment Planning (opens in a new tab)

  3. GEOMETRIC APPROACH TO MULTIPLE OBJECTIVE OPTIMIZATION WITH APPLICATION TO MULTIPLE CRITERIA DECISION-MAKING (FACES OF FINITE CONE, ALGORITHM FOR MOLP, UTILITY ANALYSIS)

    … at any vertex in objective space, the objective set is contained in the cone generated by the columns of the reduced cost matrix. So the problem of finding the nondominated faces in the objective space is reduced to finding the nondominated faces of a finitely generated cone. The latter problem …

    nebraska Repository record for GEOMETRIC APPROACH TO MULTIPLE OBJECTIVE OPTIMIZATION WITH APPLICATION TO MULTIPLE CRITERIA DECISION-MAKING (FACES OF FINITE CONE, ALGORITHM FOR MOLP, UTILITY ANALYSIS) (opens in a new tab)

  4. Strategies in Multiple Criteria Decision Making

    … value that objective v can take within the nondominated set and M(,v), the maximum feasible value for objective v. An algorithm is developed to find n(,v). Evaluation of M(,v) is a straightforward linear programming problem.

    uiuc Repository record for Strategies in Multiple Criteria Decision Making (opens in a new tab)

  5. Quality Representation in Multiobjective Programming

    … on generating quality representations of the nondominated set of multiobjective programming problems. This manuscript presents two methods for generating discrete representations with equidistant points for multiobjective programs with solution sets determined by convex cones. The Bilevel …

    clemson Repository record for Quality Representation in Multiobjective Programming (opens in a new tab)

  6. Domination and Decomposition in Multiobjective Programming

    … new findings are presented that characterize the nondominated set of a general vector optimization problem for which the underlying domination structure is defined in terms of different cones. Using concepts from linear algebra and convex analysis, a well known result relating nondominated points …

    clemson Repository record for Domination and Decomposition in Multiobjective Programming (opens in a new tab)