A Mathematical Optimization Problem in Bioinformatics

PRIMUS ◽  
2008 ◽  
Vol 18 (1) ◽  
pp. 101-118 ◽  
Author(s):  
Laurie J. Heyer
Keyword(s):  
Optimization Problem ◽  
Mathematical Optimization ◽  
Mathematical Optimization Problem

scholarly journals Computing technical capacities in the European entry-exit gas market is NP-hard

2020 ◽  
Vol 295 (1) ◽  
pp. 337-362
Author(s):  
Lars Schewe ◽  
Martin Schmidt ◽  
Johannes Thürauf
Keyword(s):  
Optimization Problem ◽  
Mathematical Optimization ◽  
Entry And Exit ◽  
Flow Models ◽  
Graph Classes ◽  
System Operator ◽  
Mathematical Optimization Problem ◽  
Market Organization ◽  
Gas Market

Abstract As a result of its liberalization, the European gas market is organized as an entry-exit system in order to decouple the trading and transport of natural gas. Roughly summarized, the gas market organization consists of four subsequent stages. First, the transmission system operator (TSO) is obliged to allocate so-called maximal technical capacities for the nodes of the network. Second, the TSO and the gas traders sign mid- to long-term capacity-right contracts, where the capacity is bounded above by the allocated technical capacities. These contracts are called bookings. Third, on a day-ahead basis, gas traders can nominate the amount of gas that they inject or withdraw from the network at entry and exit nodes, where the nominated amount is bounded above by the respective booking. Fourth and finally, the TSO has to operate the network such that the nominated amounts of gas can be transported. By signing the booking contract, the TSO guarantees that all possibly resulting nominations can indeed be transported. Consequently, maximal technical capacities have to satisfy that all nominations that comply with these technical capacities can be transported through the network. This leads to a highly challenging mathematical optimization problem. We consider the specific instantiations of this problem in which we assume capacitated linear as well as potential-based flow models. In this contribution, we formally introduce the problem of () and prove that it is -complete on trees and -hard in general. To this end, we first reduce the problem to for the case of capacitated linear flows in trees. Afterward, we extend this result to with potential-based flows and show that this problem is also -complete on trees by reducing it to the case of capacitated linear flow. Since the hardness results are obtained for the easiest case, i.e., on tree-shaped networks with capacitated linear as well as potential-based flows, this implies the hardness of for more general graph classes.

scholarly journals Un Método de Optimización Proximal para Problemas de Localización Cuasi-convexa

2019 ◽  
pp. 25-32
Keyword(s):  
Objective Function ◽  
Optimization Problem ◽  
Mathematical Optimization ◽  
Optimization Method ◽  
Optimal Location ◽  
Proximal Point Method ◽  
Localization Problem ◽  
Proximal Point ◽  
Localization Theory ◽  
Mathematical Optimization Problem

Un Método de Optimización Proximal para Problemas de Localización Cuasi-convexa Miguel A. Cano Lengua, Erik A. Papa Quiroz Facultad de Ciencias Naturales y Matemática -FCNM/ Universidad Nacional del Callao Callao- Perú DOI: https://doi.org/10.33017/RevECIPeru2011.0018/ RESUMEN El problema de localización es de gran interés para poder establecer de manera óptima diferentes demandas de ubicación en el sector estatal o privado. El modelo de este problema se reduce generalmente a un problema de optimización matemática. En el presente trabajo presentamos un método de optimización proximal para resolver problemas de localización donde la función objetivo es cuasi-convexa y no diferenciable. Probamos que las iteraciones dadas por el método están bien definidas y bajo algunas hipótesis sobre la función objetivo probamos la convergencia del método. Descriptores: Método del punto proximal, teoría de localización, convergencia global, función cuasi-convexa. ABSTRACT The localization problem is of great interest to establish the optimal location of the different demands in the state or private sector. The model of this problem is generally reduced to solve a mathematical optimization problem. In the present work we present a proximal optimization method to solve localization problems where the objective function is non differentiable and quasiconvex. We prove that the iterations of the method are well defined and under some assumption on the objective function we prove the convergence of the method. Keywords: Proximal point method, localization theory, global convergence, quasiconvex function.

Minimum Vibration Cam Profiles

1968 ◽  
Vol 10 (3) ◽  
pp. 219-227 ◽  
Author(s):  
H. Kwakernaak ◽  
J. Smit
Keyword(s):  
Linear Programming ◽  
Optimization Problem ◽  
Numerical Solutions ◽  
Mathematical Optimization ◽  
Problem Formulation ◽  
Programming Formulation ◽  
Quadratic Problem ◽  
Linear Programming Formulation ◽  
Mathematical Optimization Problem ◽  
Minimal Residual

The problem of finding cam profiles with limited follower velocity, acceleration and jerk and minimal residual vibrations over a prescribed range of cam speeds is formulated as a mathematical optimization problem. Two versions of the problem are considered: a quadratic problem formulation and a linear programming formulation. Numerical solutions have been found through the use of a digital computer and the methods are compared. Examples of profiles are presented which compare favourably with the well-known cycloidal profile.

Optimal Sythesis of Planar Six-Link Chains Using Least-Squares Gradient Search

1972 ◽  
Vol 1 (1) ◽  
pp. 31-36 ◽  
Author(s):  
F.Y. Chen ◽  
V.M. Dalsania
Keyword(s):  
Least Squares ◽  
Optimization Problem ◽  
Mathematical Optimization ◽  
Dimensional Synthesis ◽  
Gradient Search ◽  
Computer Solution ◽  
Numerical Examples ◽  
Function Generators ◽  
Mathematical Optimization Problem

The approximate dimensional synthesis of three basic forms of the planar six-link chain as function generators is formulated as a mathematical optimization problem. Least-squares gradient search scheme is used for the computer solution. Numerical examples are given.

Research on the Shortest Path Problem Based on Green Transportation

2014 ◽  
Vol 1010-1012 ◽  
pp. 1858-1861
Author(s):  
Bao You Liu ◽  
Ya Ru Liu
Keyword(s):  
Shortest Path ◽  
Operations Research ◽  
Optimization Problem ◽  
Daily Life ◽  
Mathematical Optimization ◽  
Shortest Path Problem ◽  
Hebei Province ◽  
Research Knowledge ◽  
Green Transportation ◽  
Mathematical Optimization Problem

The shortest path problem is a typical mathematical optimization problem which often encountered in the production field and daily life. From the perspective of green transportation, in this paper, the shortest path problem in Hebei Province was put forward that applied the operations research knowledge, and solved the analysis by lingo11.0. The results showed that the shortest path is 2230.00 km that started from Shijiazhuang through each prefecture-level city, then back to Shijiazhuang. The shortest path from Shijiazhuang to Qinhuangdao is 589.00 km.

scholarly journals Novelty of Frequency Domain Data in Smart Structures using μ-Analysis

2019 ◽  
Vol 4 (4) ◽  
pp. 131-138
Author(s):  
Amalia John Moutsopoulou ◽  
Georgios E. Stavroulakis ◽  
Anastasios D. Pouliezos
Keyword(s):  
Robust Control ◽  
Control Problem ◽  
Frequency Domain ◽  
Optimization Problem ◽  
Smart Structures ◽  
Mathematical Optimization ◽  
Smart Structure ◽  
H Infinity ◽  
H Infinity Control ◽  
Mathematical Optimization Problem

This paper deals with the advantages of robust control in smart structures. First we present the implementations of H infinity control in the frequency domain. A dynamic model for smart structure under wind excitations is considered. Then robust control theory is used a model to synthesize controllers achieving stabilization with guaranteed performance for smart structures. We use μ-analysis to express   the control problem as a mathematical optimization problem and then find the controller that solves the optimization problem in the frequency domain.  

scholarly journals Nonconvex and game theory optimization for resource allocation in wireless communications

2021 ◽  
Author(s):  
Kandasamy Illanko
Keyword(s):  
Wireless Communication ◽  
Power Allocation ◽  
Communication Systems ◽  
Optimization Problem ◽  
Polynomial Complexity ◽  
Optimization Problems ◽  
Stackelberg Game ◽  
Mathematical Optimization ◽  
Simultaneous Optimization ◽  
Theoretical Development

Designing wireless communication systems that efficiently utilize the resources frequency spectrum and electric power, leads to problems in mathematical optimization. Most of these optimization problems are difficult to solve because the objective functions are nonconvex. While some problems remain unsolved, the solutions proposed in the literature for the others are of somewhat limited use because the algorithms are either unstable or have too high a computational complexity. This dissertation presents several stable algorithms, most of which have polynomial complexity, that solve five different nonconvex optimization problems in wireless communication. Two centralized and two distributed algorithms deal with the power allocation that maximizes the throughput in the Gaussian interference channel (GIC)with various constraints. The most valuable of these algorithms, the one with the minimum rate constraints became possible after a significant theoretical development in the dissertation that proves that the throughput of the GIC has a new generalized convex structure called invexity. The fifth algorithm has linear complexity, and finds the power allocation that maximizes the energy efficiency (EE) of OFDMA transmissions, for a given subchannel assignment. Some fundamental results regarding the power allocation are then used in the genetic algorithm for determining the subchannel allocation that maximizes the EE. Pricing for channel subleasing for ad-hoc wireless networks is considered next. This involves the simultaneous optimization of many functions that are interconnected through the variables involved. A composite game, a strategic game within a Stackelberg game, is used to solve this optimization problem with polynomial complexity. For each optimization problem solved, numerical results obtained using simulations that support the analysis and demonstrate the performance of the algorithms are presented.

AUTOMATIC VERIFICATION OF OPTIMIZATION ALGORITHMS: A CASE STUDY OF A QUADRATIC ASSIGNMENT PROBLEM SOLVER

2011 ◽  
Vol 21 (02) ◽  
pp. 289-307 ◽  
Author(s):  
ROBERT MERKEL ◽  
DAOMING WANG ◽  
HUIMIN LIN ◽  
TSONG YUEH CHEN
Keyword(s):  
Assignment Problem ◽  
Optimization Problem ◽  
Quadratic Assignment Problem ◽  
Relative Effectiveness ◽  
Mathematical Optimization ◽  
Quadratic Assignment ◽  
Problem Solver ◽  
Metamorphic Testing ◽  
Single Relation

Metamorphic testing is a technique for the verification of software output without a complete testing oracle. Mathematical optimization, implemented in software, is a problem for which verification can often be challenging. In this paper, we apply metamorphic testing to one such optimization problem, the quadratic assignment problem (QAP). From simple observations of the properties of the QAP, we describe how to derive a number of metamorphic relations useful for verifying the correctness of a QAP solver. We then compare the effectiveness of these metamorphic relations, in "killing" mutant versions of an exact QAP solver, to a simulated oracle. We show that metamorphic testing can be as effective as the simulated oracle for killing mutants. We examine the relative effectiveness of different metamorphic relations, both singly and in combination, and conclude that combining metamorphic relations can be significantly more effective than using a single relation.

Sign in / Sign up

Export Citation Format

Share Document