Search results for "lower bound"

showing 10 items of 269 documents

Interactive Method NIMBUS for Nondifferentiable Multiobjective Optimization Problems

1997

An interactive method, NIMBUS, for nondifferentiable multiobjective optimization problems is introduced. The method is capable of handling several nonconvex locally Lipschitzian objective functions subject to nonlinear (possibly nondifferentiable) constraints. The idea of NIMBUS is that the decision maker can easily indicate what kind of improvements are desired and what kind of impairments are tolerable at the point considered. The decision maker is asked to classify the objective functions into five different classes: those to be improved, those to be improved down to some aspiration level, those to be accepted as they are, those to be impaired till some upper bound, and those allowed to …

Mathematical optimizationNonlinear systemMultiobjective optimization problemComputer sciencePoint (geometry)Aspiration levelDecision makerUpper and lower boundsMulti-objective optimization
researchProduct

Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem

2012

This paper presents the first full-fledged branch-and-price (bap) algorithm for the capacitated arc-routing problem (CARP). Prior exact solution techniques either rely on cutting planes or the transformation of the CARP into a node-routing problem. The drawbacks are either models with inherent symmetry, dense underlying networks, or a formulation where edge flows in a potential solution do not allow the reconstruction of unique CARP tours. The proposed algorithm circumvents all these drawbacks by taking the beneficial ingredients from existing CARP methods and combining them in a new way. The first step is the solution of the one-index formulation of the CARP in order to produce strong cut…

Mathematical optimizationbiologyComputer scienceBranch and priceFunction (mathematics)Management Science and Operations Researchbiology.organism_classificationUpper and lower boundsComputer Science ApplicationsTransformation (function)Vehicle routing problemCarpArc routingAlgorithmInteger programmingOperations Research
researchProduct

Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier

2019

Abstract The vehicle-routing problem with private fleet and common carrier (VRPPC) extends the capacitated VRP by considering the option of outsourcing customers to subcontractors at a customer-dependent cost instead of serving them with the private fleet. The VRPPC has important applications in small package shipping and manufacturing, but despite its relevance, no exact solution approach has been introduced so far. We propose a branch-price-and-cut algorithm that is able to solve small to medium-sized instances and provides tight lower bounds for larger instances from the literature. In addition, we develop a large neighborhood search that shows a decent solution quality and competitive r…

Mathematical optimizationbusiness.industryApplied Mathematicsmedia_common.quotation_subject0211 other engineering and technologies021107 urban & regional planning0102 computer and information sciences02 engineering and technology01 natural sciencesUpper and lower boundsOutsourcing010201 computation theory & mathematicsHomogeneousVehicle routing problemDiscrete Mathematics and CombinatoricsLarge neighborhood searchRelevance (information retrieval)Quality (business)Common carrierbusinessMathematicsmedia_commonDiscrete Applied Mathematics
researchProduct

The geometry of canal surfaces and the length of curves in de Sitter space

2011

Abstract We find the minimal value of the length in de Sitter space of closed space-like curves with non-vanishing non-space-like geodesic curvature vector. These curves are in correspondence with closed almost-regular canal surfaces, and their length is a natural magnitude in conformal geometry. As an application, we get a lower bound for the total conformal torsion of closed space curves.

Mathematics - Differential GeometryDe Sitter spaceTorsion (algebra)Magnitude (mathematics)Conformal mapGeometryGeometry and TopologyClosed spaceConformal geometryUpper and lower boundsMathematicsGeodesic curvatureadvg
researchProduct

Reilly's type inequality for the Laplacian associated to a density related with shrinkers for MCF

2015

Let $(\bar{M},,e^\psi)$ be a Riemannian manifold with a density, and let $M$ be a closed $n$-dimensional submanifold of $\bar{M}$ with the induced metric and density. We give an upper bound on the first eigenvalue $\lambda_1$ of the closed eigenvalue problem for $\Delta_\psi$ (the Laplacian on $M$ associated to the density) in terms of the average of the norm of the vector ${\vec{H}}_{{\psi}} + {\bar \nabla}$ with respect to the volume form induced by the density, where ${\vec{H}}_{{\psi}}$ is the mean curvature of $M$ associated to the density $e^\psi$. When $\bar{M}=\Bbb R^{n+k}$ or $\bar{M}=S^{n+k-1}$, the equality between $\lambda_1$ and its bound implies that $e^\psi$ is a Gaussian den…

Mathematics - Differential GeometryMean curvature flowMean curvature53C42 52C21Applied Mathematics010102 general mathematicsMathematics::Spectral TheoryRiemannian manifoldSubmanifold01 natural sciencesInduced metricUpper and lower bounds010101 applied mathematicsCombinatoricsVolume formDifferential Geometry (math.DG)FOS: MathematicsHigh Energy Physics::ExperimentMathematics::Differential Geometry0101 mathematicsLaplace operatorAnalysisMathematicsJournal of Differential Equations
researchProduct

Failure of topological rigidity results for the measure contraction property

2014

We give two examples of metric measure spaces satisfying the measure contraction property MCP(K,N) but having different topological dimensions at different regions of the space. The first one satisfies MCP(0,3) and contains a subset isometric to $\mathbb{R}$, but does not topologically split. The second space satisfies MCP(2,3) and has diameter $\pi$, which is the maximal possible diameter for a space satisfying MCP(N-1,N), but is not a topological spherical suspension. The latter example gives an answer to a question by Ohta.

Mathematics - Differential Geometrymetric measure spacesGeodesicPhysics::Instrumentation and DetectorsQuantitative Biology::Tissues and Organsmeasure contraction propertyMetric Geometry (math.MG)53C23 (Primary) 28A33 49Q20 (Secondary)Ricci curvature lower boundsTopologyPotential theorymaximal diameter theoremnonbranchingRigidity (electromagnetism)Mathematics - Metric GeometryDifferential Geometry (math.DG)splitting theoremFOS: MathematicsSplitting theoremContraction (operator theory)AnalysisMathematicsgeodesics
researchProduct

A matheuristic for the Team Orienteering Arc Routing Problem

2015

In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error o…

MatheuristicMathematical optimizationInformation Systems and ManagementGeneral Computer ScienceComputer scienceOrienteeringDirected graphManagement Science and Operations ResearchUpper and lower boundsIndustrial and Manufacturing EngineeringVertex (geometry)Constraint (information theory)Set (abstract data type)Routing problems with profitsArc routing problemModeling and SimulationBenchmark (computing)Team Orienteering ProblemDuration (project management)MATEMATICA APLICADAArc routing
researchProduct

Parameter optimization for amplify-and-forward relaying with imperfect channel estimation

2009

Cooperative diversity is a promising technology for future wireless networks. In this paper, we consider a cooperative communication system operating in an amplify-and-forward (AF) mode with an imperfectly-known relay fading channel. It is assumed that a pilot symbol assisted modulation (PSAM) scheme with linear minimum mean square estimator (LMMSE) is used for the channel estimation. A simple and easy-to-evaluate asymptotical upper bound (AUB) of the symbol-error-rate (SER) is derived for uncoded AF cooperative systems with quadrature amplitude modulation (QAM) constellations. Based on the AUB, we propose a criterion for the choice of parameters in the PSAM scheme, i.e., the pilot spacing …

Mean squared errorChannel state informationControl theoryVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552EstimatorFadingUpper and lower boundsAlgorithmQuadrature amplitude modulationComplex normal distributionCooperative diversityMathematics
researchProduct

Lower bounds for eigenvalues of a quadratic form relative to a positive quadratic form

1968

Abstract : A method is presented for the calculation of lower bounds to eigenvalues of operators that arise from variational problems for one quadratic form relative to a positive definite quadratic form. Eigenvalue problems of this kind occur, for example, in the theory of buckling of continuous linear elastic systems. The technique used is a modification of one introduced earlier, (1) sections II and IVB, for the determination of lower bounds to eigenvalues of semi-bounded self-adjoint operators. Other methods for the latter problem can be carried over without essential changes. The particular difficulty in the case we consider is that some operators which enter the calculation for the lo…

Mechanical EngineeringMathematical analysisPositive-definite matrixIsotropic quadratic formUpper and lower boundsDefinite quadratic formMathematics (miscellaneous)Quadratic formApplied mathematicsBoundary value problemCalculus of variationsAnalysisEigenvalues and eigenvectorsMathematicsArchive for Rational Mechanics and Analysis
researchProduct

Dynamic shakedown by modal analysis

1984

Dynamic shakedown of discrete elastic-perfectly plastic structures under a specified load history is studied using the dynamic characteristics of the structure provided by modal analysis. Several statical and kinematical theorems are presented, including lower and upper bound theorems for the minimum adaptation time of the structure. In the formulation of the kinematical theorems a crucial role is played by the appropriate definition of ≪admissible plastic strain cycle≫.

Mechanics of MaterialsMechanical EngineeringSpecified loadModal analysisMathematical analysisCalculusStructure (category theory)PlasticityCondensed Matter PhysicsUpper and lower boundsShakedownMathematicsMeccanica
researchProduct