Flexible linear programs with a restricted overall flexibility level
نویسندگان
چکیده
منابع مشابه
Flexible linear programs with a restricted overall flexibility level
It is usually supposed that tolerance levels are determined by the decision maker a priori in flexible linear programming (FLP) problems. In this paper we shall suppose that the decision maker does not care about the particular values of tolerance levels, but he wishes to keep their sum below a predetermined level, which we call his overall flexibility level. We also suppose that his overall fl...
متن کاملObserving Parallel Programs at a Flexible Level of Granularity
A new method of carrying out hybrid monitoring for the observation of parallel programs is presented. A comprehensive set of interacting tools, the PEPP-ZM4-SIMPLE environment, is briefly discussed. These tools support modelling, measurement preparation, monitoring, event trace analysis and assist in result interpretation. The emphasis of the paper is on the flexibility of the method with respe...
متن کاملOn Passive Quadrupedal Bounding with Flexible Linear Torso
This paper studies the effect of flexible linear torso on the dynamics of passive quadruped bounding. A reduced-order passive and conservative model with linear flexible torso and springy legs is introduced. The model features extensive spine deformation during high-speed bounding, resembling those observed in a cheetah. Fixed points corresponding to cyclic bounding motions are found and calcul...
متن کاملA Two-level Algorithm for Two-stage Linear Programs
An algorithm for solving 2-stage linear programs. especially useful for 11 program arising from a nested multi·level approach to multi-period planning [3] is presented. The proposed algorithm is of a two·level scheme and similar to Beale's method [4], but the procedure is more systematic and simpler. Computational experience is reported for a series of small test problems. The results show that...
متن کاملA penalty function approach for solving bi-level linear programs
The paper presents an approach to bi-level programming using a duality gap-penalty function format. A new exact penalty function exists for obtaining a global optimal solution for the linear case, and an algorithm is given for doing this, making use of some new theoretical properties. For each penalty parameter value, the central optimisation problem is one of maximising a convex function over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fuzzy Sets and Systems
سال: 2002
ISSN: 0165-0114
DOI: 10.1016/s0165-0114(01)00126-9