SearcharxivSearch

arXiv · 1510.04097

Identification of target system operations. 1. Determination of the time of the actual completion of the target operation

Abstract

It was found in the paper that the time frames of the studied system operation depend on the research objective. In cases when it comes to problems, related to the physical movement of the input and output products, limits of the study are defined by the time of the beginning of the movement of the first input product of the operation and ends with the time of issue of the last output product of the operation by the system. Time of completion of the physical movement of products is defined in the paper as the time of the physical completion of the operation. Since the purpose of any operation is to increase the value of the output products in relation to the value of input products of the operation, in cases when there is a problem of investigating the target operation, the time of completion of the target operation is determined not by the physics of the process, but its cybernetics. Since for the time of the operation, conversion processes link input products in time, the added value of output products is intended to compensate in time the costs of temporary binding of input products that initially have their value. The time, when the added value of output products of the target operation compensates the value of tight input products for the time of the operation, is defined in the paper as the time of the actual completion of the target operation. A system of notations to describe the system processes of target operations was proposed. The expressions for the numerical and analytical determination of the time of actual completion of the target operation were obtained. A link to the resource, with examples of calculations of the time of the actual completion of the operation with the use of numerical methods and analytic expressions, obtained in the paper was given.

Explore related subjects

Keep this discovery

BibTeXRIS

Igor Lutsenko. 2015-10-14. Identification of target system operations. 1. Determination of the time of the actual completion of the target operation. https://doi.org/10.15587/1729-4061.2014.28040

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC