𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimality conditions for the bilevel programming problem

✍ Scribed by Jonathan F. Bard

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
697 KB
Volume
31
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for the discrete bilevel pr
An algorithm for the discrete bilevel programming problem
✍ Jonathan F. Bard; James T. Moore πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 915 KB

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting

A fuzzy goal programming procedure for s
A fuzzy goal programming procedure for solving quadratic bilevel programming problems
✍ Bijay Baran Pal; Bhola Nath Moitra πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 93 KB

This article presents a fuzzy goal programming (FGP) procedure for solving quadratic bilevel programming problems (QBLPP). In the proposed approach, the membership functions for the defined fuzzy objective goals of the decision makers (DM) at both the levels are developed first. Then, a quadratic pr

Optimality conditions for convex semi-in
Optimality conditions for convex semi-infinite programming problems
✍ A. Ben-Tal; L. Kerzner; S. Zlobec πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 923 KB

## Abstract This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn‐Tucker theories