The following pages link to A. S. Belen'kij (Q755423):
Displaying 35 items.
- (Q215388) (redirect page) (← links)
- A Boolean programming problem of choosing an optimal portfolio of projects and optimal schedules for them by reinvesting within the portfolio the profit from project implementation (Q452908) (← links)
- A planning problem in the class of linear models (Q755424) (← links)
- Calculating the minimal fraction of the popular vote to win the U.S. presidency in the electoral college (Q815268) (← links)
- Scheduling models and methods in optimal freight transportation planning (Q913646) (← links)
- A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections (Q1007645) (← links)
- A mathematical model for estimating the potential margin of state undecided voters for a candidate in a US federal election (Q1029173) (← links)
- Min-max problems with monotone functions on polyhedral sets (Q1050607) (← links)
- Minimization of a monotonic function on a polyhedral set (Q1051560) (← links)
- One nonlinear planning problem (Q1137506) (← links)
- Minimax problem with linear constraints (Q1145633) (← links)
- Finding saddle points on convex polyhedra in minimax optimization problems with linear constraints (Q1149382) (← links)
- Minimax planning problems with linear constraints and methods of their solution (Q1163470) (← links)
- Operations research in transportation systems. Ideas and schemes of optimization methods for strategic planning and operations management (Q1271432) (← links)
- A 3-person game on polyhedral sets (Q1334689) (← links)
- A 2-person game on a polyhedral set of connected strategies (Q1356874) (← links)
- A noncooperative game on polyhedral sets (Q1368829) (← links)
- Optimization of planning an advertising campaign of goods and services. (Q1410991) (← links)
- Analyzing the potential of a firm: an operations research approach. (Q1410992) (← links)
- Cooperative games of choosing partners and forming coalitions in the marketplace. (Q1411007) (← links)
- Two noncooperative games between a coalition and its surrounding in a class of \(n\)-person games with constant sum (Q1431864) (← links)
- Choosing a preferable strategy by the surrounding of a coalition in \(n\)-person games (Q1431865) (← links)
- An antagonistic game on polyhedral sets (Q1820070) (← links)
- Calculating the minimal number of homogeneous objects to represent a plurality in a heterogeneous system of objects (Q1827291) (← links)
- An elementary analysis of some mathematical concepts employed in and relations associated with amendment 12 of the U.S. constitution (Q1827292) (← links)
- Search for min-max of two monotone functions in polyhedral set (Q1838704) (← links)
- From the editor: Systems studies of voting systems and elections (Q2389760) (← links)
- A modified ``winner-take-all'' rule for awarding state electoral votes in US presidential elections and a game model for its analysis (Q2389763) (← links)
- The continuity of two functions associated with a maximin problem with connected variables (Q2470329) (← links)
- Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables (Q2470333) (← links)
- Estimating the size of the calling population in finite-source election queues by bilinear programming techniques (Q2473232) (← links)
- Two rules of a sealed ceiling bid and their analysis by mathematical programming techniques (Q2477237) (← links)
- Competitive strategies of U.S. presidential candidates in election campaigns (Q2485419) (← links)
- Understanding the Fundamentals of the U.S. Presidential Election System (Q2900715) (← links)
- Optimization of Portfolio Compositions for Small and Medium Price-Taking Traders (Q2957704) (← links)
