منابع مشابه
Continua of Minimum Capacity
1. Surfaces containing a given volume. In an endeavour to simplify a proof of Liapounoff [2], to the effect that in the problem of the forms of equilibrium of rotating liquids the sphere would be the only form for a liquid at rest, Poincaré [ l ] was led to the consideration of electric capacities of solids of given volume, and arrived at the result that among such bodies the sphere would have ...
متن کاملMinimum variance capacity identification
In the framework of multi-criteria decision making whose aggregation process is based on the Choquet integral, we present a maximum entropy like method enabling to determine, if it exists, the “least specific” capacity compatible with the initial preferences of the decision maker. The proposed approach consists in solving a strictly convex quadratic program whose objective function is equivalen...
متن کاملFinding minimum clique capacity
Let C be a clique of a graph G. The capacity of C is defined to be (|V (G) \ C|+ |D|)/2, where D is the set of vertices in V (G) \C that have both a neighbour and a non-neighbour in C. We give a polynomial-time algorithm to find the minimum clique capacity in a graph G. This problem arose as an open question in a study [1] of packing vertex-disjoint induced three-vertex paths in a graph with no...
متن کاملDynamic Load Carrying Capacity of Flexible Manipulators Using Finite Element Method and Pontryagin’s Minimum Principle
In this paper, finding Dynamic Load Carrying Capacity (DLCC) of flexible link manipulators in point to-point motion was formulated as an optimal control problem. The finite element method was employed for modelling and deriving the dynamic equations of the system. The study employed indirect solution of optimal control for system motion planning. Due to offline nature of the method, many diffic...
متن کاملCapacity inverse minimum cost flow problem
Given a directed graph G = (N,A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacity vector û for the arc set A such that a given feasible flow x̂ is optimal with respect to the modified capacities. Among all capacity vectors û satisfying this condition, we would like to find one with minimum ‖û− u‖ value....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1941
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1941-07541-5