Quaterionic Construction of the W(F_4) Polytopes with Their Dual Polytopes and Branching under the Subgroups B(B_4) and W(B_3)*W(A_1)

4-dimensional $F_{4}$ polytopes and their dual polytopes have been constructed as the orbits of the Coxeter-Weyl group $W(F_{4})$ where the group elements and the vertices of the polytopes are represented by quaternions. Branchings of an arbitrary \textbf{$W(F_{4})$} orbit under the Coxeter groups $W(B_{4}$ and $W(B_{3}) \times W(A_{1})$ have been presented. The role of group theoretical technique and the use of quaternions have been emphasizedComment: 26 pages, 10 figure

Quasi Regular Polyhedra and Their Duals with Coxeter Symmetries Represented by Quaternions I

In two series of papers we construct quasi regular polyhedra and their duals which are similar to the Catalan solids. The group elements as well as the vertices of the polyhedra are represented in terms of quaternions. In the present paper we discuss the quasi regular polygons (isogonal and isotoxal polygons) using 2D Coxeter diagrams. In particular, we discuss the isogonal hexagons, octagons and decagons derived from 2D Coxeter diagrams and obtain aperiodic tilings of the plane with the isogonal polygons along with the regular polygons. We point out that one type of aperiodic tiling of the plane with regular and isogonal hexagons may represent a state of graphene where one carbon atom is bound to three neighboring carbons with two single bonds and one double bond. We also show how the plane can be tiled with two tiles; one of them is the isotoxal polygon, dual of the isogonal polygon. A general method is employed for the constructions of the quasi regular prisms and their duals in 3D dimensions with the use of 3D Coxeter diagrams.Comment: 22 pages, 16 figure

Explicit Breaking of SO(3) with Higgs Fields in the Representations L =2 and L =3

A gauged SO(3) symmetry is broken into its little groups of the representations L=2 and L=3. Explicit Higgs potentials leading to the spontaneous symmetry breaking are constructed. The masses of the gauge bosons and Higgs particles are calculated in terms of the renormalizable potentials. Emergence of Goldstone bosons arising from the absence of certain potential terms is also discussed. Analogous structures between the cosmic strings and disclinations of liquid crystals are noted

A hierarchical solution approach for a multicommodity distribution problem under a special cost structure

Cataloged from PDF version of article.Motivated by the spare parts distribution system of a major automotive manufacturer in Turkey, we consider a multicommodity distribution problem from a central depot to a number of geographically dispersed demand points. The distribution of the items is carried out by a set of identical vehicles. The demand of each demand point can be satisfied by several vehicles and a single vehicle is allowed to serve multiple demand points. For a given vehicle, the cost structure is dictated by the farthest demand point from the depot among all demand points served by that vehicle. The objective is to satisfy the demand of each demand point with the minimum total distribution cost. We present a novel integer linear programming formulation of the problem as a variant of the network design problem. The resulting optimization problem becomes computationally infeasible for real-life problems due to the large number of integer variables. In an attempt to circumvent this disadvantage of using the direct formulation especially for larger problems, we propose a Hierarchical Approach that is aimed at solving the problem in two stages using partial demand aggregation followed by a disaggregation scheme. We study the properties of the solution returned by the Hierarchical Approach. We perform computational studies on a data set adapted from a major automotive manufacturer in Turkey. Our results reveal that the Hierarchical Approach significantly outperforms the direct formulation approach in terms of both the running time and the quality of the resulting solution especially on large instances. © 2012 Elsevier Ltd. All rights reserved

Quasi-exact-solution of the Generalized Exe Jahn-Teller Hamiltonian

We consider the solution of a generalized Exe Jahn-Teller Hamiltonian in the context of quasi-exactly solvable spectral problems. This Hamiltonian is expressed in terms of the generators of the osp(2,2) Lie algebra. Analytical expressions are obtained for eigenstates and eigenvalues. The solutions lead to a number of earlier results discussed in the literature. However, our approach renders a new understanding of ``exact isolated'' solutions

Lot sizing with piecewise concave production costs

Cataloged from PDF version of article.We study the lot-sizing problem with piecewise concave production costs and concave holding costs. This problem is a generalization of the lot-sizing problem with quantity discounts, minimum order quantities, capacities, overloading, subcontracting or a combination of these. We develop a dynamic programming algorithm to solve this problem and answer an open question in the literature: we show that the problem is polynomially solvable when the breakpoints of the production cost function are time invariant and the number of breakpoints is fixed. For the special cases with capacities and subcontracting, the time complexity of our algorithm is as good as the complexity of algorithms available in the literature. We report the results of a computational experiment where the dynamic programming is able to solve instances that are hard for a mixed-integer programming solver. We enhance the mixed-integer programming formulation with valid inequalities based on mixing sets and use a cut-and-branch algorithm to compute better bounds. We propose a state space reduction–based heuristic algorithm for large instances and show that the solutions are of good quality by comparing them with the bounds obtained from the cut-and-branch

Stochastic lot sizing problem with controllable processing times

Cataloged from PDF version of article.In this study, we consider the stochastic capacitated lot sizing problem with controllable processing times where processing times can be reduced in return for extra compression cost. We assume that the compression cost function is a convex function as it may reflect increasing marginal costs of larger reductions and may be more appropriate when the resource life, energy consumption or carbon emission are taken into consideration. We consider this problem under static uncertainty strategy and α service level constraints. We first introduce a nonlinear mixed integer programming formulation of the problem, and use the recent advances in second order cone programming to strengthen it and then solve by a commercial solver. Our computational experiments show that taking the processing times as constant may lead to more costly production plans, and the value of controllable processing times becomes more evident for a stochastic environment with a limited capacity. Moreover, we observe that controllable processing times increase the solution flexibility and provide a better solution in most of the problem instances, although the largest improvements are obtained when setup costs are high and the system has medium sized capacities

A hierarchical solution approach for a multicommodity distribution problem under a special cost structure

Motivated by the spare parts distribution system of a major automotive manufacturer in Turkey, we consider a multicommodity distribution problem from a central depot to a number of geographically dispersed demand points. The distribution of the items is carried out by a set of identical vehicles. The demand of each demand point can be satisfied by several vehicles and a single vehicle is allowed to serve multiple demand points. For a given vehicle, the cost structure is dictated by the farthest demand point from the depot among all demand points served by that vehicle. The objective is to satisfy the demand of each demand point with the minimum total distribution cost. We present a novel integer linear programming formulation of the problem as a variant of the network design problem. The resulting optimization problem becomes computationally infeasible for real-life problems due to the large number of integer variables. In an attempt to circumvent this disadvantage of using the direct formulation especially for larger problems, we propose a Hierarchical Approach that is aimed at solving the problem in two stages using partial demand aggregation followed by a disaggregation scheme. We study the properties of the solution returned by the Hierarchical Approach. We perform computational studies on a data set adapted from a major automotive manufacturer in Turkey. Our results reveal that the Hierarchical Approach significantly outperforms the direct formulation approach in terms of both the running time and the quality of the resulting solution especially on large instances. © 2012 Elsevier Ltd. All rights reserved

Lot sizing with piecewise concave production costs

We study the lot-sizing problem with piecewise concave production costs and concave holding costs. This problem is a generalization of the lot-sizing problem with quantity discounts, minimum order quantities, capacities, overloading, subcontracting or a combination of these. We develop a dynamic programming algorithm to solve this problem and answer an open question in the literature: we show that the problem is polynomially solvable when the breakpoints of the production cost function are time invariant and the number of breakpoints is fixed. For the special cases with capacities and subcontracting, the time complexity of our algorithm is as good as the complexity of algorithms available in the literature. We report the results of a computational experiment where the dynamic programming is able to solve instances that are hard for a mixed-integer programming solver. We enhance the mixed-integer programming formulation with valid inequalities based on mixing sets and use a cut-and-branch algorithm to compute better bounds. We propose a state space reduction-based heuristic algorithm for large instances and show that the solutions are of good quality by comparing them with the bounds obtained from the cut-and-branch. © 2014 INFORMS