Search-hide games on trees

Article Abstract:

A search-hide game on trees involving on-site inspection problems and stationary undeclared objects is analyzed. The hider chooses one of m vertices of the tree for hiding objects permanently, while the inspector searches for the hidden objects but is subject to limitations. The game's payoff centers on the objects' detection. It is shown that the game can be expressed in terms of a fractional covering problem and its dual problem, which are solved through the column generation technique.

Game theory, Lagrangian functions

---

A linear approximation method for solving a special class of the chance constrained programming problem

Article Abstract:

A linear approximation model for solving the chance constrained programming problem is evaluated. The model integrates linear functions as bounds for the stochastic programming model's nonlinear objective function. A solution is then derived from nondominated solution points from the proposed bicriterion linear programming (BLP) problem. It is shown that the technique requires minimal information from a decision maker and allows a simple construction of the BLP.

Optimization theory, Mathematical programming

---

Linear programming model for finding optimal roadway grades that minimize earthwork cost

Article Abstract:

The linear programming model guarantees global optimality by combining the roadway grade selection stage and the earthwork transportation stage in a single linear programming problem. The section is considered as a point in the x-y plane representing a fixed width of a section. Only the height is allowed to vary in the model. As the grade lines change, only the height of a section changes, resulting in a linear cost component in the objective function.

Research, Methods, Resource allocation, Cost control

Similar abstracts:

• Abstracts: Three approximation algorithms for solving the generalized segregated storage problem. The interactive analysis of the multicriteria shortest path problem by the reference point method
• Abstracts: An approximation algorithm for solving unconstrained two-dimensional knapsack problems. Tree knapsack approaches for local access network design
• Abstracts: Strategic facility location: a review. Fitting rectilinear polygonal curves to a set of points in the plane. Competitive location with rectilinear distances
• Abstracts: Dynamic control charts for finite production runs. Optimal stopping problem with recall cost. A submodular approach to discrete dynamic programming

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.