Search results for "Linear programming"

showing 10 items of 137 documents

Multiple Objective Analysis of Input-Output Models for Emergency Management

1990

This paper shows how a visual, interactive, dynamic multiple objective linear programming decision support system can effectively be used for analyzing input-output models. We have applied our approach to studying the quantitative effects of economic or political crises to the Finnish economy. Examples of such crises are nuclear power plant accidents, trade embargoes, and international conflicts. An input-output model of the Finnish economy with 17 industries (sectors) is employed. Our system has been implemented on a microcomputer and is being used by the National Board of Economic Defense. Several typical case situations are discussed.

Input/outputDecision support systemEmergency managementOperations researchLinear programmingbusiness.industryInput–output modelEconomic sectorComputerApplications_COMPUTERSINOTHERSYSTEMSManagement Science and Operations ResearchComputer Science Applicationslaw.inventionlawMicrocomputerNuclear power plantEconomicsOperations managementbusinessOperations Research
researchProduct

Boolean-controlled systems via receding horizon and linear programing

2009

We consider dynamic systems controlled by boolean signals or decisions. We show that in a number of cases, the receding horizon formulation of the control problem can be solved via linear programing by relaxing the binary constraints on the control. The idea behind our approach is conceptually easy: a feasible control can be forced by imposing that the boolean signal is set to one at least one time over the horizon. We translate this idea into constraints on the controls and analyze the polyhedron of all feasible controls. We specialize the approach to the stabilizability of switched and impulsively controlled systems.

Inventory controlMathematical optimizationControl and OptimizationLinear programmingApplied MathematicsHorizonSIGNAL (programming language)Binary numberSet (abstract data type)PolyhedronControl and Systems EngineeringControl theoryHybrid systemSignal ProcessingImpulse control inventory control hybrid systemsMathematics
researchProduct

ROBUST CONTROL STRATEGIES FOR MULTI—INVENTORY SYSTEMS WITH AVERAGE FLOW CONSTRAINTS

2006

Abstract In this paper we consider multi—inventory systems in presence of uncertain demand. We assume that i) demand is unknown but bounded in an assigned compact set and ii) the control inputs (controlled flows) are subject to assigned constraints. Given a long—term average demand, we select a nominal flow that feeds such a demand. In this context, we are interested in a control strategy that meets at each time all possible current demands and achieves the nominal flow in the average. We provide necessary and sufficient conditions for such a strategy to exist and we characterize the set of achievable flows. Such conditions are based on linear programming and thus they are constructive. In …

Inventory controlMathematical optimizationManufacturing systemLinear programmingBounded disturbancesBounded disturbanceBounded disturbances; Inventory control; Linear programming; Manufacturing systems; Robust controlRobust controlContext (language use)General MedicineDynamic problemFlow (mathematics)Inventory control Robust control Bounded disturbances Manufacturing systems Linear programming.Control and Systems EngineeringControl theoryBounded functionLinear programmingSettore MAT/09 - Ricerca OperativaManufacturing systemsElectrical and Electronic EngineeringSpecial caseRobust controlMathematicsInventory control
researchProduct

A Numerical Method for the Analysis of Plane-Strain Forming Processes with Unilateral Constraints

1983

The Authors propose a numerical model for the solution of plane-strain forming processes, based on the linearization of the yield surface. This allows to employ the linear programming technique for the solution of the variational problem derived from the application of the upper-bound theorem. Such a model permits to take into account the unilateral constraints in a very simple way. Therefore it is well suited to solve a large class of problems, such as sheet forming, in which the unilateral constraints are often present.

Large classLinear programmingSimple (abstract algebra)Yield surfaceLinearizationMechanical EngineeringNumerical analysisMathematical analysisForming processesIndustrial and Manufacturing EngineeringMathematicsPlane stressCIRP Annals
researchProduct

Trunk Packing Revisited

2007

For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper two discretized approaches for the US standard SAE J1100 [10] are presented, which make use of different box sizes. An exact branch-and-bound algorithm for weighted independent sets on graphs is given, using the special structure of the SAE standard. Another branch-and-bound packing algorithm using linear programs is presented. With these algorithms axis-oriented packings of different box sizes in an arbitrary trunk geometry can be computed efficiently.

Linear programming relaxationCombinatoricsDiscrete mathematicsPacking problemsDiscretizationLinear programmingBranch and priceStructure (category theory)Approximation algorithmBranch and cutMathematics
researchProduct

Selectivity in Probabilistic Causality: Where Psychology Runs Into Quantum Physics

2011

Given a set of several inputs into a system (e.g., independent variables characterizing stimuli) and a set of several stochastically non-independent outputs (e.g., random variables describing different aspects of responses), how can one determine, for each of the outputs, which of the inputs it is influenced by? The problem has applications ranging from modeling pairwise comparisons to reconstructing mental processing architectures to conjoint testing. A necessary and sufficient condition for a given pattern of selective influences is provided by the Joint Distribution Criterion, according to which the problem of "what influences what" is equivalent to that of the existence of a joint distr…

Linear programming81P05 (Primary) 91E99 (Secondary)media_common.quotation_subjectFOS: Physical sciencesMathematics - Statistics TheoryQuantum entanglementStatistics Theory (math.ST)System of linear equations01 natural sciencesQuantitative Biology - Quantitative Methods050105 experimental psychologyCausality (physics)Joint probability distributionQuantum mechanics0103 physical sciencesFOS: Mathematics0501 psychology and cognitive sciences010306 general physicsSet (psychology)ta515General PsychologyQuantitative Methods (q-bio.QM)media_commonta113ta112Quantum PhysicsVariablesta114Applied Mathematicsta11105 social sciencesFOS: Biological sciencesPhysics - Data Analysis Statistics and ProbabilityQuantum Physics (quant-ph)Random variableData Analysis Statistics and Probability (physics.data-an)
researchProduct

Connected and Autonomous Vehicles cooperate with the pedestrian in industrial sites based on trajectory optimization and vehicle signalization system

2020

Connected and autonomous vehicles (CAV) is the development trend in the field of transportation systems. Recent studies show that the resources sharing between pedestrians and CAV is a big challenge. Considering traffic safety and efficiency at that sharing point not only requires a collision avoidance system but also more communicative behaviors of the CAV. More precisely, pedestrian needs to understand the intention of the incoming CAV whether it will cross first or not according to its speed profile. This paper uses the optimal trajectory control to provide CAV with a communicative behavior. A scenario where CAV and pedestrian cooperate together to cross a conflict zone is studied. A com…

Linear programmingComputer scienceControl (management)Real-time computingCollision avoidance systemTrajectory optimizationPedestrianVirtual realityOptimal controlField (computer science)2020 IEEE Intelligent Vehicles Symposium (IV)
researchProduct

A Linear Programming Method for Bounding Plastic Deformations

1988

A method for providing upper and lower bounds to plastic deformations is presented, which has the feature of being applicable both below and above the structure shakedown limit. The bounds provided are expressed in terms of some fictitious plastic strains obeying relaxed yielding laws, whose evaluation is made by means of a suitable LP-based algorithm.

Linear programmingFeature (computer vision)Bounding overwatchMathematical analysisStructure (category theory)GeometryLimit (mathematics)Upper and lower boundsMathematicsShakedown
researchProduct

Recent Developments in our Approach to Multiple-Criteria Decision Making

1984

Approximately ten years ago we began a study of multiple criteria decision making at the European Insti tute for Advanced Studies in Management in Brussels. The project started as a way of finding a multiple objective linear programming method that would work better than those tested by Wallenius (1975). We did a substantial amount of work on the problem and came up with such a method (Zionts and Wallenius, 1976). Wallenius’ (1975) thesis, one of the first outputs of that project, comprises a rather significant piece of research in the multiple criteria area. Since that time our work has continued. We have worked together on a great deal of it; some of it has involved students and other fac…

Linear programmingMultiple objectiveOperations researchWork (electrical)Computer scienceMultiple criteria
researchProduct

A contribution to the linear programming approach to joint cost allocation: Methodology and application

2009

Abstract The linear programming (LP) approach has been commonly proposed for joint cost allocation purposes. Within a LP framework, the allocation rules are based on a marginal analysis. Unfortunately, the additivity property which is required to completely allocate joint costs fails in presence of capacity, institutional or environmental constraints. In this paper, we first illustrate that the non allocated part can be interpreted as a type of producer’s surplus. Then, by using the information contained in the Simplex tableau we propose an original two-stage methodology based on the marginal costs and the production elasticity of input factors to achieve an additive cost allocation pattern…

Marginal costMathematical optimizationCost allocationInformation Systems and ManagementSimplexGeneral Computer ScienceLinear programmingIterative methodManagement Science and Operations Researchcomputer.software_genreIndustrial and Manufacturing EngineeringExpert systemJoint costSimplex algorithmModeling and SimulationcomputerMathematicsEuropean Journal of Operational Research
researchProduct