Bilevel linear programming (Q2368110)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Bilevel linear programming	scientific article

Statements

scholarly article

0 references

Bilevel linear programming (English)

0 references

0 references

Computers \& Operations Research

0 references

publication date

23 August 1993

0 references

zbMATH Keywords

bilevel linear programming

0 references

NP-hardness

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0305-0548(93)90013-9

0 references

0 references

0 references

On two-level optimization

0 references

Two-Level Linear Programming

0 references

Optimality conditions for the bilevel programming problem

0 references

Convex two-level optimization

0 references

Algorithms for solving the mixed integer two-level linear programming problem

0 references

A linear max—min problem

0 references

Bilinear programming: An exact algorithm

0 references

Decomposition Principle for Linear Programs

0 references

Nested Decomposition and Multi-Stage Linear Programs

0 references

0 references

A Representation and Economic Interpretation of a Two-Level Programming Problem

0 references

Dynamic noncooperative game theory

0 references

On the Stackelberg strategy in nonzero-sum games

0 references

Closed-loop Stackelberg strategies with applications in the optimal control of multilevel systems

0 references

Nonclassical control problems and Stackelberg games

0 references

Closed-loop Stackelberg solution to a multistage linear-quadratic game

0 references

Derivation of necessary and sufficient conditions for single-stage Stackelberg games via the inducible region concept

0 references

A revised simplex method for linear multiple objective programs

0 references

0 references

A note on a linear bilevel programming algorithm based on bicriteria programming

0 references

Computational Difficulties of Bilevel Linear Programming

0 references

Mathematical Programs with Optimization Problems in the Constraints

0 references

Defense Applications of Mathematical Programs with Optimization Problems in the Constraints

0 references

Technical Note—A Method for Solving Mathematical Programs with Nonlinear Programs in the Constraints

0 references

Allocation of resources to offensive strategic weapon systems

0 references

A nonconvex max-min problem

0 references

Multi-level programming and conflict resolution

0 references

Network design problem with congestion effects: A case of bilevel programming

0 references

Construction of a real-world bilevel linear programming model of the highway network design problem

0 references

A Branch and Bound Algorithm for the Bilevel Programming Problem

0 references

The Simplex Method for Quadratic Programming

0 references

An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem

0 references

A linear bilevel programming algorithm based on bicriteria programming

0 references

0 references

An experimental investigation of enumerative methods for the linear complementarity problem

0 references

An implicit enumeration procedure for the general linear complementarity problem

0 references

A solution method for the linear static Stackelberg problem using penalty functions

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0305-0548(93)90013-9

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2368110

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2368110&oldid=34108742"