An explicit solution to the multi-level programming problem

@article{Bard1982AnES,
  title={An explicit solution to the multi-level programming problem},
  author={Jonathan F. Bard and James E. Falk},
  journal={Computers & OR},
  year={1982},
  volume={9},
  pages={77-100}
}
The multi-level programming problem is defined as an n-person nonzero-sum game with perfect information in which the players move sequentially. The bi-level linear case is addressed in detail. Solutions are obtained by recasting this problem as a standard mathematical probram and appealing to its implicitly separable structure. The reformulated optimization problem is linear save for a ~omplementarity constraint of the form (a g) = 0. This constraint is decomposed in a manner that permits us to… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 147 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Miercort, A strategic weapons exchange allocation model

  • J. Bracken, F.A.J.E. Falk
  • Ops Res
  • 1977
Highly Influential
3 Excerpts

An algorithm for finding all vertices of a convex polyhedral set

  • J. F. Bard
  • SIAM . I
  • 1979

The application of formulas for nonlinear factorable programming to the solution of implicitly defined optimization problems, D.SC

  • A. de Silva
  • 1978

Characterization of linear complementarity problems as linear programs, Computer Sciences

  • L. Mangasarian
  • Technical Report No. 271,
  • 1976

Grotte, Program MOGG-A code for solving separable nonconvex optimization problems P-1318, The Institute for Defense Analysis

  • J H.
  • 1976

Infinitely constrained optimization problems

  • J. W. Blankenship, J. E. Falk
  • J . Optim . Theory Applies
  • 1976

Similar Papers

Loading similar papers…