Month: May 2022

Integral Global Optimality Conditions and an Algorithm for Multiobjective Problems

  • Everton Silva
  • Elizabeth Wegner Karas
  • Lucelina Santos
    • Categories Multi-Criteria Optimization, Nonlinear Optimization, Nonsmooth Optimization Tags , , , ,

    In this work, we propose integral global optimality conditions for multiobjective problems not necessarily differentiable. The integral characterization, already known for single objective problems, are extended to multiobjective problems by weighted sum and Chebyshev weighted scalarizations. Using this last scalarization, we propose an algorithm for obtaining an approximation of the weak Pareto front whose effectiveness … Read more

    Distributionally Robust Inventory Management with Advance Purchase Contracts

  • Yilin Xue
  • Yongzhen Li
  • Napat Rujeerapaiboon
    • Categories Linear, Cone and Semidefinite Programming, Robust Optimization, Supply Chain Management Tags , ,

    Motivated by the worldwide Covid-19 vaccine procurement, we study an inventory problem with an advance purchase contract which requires all ordering decisions to be committed at once. In reality, not only the demand is uncertain, but its distribution can also be ambiguous. Hence, we assume that only the mean and the variance are known and … Read more

    Identifiability, the KL property in metric spaces, and subgradient curves

  • Adrian Lewis
  • Tonghua Tian
    • Categories Nonsmooth Optimization Tags , , , , ,

    Identifiability, and the closely related idea of partial smoothness, unify classical active set methods and more general notions of solution structure. Diverse optimization algorithms generate iterates in discrete time that are eventually confined to identifiable sets. We present two fresh perspectives on identifiability. The first distills the notion to a simple metric property, applicable not … Read more

    Capacity planning with uncertain endogenous technology learning

  • Tushar Rathi
  • Qi Zhang
    • Categories Applications - OR and Management Sciences, Stochastic Programming Tags , , , ,

    Optimal capacity expansion requires complex decision-making, often influenced by technology learning, which represents the reduction in expansion cost due to factors such as cumulative installed capacity. However, having perfect foresight over the technology cost reduction is highly unlikely. In this work, we develop a multistage stochastic programming framework to model capacity planning problems with endogenous … Read more

    BilevelJuMP.jl: Modeling and Solving Bilevel Optimization in Julia

  • Joaquim Dias Garcia
  • Guilherme Bodin
  • Alexandre Street
    • Categories Complementarity and Variational Inequalities, Modeling Languages and Systems, Optimization Software and Modeling Systems Tags , , , ,

    In this paper we present BilevelJuMP, a new Julia package to support bilevel optimization within the JuMP framework. The package is a Julia library that enables the user to describe both upper and lower-level optimization problems using the JuMP algebraic syntax. Due to the generality and flexibility our library inherits from JuMP’s syntax, our package … Read more

    Duality in convex stochastic optimization

  • Teemu Pennanen
  • Ari-Pekka Perkkiö
    • Categories Convex Optimization, Infinite Dimensional Optimization, Stochastic Programming Tags , , ,

    This paper studies duality and optimality conditions in general convex stochastic optimization problems introduced by Rockafellar and Wets in \cite{rw76}. We derive an explicit dual problem in terms of two dual variables, one of which is the shadow price of information while the other one gives the marginal cost of a perturbation much like in … Read more

    Small polygons with large area

  • Christian Bingane
  • Michael J. Mossinghoff
    • Categories Constrained Nonlinear Optimization, Global Optimization Applications Tags , ,

    A polygon is {\em small} if it has unit diameter. The maximal area of a small polygon with a fixed number of sides $n$ is not known when $n$ is even and $n\geq14$. We determine an improved lower bound for the maximal area of a small $n$-gon for this case. The improvement affects the $1/n^3$ … Read more

    Efficient Use of Quantum Linear System Algorithms in Interior Point Methods for Linear Optimization

  • Mohammadhossein Mohammadisiahroudi
  • Ramin Fakhimi
  • Tamás Terlaky
    • Categories Linear Programming Tags , , ,

    Quantum computing has attracted significant interest in the optimization community because it potentially can solve classes of optimization problems faster than conventional supercomputers. Several researchers proposed quantum computing methods, especially Quantum Interior Point Methods (QIPMs), to solve convex optimization problems, such as Linear Optimization, Semidefinite Optimization, and Second-order Cone Optimization problems. Most of them have … Read more