Decentralized supply chain management is found to be significantly relevant in today’s competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain parameters like demand and price of the final produc...

In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...

We present a new solver for non-convex trajectory optimization problems that is specialized robotics applications. CALIPSO, or the Conic Augmented Lagrangian Interior-Point SOlver, combines several strategies constrained numerical to natively handle second-order cones and complementarity constraints. It reliably solves challenging motion planning include contact-implicit formulations of impacts...

This research presents a novel design approach to achieve an optimal structure established upon multiple objective functions by simultaneous utilization of the Enhanced Time Evolutionary Optimization method and Fuzzy Logic (FLETEO). For this purpose, at first, modeling of the structure design problem in this space is performed using fuzzy logic concepts. Thus, a new problem creates with functio...

The modern theory of condition measures for convex optimization problems was initially developed for convex problems in the following conic format: (CPd) : z∗ := minx{cx | Ax− b ∈ CY , x ∈ CX}, and several aspects of the theory have now been extended to handle non-conic formats as well. In this theory, the (Renegar-) condition measure C(d) for (CPd) has been shown to be connected to bounds on a...

This paper studies several classes of nonconvex optimization problems defined over convex cones, establishing connections between them and demonstrating that they can be equivalently formulated as convex completely positive programs. The problems being studied include: a quadratically constrained quadratic program (QCQP), a quadratic program with complementarity constraints (QPCC), and rank con...

Facial reduction heuristics are developed in the interest of added performance and reliability in methods for mixed-integer conic optimization. Specifically, the process of branch-and-bound is shown to spawn subproblems for which the conic relaxations are difficult to solve, and the objective bounds of linear relaxations are arbitrarily weak. While facial reduction algorithms already exist to d...

in this paper, the portfolio selection problem is considered, where fuzziness and randomness appear simultaneously in optimization process. since return and dividend play an important role in such problems, a new model is developed in a mixed environment by incorporating fuzzy random variable as multi-objective nonlinear model. then a novel interactive approach is proposed to determine the pref...