The Mixed Integer Linear Bilevel Programming Problem

A two-person, noncooperative game in which the players move in sequence can be modeled as a bilevel optimization problem. In this paper, we examine the case where each player tries to maximize the individual objective function over a jointly constrained polyhedron. The decision variables are various...

Full description

Saved in:

Bibliographic Details
Published in:	Operations research Vol. 38; no. 5; pp. 911 - 921
Main Authors:	Moore, James T, Bard, Jonathan F
Format:	Journal Article
Language:	English
Published:	Linthicum, MD INFORMS 01.09.1990 Operations Research Society of America Institute for Operations Research and the Management Sciences
Subjects:	Algorithms Applied sciences Bards Computer programming Constraints Exact sciences and technology Game theory games: noncooperative Heuristic Heuristics Incumbents Index sets Integer programming integer: branch-and-bound algorithms Integers Integrality Mathematical models Mathematical programming Mathematical vectors Objective functions Operational research and scientific management Operational research. Management science Operations research Optimal solutions programming Statistical analysis Studies Theory Integer programming Experimental result Mixed programming Non cooperative game Branch and bound method Heuristic method Two person game Linear programming Algorithm Mathematical programming
ISSN:	0030-364X, 1526-5463
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!