Displaying similar documents to “On gradient simplex methods for linear programs.”

A branch&bound algorithm for solving one-dimensional cutting stock problems exactly

Guntram Scheithauer, Johannes Terno (1995)

Applicationes Mathematicae

Similarity:

Many numerical computations reported in the literature show only a small difference between the optimal value of the one-dimensional cutting stock problem (1CSP) and that of the corresponding linear programming relaxation. Moreover, theoretical investigations have proven that this difference is smaller than 2 for a wide range of subproblems of the general 1CSP.

Beta-reduction as unification

A. Kfoury (1999)

Banach Center Publications

Similarity:

We define a new unification problem, which we call β-unification and which can be used to characterize the β-strong normalization of terms in the λ-calculus. We prove the undecidability of β-unification, its connection with the system of intersection types, and several of its basic properties.

Chance constrained bottleneck transportation problem with preference of routes

Yue Ge, Minghao Chen, Hiroaki Ishii (2012)

Kybernetika

Similarity:

This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination...

Dynamic approach to optimum synthesis of a four-bar mechanism using a swarm intelligence algorithm

Edgar A. Portilla-Flores, Maria B. Calva-Yáñez, Miguel G. Villarreal-Cervantes, Paola A. Niño Suárez, Gabriel Sepúlveda-Cervantes (2014)

Kybernetika

Similarity:

This paper presents a dynamic approach to the synthesis of a crank-rocker four-bar mechanism, that is obtained by an optimization problem and its solution using the swarm intelligence algorithm called Modified-Artificial Bee Colony (M-ABC). The proposed dynamic approach states a mono-objective dynamic optimization problem (MODOP), in order to obtain a set of optimal parameters of the system. In this MODOP, the kinematic and dynamic models of the whole system are consider as well as a...