The fuzzy primal simplex method [15] and the fuzzy dual simplex method [17] have been proposed to solve a kind of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers. The fuzzy simplex method starts with a primal fuzzy basic feasible solution (FBFS) for FLP problem and moves to an optimal basis by walking truth sequence of exception of the optimal basis obtaine...

The adjoint solution has found many uses in computational simulations where the quantities of interest are the functionals of the solution, including design optimization, error estimation, and control. In those applications where both the solution and the adjoint are desired, the conventional approach is to apply iterative methods to solve the primal and dual problems separately. However, we sh...

cosmo-theological argument is one of the theological arguments for [proving] the existence of god, which has been mooted since long ago and has recently been recognized in the theo-philosophical tradition of the west and become famous as theological argument. while examining the viewpoints related to the appearance of the world, particularly the big bang theory, this article undertakes to analy...

In this paper, we define a new, special second order cone as type-$k$ cone. We focus on the case of $k=2$, which can be viewed SOCO with an additional {\em complicating variable}. For new problem, develop necessary prerequisites, based previous work for traditional SOCO. then primal-dual interior point algorithm solving type-2 conic optimization (SOCO) family kernel functions suitable finally d...

We study convex Constrained Markov Decision Processes (CMDPs) in which the objective is concave and constraints are state-action occupancy measure. propose a policy-based primal-dual algorithm that updates primal variable via policy gradient ascent dual projected sub-gradient descent. Despite loss of additivity structure nonconvex nature, we establish global convergence proposed by leveraging h...

In this article, we present a parallelized primal-dual algorithm for solving constrained convex optimization problems. The is “block-based,” in which vectors of primal and dual variables are partitioned into blocks, each updated only by single processor. We consider four behaviors that could be asynchronous: 1) updates to variables; 2) 3) communications 4) variables. show any amount asynchrony ...

A finite algebra is called automorphism-primal if its clone of term operations coincides with all operations that preserve its automorphisms. We prove that the variety generated by an automorphism-primal algebra is verbose, that is, on every member algebra, every fully invariant congruence is verbal. In [2] we discussed the notions of verbal and fully invariant congruences and examined the rela...

We present a version of GMI (Gomory mixed-integer) cuts in a way so that they are derived with respect to a “dual form” mixed-integer optimization problem and applied on the standard-form primal side as columns, using the primal simplex algorithm. This follows the general scheme of He and Lee, who did the case of Gomory pure-integer cuts. Our input mixed-integer problem is not in standard form,...