๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Discrete allocation of a linear resource according to a sum-of-products objective

โœ Scribed by K.M. Mjelde


Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
237 KB
Volume
3
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A model to optimize project resource all
โœ Peter D. Konstantinidis ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 698 KB

This paper examines a scheduling method to improve productivity in resource-constrained projects. When resources are nonrenewable the duration of each activity has only one value. Optimal solutions are derived through criticalism of groups of activities using the same resource so as to eliminate int

Minimizing sums and products of linear f
โœ Hiroshi Konno; Hajime Yamashita ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 108 KB ๐Ÿ‘ 1 views

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametr

Optimal resource allocation to vegetativ
โœ Satoki Sakai ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 616 KB

An optimal-resource allocation model is developed for ramets (daughter plants), rhizomes (or other horizontal stems, such as stolons) and seeds for plants growing in a spatially varying environment. It is assumed that a parent may elongate rhizomes, and that if a rhizome encounters a patch with high

A linear state space approach to a class
โœ Dieter Franke ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 235 KB

The paper addresses finite state machines which provide suitable mathematical models for discrete-event dynamical systems. This type of systems is considered to be one of the challenges in the present discussion of non-classical control problems. Boolean automata are of special interest. Different f