220 research outputs found
Biperspective functions for mixed-integer fractional programs with indicator variables
Perspective functions have long been used to convert fractional programs into convex programs. More recently, they have been used to form tight relaxations of mixed-integer nonlinear programs with so-called indicator variables. Motivated by a practical application (maximising energy efficiency in an OFDMA system), we consider problems that have a fractional objective and indicator variables simultaneously. To obtain a tight relaxation of such problems, one must consider what we call a ābi-perspectiveā (Bi-P) function. An analysis of Bi-P functions leads to the derivation of a new kind of cutting planes, which we call āBi-P-cutsā. Computational results indicate that Bi-P-cuts typically close a substantial proportion of the integrality gap
Some Aspects of Mathematical Programming in Statictics
The Almighty has created the Universe and things present in it with an
order and proper positions and the creation looks unique and perfect. No one
can even think much better or imagine to optimize these further. People
inspired by these optimum results started thinking about usage of
optimization techniques for solving their real life problems. The concept of
constraint optimization came into being after World War II and its use
spread vastly in all fields. However, in this process, still lots of efforts are
needed to uncover the mysteries and unanswered questions, one of the
questions always remains live that whether there can be a single method that
can solve all types of nonlinear programming problems like Simplex
Method solves linear programming problems. In the present thesis, we have
tried to proceed in this direction and provided some contributions towards
this area.
The present thesis has been divided into five chapters, chapter wise
summary is given below:
Chapter-1 is an introductory one and provides genesis of the
Mathematical Programming Problems and its use in Statistics.
Relationship of mathematical programming with other statistical
measures are also reviewed. Definitions and other pre-requisites are
also presented in this chapter. The relevant literature on the topic has
been surveyed.
Chapter-2 deals with the two dimensional non-linear programming
problems. We develop a method that can solve approximately all type
of two dimensional nonlinear programming problems of certain class.
The method has been illustrated with numerical examples.
Chapter-3 is devoted to the study of n-dimensional non-linear
programming problems of certain types. We provide a new method
based on regression analysis and statistical distributions. The method
can solve n-dimensional non-linear programming problems making
use of regression analysis/co-efficient of determination.
In chapter-4 we introduce a filtration method of mathematical
programming. This method divides the constraints into active and non
active and try to eliminate the less important constraints (non-active
constraints) and solve the problem with only active constraints. This
helps to find solution in less iterations and less in time while retaining
optimality of the solution.
The final chapter-5 deals with an interesting relationship between
linear and nonlinear programming problems. Using this relationship,
we can solve linear programming problems with the help of non-linear
programming problems. This relationship also helps to find a better
alternate solutions to the linear programming problems.
In the end, a complete bibliography is provided
Aspects of mathematical programming in financial corporate planning
Imperial Users onl
Decomposition and duality based approaches to stochastic integer programming
Stochastic Integer Programming is a variant of Linear Programming which incorporates integer and stochastic properties (i.e. some variables are discrete, and some properties of the problem are randomly determined after the first-stage decision). A Stochastic Integer Program may be rewritten as an equivalent Integer Program with a characteristic structure, but is often too large to effectively solve directly. In this thesis we develop new algorithms which exploit convex duality and scenario-wise decomposition of the equivalent Integer Program to find better dual bounds and faster optimal solutions. A major attraction of this approach is that these algorithms will be amenable to parallel computation
Tractable multi-product pricing under discrete choice models
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2013.Cataloged from PDF version of thesis.Includes bibliographical references (pages 199-204).We consider a retailer offering an assortment of differentiated substitutable products to price-sensitive customers. Prices are chosen to maximize profit, subject to inventory/ capacity constraints, as well as more general constraints. The profit is not even a quasi-concave function of the prices under the basic multinomial logit (MNL) demand model. Linear constraints can induce a non-convex feasible region. Nevertheless, we show how to efficiently solve the pricing problem under three important, more general families of demand models. Generalized attraction (GA) models broaden the range of nonlinear responses to changes in price. We propose a reformulation of the pricing problem over demands (instead of prices) which is convex. We show that the constrained problem under MNL models can be solved in a polynomial number of Newton iterations. In experiments, our reformulation is solved in seconds rather than days by commercial software. For nested-logit (NL) demand models, we show that the profit is concave in the demands (market shares) when all the price-sensitivity parameters are sufficiently close. The closed-form expressions for the Hessian of the profit that we derive can be used with general-purpose nonlinear solvers. For the special (unconstrained) case already considered in the literature, we devise an algorithm that requires no assumptions on the problem parameters. The class of generalized extreme value (GEV) models includes the NL as well as the cross-nested logit (CNL) model. There is generally no closed form expression for the profit in terms of the demands. We nevertheless how the gradient and Hessian can be computed for use with general-purpose solvers. We show that the objective of a transformed problem is nearly concave when all the price sensitivities are close. For the unconstrained case, we develop a simple and surprisingly efficient first-order method. Our experiments suggest that it always finds a global optimum, for any model parameters. We apply the method to mixed logit (MMNL) models, by showing that they can be approximated with CNL models. With an appropriate sequence of parameter scalings, we conjecture that the solution found is also globally optimal.by Philipp Wilhelm Keller.Ph.D
Modelling and solution methods for portfolio optimisation
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University, 16/01/2004.In this thesis modelling and solution methods for portfolio optimisation are presented. The investigations reported in this thesis extend the Markowitz mean-variance model to the domain of quadratic mixed integer programming (QMIP) models which are 'NP-hard' discrete optimisation problems. In addition to the modelling extensions a number of challenging aspects of solution algorithms are considered. The relative performances of sparse simplex (SSX) as well as the interior point method (IPM) are studied in detail. In particular, the roles of 'warmstart' and dual simplex are highlighted as applied to the construction of the efficient frontier which requires processing a family of problems; that is, the portfolio planning model stated in a parametric form. The method of solving QMIP models using the branch and bound algorithm is first developed; this is followed up by heuristics which improve the performance of the (discrete) solution algorithm. Some properties of the efficient frontier with discrete constraints are considered and a method of computing the discrete efficient frontier (DEF) efficiently is proposed. The computational investigation considers the efficiency and effectiveness in respect of the scale up properties of the proposed algorithm. The extensions of the real world models and the proposed solution algorithms make contribution as new knowledge
Modelling and solution methods for portfolio optimisation
In this thesis modelling and solution methods for portfolio optimisation are presented. The investigations reported in this thesis extend the Markowitz mean-variance model to the domain of quadratic mixed integer programming (QMIP) models which are 'NP-hard' discrete optimisation problems. In addition to the modelling extensions a number of challenging aspects of solution algorithms are considered. The relative performances of sparse simplex (SSX) as well as the interior point method (IPM) are studied in detail. In particular, the roles of 'warmstart' and dual simplex are highlighted as applied to the construction of the efficient frontier which requires processing a family of problems; that is, the portfolio planning model stated in a parametric form. The method of solving QMIP models using the branch and bound algorithm is first developed; this is followed up by heuristics which improve the performance of the (discrete) solution algorithm. Some properties of the efficient frontier with discrete constraints are considered and a method of computing the discrete efficient frontier (DEF) efficiently is proposed. The computational investigation considers the efficiency and effectiveness in respect of the scale up properties of the proposed algorithm. The extensions of the real world models and the proposed solution algorithms make contribution as new knowledge.EThOS - Electronic Theses Online ServiceGBUnited Kingdo
Convex Optimisation for Communication Systems
In this thesis new robust methods for the efficient sharing of the radio spectrum for underlay cognitive radio (CR) systems are developed. These methods provide robustness against uncertainties in the channel state information (CSI) that is available to the cognitive radios. A stochastic approach is taken and the robust spectrum sharing methods are formulated as convex optimisation problems. Three efficient spectrum sharing methods; power control, cooperative beamforming and conventional beamforming are studied in detail.
The CR power control problem is formulated as a sum rate maximisation problem and transformed into a convex optimisation problem. A robust power control method under the assumption of partial CSI is developed and also transformed into a convex optimisation problem. A novel method of detecting and removing infeasible constraints from the power allocation problem is presented that results in considerably improved performance. The performance of the proposed methods in Rayleigh fading channels is analysed by simulations.
The concept of cooperative beamforming for spectrum sharing is applied to an underlay CR relay network. Distributed single antenna relay nodes are utilised to form a virtual antenna array that provides increased gains in capacity through cooperative beamforming. It is shown that the cooperative beamforming problems can be transformed into convex optimisation problems. New robust cooperative beamformers under the assumption of partial and imperfect CSI are developed and also transformed into convex optimisation problems. The performance of the proposed methods in Rayleigh fading channels is analysed by simulations.
Conventional beamforming to allow efficient spectrum sharing in an underlay CR system is studied. The beamforming problems are formulated and transformed into convex optimisation problems. New robust beamformers under the assumption of partial and imperfect CSI are developed and also transformed into convex optimisation problems. The performance of the proposed methods in Rayleigh fading channels is analysed by simulations
A vision-based optical character recognition system for real-time identification of tractors in a port container terminal
Automation has been seen as a promising solution to increase the productivity of modern sea port container terminals. The potential of increase in throughput, work efficiency and reduction of labor cost have lured stick holders to strive for the introduction of automation in the overall terminal operation. A specific container handling process that is readily amenable to automation is the deployment and control of gantry cranes in the container yard of a container terminal where typical operations of truck identification, loading and unloading containers, and job management are primarily performed manually in a typical terminal. To facilitate the overall automation of the gantry crane operation, we devised an approach for the real-time identification of tractors through the recognition of the corresponding number plates that are located on top of the tractor cabin. With this crucial piece of information, remote or automated yard operations can then be performed. A machine vision-based system is introduced whereby these number plates are read and identified in real-time while the tractors are operating in the terminal. In this paper, we present the design and implementation of the system and highlight the major difficulties encountered including the recognition of character information printed on the number plates due to poor image integrity. Working solutions are proposed to address these problems which are incorporated in the overall identification system.postprin
Recovery methods for evolution and nonlinear problems
Functions in finite dimensional spaces are, in general, not smooth enough to be differentiable in the classical sense and ārecoveredā versions of their first and second derivatives must be sought for certain applications. In this work we make use of recovered derivatives for applications in finite element schemes for two different purposes. We thus split this Thesis into two distinct parts.
In the first part we derive energy-norm aposteriori error bounds, using gradient recovery (ZZ) estimators to control the spatial error for fully discrete schemes of the linear heat equation. To our knowledge this is the first completely rigorous derivation of ZZ estimators for fully discrete schemes for evolution problems, without any restrictive assumption on the timestep size. An essential tool for the analysis is the elliptic reconstruction technique introduced as an aposteriori analog to the elliptic (Ritz) projection.
Our theoretical results are backed up with extensive numerical experimentation aimed at (1) testing the practical sharpness and asymptotic behaviour of the error estimator against the error, and (2) deriving an adaptive method based on our estimators.
An extra novelty is an implementation of a coarsening error āpreindicatorā, with a complete implementation guide in ALBERTA (versions 1.0ā2.0).
In the second part of this Thesis we propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galƫrkin type using conforming finite elements and applied directly to the nonvariational(or nondivergence) form of a second order linear elliptic problem. The key tools are an
appropriate concept of the āfinite element Hessianā based on a Hessian recovery and a Schur complement approach to solving the resulting linear algebra problem. The method
is illustrated with computational experiments on linear PDEs in nonvariational form.
We then use the nonvariational finite element method to build a numerical method for fully nonlinear elliptic equations. We linearise the problem via Newtonās method resulting in a sequence of nonvariational elliptic problems which are then approximated with the nonvariational finite element method. This method is applicable to general fully nonlinear PDEs who admit a unique solution without constraint.
We also study fully nonlinear PDEs when they are only uniformly elliptic on a certain class of functions. We construct a numerical method for the MongeāAmpĆØre equation
based on using āfinite element convexityā as a constraint for the aforementioned nonvariational finite element method. This method is backed up with numerical experimentation
- ā¦