Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Minimax planning problems with linear constraints and methods of their solution

From MaRDI portal
Publication:1163470
Jump to:navigation, search

zbMath0483.90060MaRDI QIDQ1163470

A. S. Belen'kij

Publication date: 1981

Published in: Automation and Remote Control (Search for Journal in Brave)


zbMATH Keywords

linear constraintssolution methodslinear algebraic modelsminimax planning problems


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Linear programming (90C05) Production models (90B30)


Related Items

A 2-person game on a polyhedral set of connected strategies ⋮ A noncooperative game on polyhedral sets ⋮ Optimization of Portfolio Compositions for Small and Medium Price-Taking Traders ⋮ An Approach to Forming and Managing a Portfolio of Financial Securities by Small and Medium Price-Taking Traders in a Stock Exchange ⋮ Analyzing the potential of a firm: an operations research approach. ⋮ Two noncooperative games between a coalition and its surrounding in a class of \(n\)-person games with constant sum ⋮ Competitive strategies of U.S. presidential candidates in election campaigns



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1163470&oldid=13233459"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki