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

A note on the optimality conditions for the bilevel programming problem

โœ Scribed by P. A. Clark; A. W. Westerberg

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
204 KB
Volume
35
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on the use of goal programming fo
A note on the use of goal programming for the multiplicative AHP
โœ R. RAMANATHAN ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 311 KB ๐Ÿ‘ 2 views

The main aim of this paper is to identify the opportunities of utilizing goal programming (GP) in the multiplicative analytic hierarchy process (MAHP). It starts with the issue of weight derivation from judgemental matrices. The use of GP for the weight derivation problem is not new, but GP is viewe

A note on the bottleneck graph partition
A note on the bottleneck graph partition problem
โœ Klinz, Bettina; Woeginger, Gerhard J. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 47 KB ๐Ÿ‘ 1 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit