Search results for "Linear programming"

showing 10 items of 137 documents

Scatter Search and Path Relinking: Advances and Applications

2006

Scatter search (SS) is a population-based method that has recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, SS uses strategies for combining solution vectors that have proved effective in a variety of problem settings. Path relinking (PR) has been suggested as an approach to integrate intensification and diversification strategies in a search scheme. The approach may be viewed as an extreme (highly focused) instance of a strategy that seeks to incorporate attributes of high quality solutions, by creating inducements to favo…

Mathematical optimizationeducation.field_of_studyEngineeringbusiness.industryPopulationDecision ruleTabu searchNonlinear programmingVariety (cybernetics)Path (graph theory)Local search (optimization)Set (psychology)educationbusiness
researchProduct

Best Proximity Points for Some Classes of Proximal Contractions

2013

Given a self-mapping g: A → A and a non-self-mapping T: A → B, the aim of this work is to provide sufficient conditions for the existence of a unique point x ∈ A, called g-best proximity point, which satisfies d g x, T x = d A, B. In so doing, we provide a useful answer for the resolution of the nonlinear programming problem of globally minimizing the real valued function x → d g x, T x, thereby getting an optimal approximate solution to the equation T x = g x. An iterative algorithm is also presented to compute a solution of such problems. Our results generalize a result due to Rhoades (2001) and hence such results provide an extension of Banach's contraction principle to the case of non-s…

Mathematical optimizationmetric spacesArticle SubjectIterative methodApplied Mathematicslcsh:MathematicsWork (physics)proximal contractionbest proximity pointExtension (predicate logic)Resolution (logic)lcsh:QA1-939Nonlinear programmingReal-valued functionPoint (geometry)Settore MAT/03 - GeometriaContraction principleAnalysisMathematicsAbstract and Applied Analysis
researchProduct

OPTIMIZATION OF POLYGENERATION SYSTEMS SERVING A CLUSTER OF BUILDINGS

2012

The optimization of combined energy systems for the production and distribution of warm and cold fluids to civil users is very complex; two possible configurations, i.e. the small single units for individual buildings and the large plants integrated with district heating networks, can be essentially considered, especially in cold climates. Dealing with such a complex problem, involving a very large number of variables, requires efficient algorithms and resolution techniques. The present chapter illustrates a Mixed Integer Linear Program (MILP)1 approach to the optimization of synthesis, design and operation for CHCP-based μ-grids including thermal energy storages. A novel approach is presen…

Mixed Integer Linear Programming Energy saving polygeneration cluster of buildingsSettore ING-IND/10 - Fisica Tecnica Industriale
researchProduct

Mixed integer optimal compensation: Decompositions and mean-field approximations

2012

Mixed integer optimal compensation deals with optimizing integer- and real-valued control variables to compensate disturbances in dynamic systems. The mixed integer nature of controls might be a cause of intractability for instances of larger dimensions. To tackle this issue, we propose a decomposition method which turns the original n-dimensional problem into n independent scalar problems of lot sizing form. Each scalar problem is then reformulated as a shortest path one and solved through linear programming over a receding horizon. This last reformulation step mirrors a standard procedure in mixed integer programming. We apply the decomposition method to a mean-field coupled multi-agent s…

Model predictive controlApproximation theoryMathematical optimizationLinear programmingBranch and priceShortest path problemDecomposition method (constraint satisfaction)Optimal controlInteger programmingMathematics2012 American Control Conference (ACC)
researchProduct

An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions

1983

This paper develops a method for interactive multiple objective linear programming assuming an unknown pseudo concave utility function satisfying certain general properties. The method is an extension of our earlier method published in this journal (Zionts, S., Wallenius, J. 1976. An interactive programming method for solving the multiple criteria problem. Management Sci. 22 (6) 652–663.). Various technical problems present in predecessor versions have been resolved. In addition to presenting the supporting theory and algorithm, we discuss certain options in implementation and summarize our practical experience with several versions of the method.

Nonlinear systemClass (computer programming)Mathematical optimizationInteractive programmingLinear programmingMultiple objectiveStrategy and Managementmultiple criteria utility/preference: multi-attribute [programming]Function (mathematics)Extension (predicate logic)Management Science and Operations ResearchMathematicsLinear-fractional programmingManagement Science
researchProduct

Interactive Nonlinear Multiobjective Procedures

2006

An overview of the interactive methods for solving nonlinear multiple criteria decision making problems is given. In interactive methods, the decision maker progressively provides preference information so that the most satisfactory compromise can be found. The basic features of several methods are introduced and some theoretical results are provided. In addition, references to modifications and applications as well as to other methods are indicated.

Nonlinear systemMathematical optimizationComputer scienceCompromisemedia_common.quotation_subjectMultiple criteriaDecision makerMulti-objective optimizationPreferenceNonlinear programmingmedia_common
researchProduct

Some Methods for Nonlinear Multi-objective Optimization

2001

A general overview of nonlinear multiobjective optimization methods is given. The basic features of several methods are introduced so that an appropriate method could be found for different purposes. The methods are classified according to the role of a decision maker in the solution process. The main emphasis is devoted to interactive methods where the decision maker progressively provides preference information so that the most satisfactory solution can be found.

Nonlinear systemMathematical optimizationComputer scienceMulti-objective optimizationPreferenceNonlinear programming
researchProduct

A Column Generation Approach to Scheduling of Periodic Tasks

2011

We present an algorithm based on column generation for a real time scheduling problem, in which all tasks appear regularly after a given period. Furthermore, the tasks exchange messages, which have to be transferred over a bus, if the tasks involved are executed on different ECUs. Experiments show that for large instances our preliminary implementation is faster than the previous approach based on an integer linear programming formulation using a state-of-the-art solver.

On columnJob shop schedulingComputer scienceColumn generationParallel computingSolverInteger linear programming formulationScheduling (computing)
researchProduct

Multicopter UAV design optimization

2014

Designing and selecting hardware for a multirotor can be challenging in order to get the best flight performance out of the system. In addition to selecting the hardware, the number of actuators can also be altered. For a 4 actuator (quadrotor) setup, one set of hardware can give the optimal design, while for a 6 actuator setup (hexarotor) the same hardware may not necessarily give the same response. In this paper we present a design optimization process of a multirotor, where the hardware is selected from a set of low-cost off-the-shelf standard RC hobby parts. Constraining the problem to a given hardware ensures existence of the selected hardware, and the design can be implemented. Also t…

Optimal designSet (abstract data type)EngineeringLinear programmingPayloadbusiness.industryControl theoryControl engineeringSolverbusinessMultirotorActuatorInteger (computer science)2014 IEEE/ASME 10th International Conference on Mechatronic and Embedded Systems and Applications (MESA)
researchProduct

Distributed Resource Allocation for Energy Efficiency in OFDMA Multicell Networks with Wireless Power Transfer

2019

In this paper, an energy-efficient resource allocation problem is investigated for the wireless power transfer (WPT)-enabled OFDMA multicell networks. In the considered system, multiple base stations (BSs) with a large number of antennas are responsible to provide WPT in the downlink, and the users can recycle and utilize the received energy for uplink data transmission. The role of BS is to execute WPT; thus, there are no data transmissions in the downlink. A time-division protocol is considered to divide the time of downlink WPT and uplink wireless information transfer into separate time slots. With the objective to improve the energy efficiency, we propose the time, subcarrier, and power…

Optimization problemComputer Networks and CommunicationsComputer sciencesubcarrier allocationenergiatehokkuusDistributed computingwireless power transfer02 engineering and technologyData_CODINGANDINFORMATIONTHEORYSubcarrierNonlinear programmingantenna selectionBase stationTelecommunications link0202 electrical engineering electronic engineering information engineeringComputer Science::Networking and Internet ArchitectureWirelessElectrical and Electronic Engineeringvoimansiirtoenergy efficiencyComputer Science::Information Theoryta213business.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKStime allocation020206 networking & telecommunicationspower allocationChannel state informationResource allocationbusinesslangattomat verkotEfficient energy use
researchProduct