177 research outputs found

    An Algorithm for Biobjective Mixed Integer Quadratic Programs

    Get PDF
    Multiobjective quadratic programs (MOQPs) are appealing since convex quadratic programs have elegant mathematical properties and model important applications. Adding mixed-integer variables extends their applicability while the resulting programs become global optimization problems. Thus, in this work, we develop a branch and bound (BB) algorithm for solving biobjective mixed-integer quadratic programs (BOMIQPs). An algorithm of this type does not exist in the literature. The algorithm relies on five fundamental components of the BB scheme: calculating an initial set of efficient solutions with associated Pareto points, solving node problems, fathoming, branching, and set dominance. Considering the properties of the Pareto set of BOMIQPs, two new fathoming rules are proposed. An extended branching module is suggested to cooperate with the node problem solver. A procedure to make the dominance decision between two Pareto sets with limited information is proposed. This set dominance procedure can eliminate the dominated points and eventually produce the Pareto set of the BOMIQP. Numerical examples are provided. Solving multiobjective quadratic programs (MOQPs) is fundamental to our research. Therefore, we examine the algorithms for this class of problems with different perspectives. The scalarization techniques for (strictly) convex MOPs are reviewed and the available algorithms for computing efficient solutions for MOQPs are discussed. These algorithms are compared with respect to four properties of MOQPs. In addition, methods for solving parametric multiobjective quadratic programs are studied. Computational studies are provided with synthetic instances, and examples in statistics and portfolio optimization. The real-life context reveals the interplay between the scalarizations and provides an additional insight into the obtained parametric solution sets

    Revisiting Norm Optimization for Multi-Objective Black-Box Problems: A Finite-Time Analysis

    Full text link
    The complexity of Pareto fronts imposes a great challenge on the convergence analysis of multi-objective optimization methods. While most theoretical convergence studies have addressed finite-set and/or discrete problems, others have provided probabilistic guarantees, assumed a total order on the solutions, or studied their asymptotic behaviour. In this paper, we revisit the Tchebycheff weighted method in a hierarchical bandits setting and provide a finite-time bound on the Pareto-compliant additive ϵ\epsilon-indicator. To the best of our knowledge, this paper is one of few that establish a link between weighted sum methods and quality indicators in finite time.Comment: submitted to Journal of Global Optimization. This article's notation and terminology is based on arXiv:1612.0841

    Stability Analysis in Multicriteria Discrete Portfolio Optimization.

    Get PDF
    Almost every problem of design, planning and management in the technical and organizational systems has several conflicting goals or interests. Nowadays, multicriteria decision models represent a rapidly developing area of operation research. While solving practical optimization problems, it is necessary to take into account various kinds of uncertainty due to lack of data, inadequacy of mathematical models to real-time processes, calculation errors, etc. In practice, this uncertainty usually leads to undesirable outcomes where the solutions are very sensitive to any changes in the input parameters. An example is the investment managing. Stability analysis of multicriteria discrete optimization problems investigates how the found solutions behave in response to changes in the initial data (input parameters). This thesis is devoted to the stability analysis in the problem of selecting investment project portfolios, which are optimized by considering different types of risk and efficiency of the investment projects. The stability analysis is carried out in two approaches: qualitative and quantitative. The qualitative approach describes the behavior of solutions in conditions with small perturbations in the initial data. The stability of solutions is defined in terms of existence a neighborhood in the initial data space. Any perturbed problem from this neighborhood has stability with respect to the set of efficient solutions of the initial problem. The other approach in the stability analysis studies quantitative measures such as stability radius. This approach gives information about the limits of perturbations in the input parameters, which do not lead to changes in the set of efficient solutions. In present thesis several results were obtained including attainable bounds for the stability radii of Pareto optimal and lexicographically optimal portfolios of the investment problem with Savage's, Wald's criteria and criteria of extreme optimism. In addition, special classes of the problem when the stability radii are expressed by the formulae were indicated. Investigations were completed using different combinations of Chebyshev's, Manhattan and Hölder's metrics, which allowed monitoring input parameters perturbations differently.Siirretty Doriast

    Quality Representation in Multiobjective Programming

    Get PDF
    In recent years, emphasis has been placed 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 Controlled Spacing (BCS) method has a bilevel structure with the lower-level generating the nondominated points and the upper-level controlling the spacing. The Constraint Controlled Spacing (CCS) method is based on the epsilon-constraint method with an additional constraint to control the spacing of generated points. Both methods (under certain assumptions) are proven to produce (weakly) nondominated points. Along the way, several interesting results about obtuse, simplicial cones are also proved. Both the BCS and CCS methods are tested and show promise on a variety of problems: linear, convex, nonconvex (CCS only), two-dimensional, and three-dimensional. Sample Matlab code for two of these examples can be found in the appendices as well as tables containing the generated solution points. The manuscript closes with conclusions and ideas for further research in this field

    Methods for many-objective optimization: an analysis

    Get PDF
    Decomposition-based methods are often cited as the solution to problems related with many-objective optimization. Decomposition-based methods employ a scalarizing function to reduce a many-objective problem into a set of single objective problems, which upon solution yields a good approximation of the set of optimal solutions. This set is commonly referred to as Pareto front. In this work we explore the implications of using decomposition-based methods over Pareto-based methods from a probabilistic point of view. Namely, we investigate whether there is an advantage of using a decomposition-based method, for example using the Chebyshev scalarizing function, over Paretobased methods

    Pareto optimality in multiobjective Markov control processes

    Get PDF
    This paper studies discrete-time multiobjective Markov control processes (MCPs) on Borel spaces and with unbounded costs. Under mild assumptions, it shows the existence of Pareto optimal control policies, which are also characterized as optimal policies for a certain class of single-objective ( or "scalar") MCPs. A similar result is obtained for strong Pareto optimal policies, which are Pareto optimal policies whose cost vector is the closest, in the Euclidean norm, to the virtual minimum. To obtain these results, the basic idea is to transform the multiobjective MCP into an equivalent multiobjective measure problem (MMP). In addition, MMP is restated as a primal multiobjective linear program and it is shown that solving the scalarized MCPs is in fact the same as solving the dual of MMP. A multiobjective LQ example illustrates the main results

    Weighted stress function method for multiobjective evolutionary algorithm based on decomposition

    Get PDF
    Multiobjective evolutionary algorithm based on decomposition (MOEA/D) is a well established state-of-the-art framework. Major concerns that must be addressed when applying MOEA/D are the choice of an appropriate scalarizing function and setting the values of main control parameters. This study suggests a weighted stress function method (WSFM) for fitness assignment in MOEA/D. WSFM establishes analogy between the stress-strain behavior of thermoplastic vulcanizates and scalarization of a multiobjective optimization problem. The experimental results suggest that the proposed approach is able to provide a faster convergence and a better performance of final approximation sets with respect to quality indicators when compared with traditional methods. The validity of the proposed approach is also demonstrated on engineering problems.This work has been supported by FCT - Fundação para a Ciência e Tecnologia in the scope of the project: PEst-OE/EEI/UI0319/2014.info:eu-repo/semantics/publishedVersio
    • …
    corecore