Author: haroonkhan

  • Multiobjective optimization

    Goal programming is one way of dealing with conflicting objectives, but it requires the assessment of weights and targets. Unfortunately, it may be very difficult, or even unethical, to figure out weights. As an example, consider the tradeoff between the cost of a production process and its pollution level. Sometimes, we would like to visualize…

  • Goal programming

    The deviation variables that we have utilized in order to formulate alternative regression models as LPs have other uses as well. Let us consider a generic optimization problem over a feasible set S. A standard complication of real-life decision problems is that there is not just one criterion to evaluate the quality of a solution, but…

  • Alternative regression models

    When dealing with simple linear regression, we typically use least squares to fit the coefficients of a simple linear model y = a + bx. Given a set of joint observations (xi, yi), i = 1, …, N, we define residuals and minimize the sum of squared residuals: This is actually a quadratic program, but because of the simplicity of constraints, we know from that…

  •  A REPERTOIRE OF MODEL FORMULATION TRICKS

    The models we have described in the last section rely on two quite relevant limiting assumptions: Luckily, there is an array of modeling tricks that can be used to partially overcome these difficulties. In the next sections we illustrate a few of them, in order to show that the LP modeling framework is less restrictive…

  • Network optimization

    Many real-life optimization problems relate with transportation of items on a network. This is clearly a relevant class of problems in supply chain management, but also many telecommunications problems involve networks on which data flow, rather than physical commodities. More surprisingly, some dynamic problems may be represented as network models on which items flow in…

  • Blending models

    In the production planning models that we have considered so far, there is a very precise way of producing each item type. When producing a car, you typically need an engine and four wheels. Factors cannot be substituted; there is no way to convince a customer to buy a car with 20 wheels and no…

  • A dynamic model for production planning

    In the previous two models for production planning there is a major omission: They do not involve any inventory buildup and depletion. From the familiar EOQ model, we know that there is one possible reason for building inventory, i.e., the presence of fixed ordering cost. A similar reason, which may be more relevant when producing…

  • Production planning with assembly of components

    The naive production mix model is just a starting point in modeling production planning, as many issues that make real-life models interesting and challenging are blatantly disregarded. We will proceed step by step, showing how more realistic features may be represented. In this section we consider one such issue, related to purchasing raw materials or…

  • BUILDING LINEAR PROGRAMMING MODELS

    Continuous linear programming (LP) problems are convex mathematical programs, for which extremely efficient solution methods are widely available. Therefore, real-life and large-scale problems can actually be tackled, provided that we are able to cast the decision problem in LP form. To squeeze a problem into the LP paradigm, we need the ability of formalizing decisions,…

  • Convex programming: difficult vs. easy problems

    Let us consider an abstract mathematical programming problem: Intuition would suggest that an unconstrained problem, where , is much easier to solve than a constrained one. Moreover, the same intuition would suggest that the larger the problem, in terms of the number of decision variables and constraints, the more difficult is solving it. In fact, this…