Social and Behavioral Sciences Commons^™

Insights Into The Challenges Posed By Climate Change And Land Competition To Brazil’S Midwest Pulpwood Market, Roberto Hajime Sant Anna Kimura

Theses and Dissertations

I investigated the effect of climate change in one of the few expanding markets in the world in Brazil. In the last decades the demand for pulpwood increased from zero to 11 million tons, leading to an expansion of 700 thousand hectares of Eucalyptus plantation. In 2024, a new mill will start operating increasing the consumption of wood fiber by 8.2 million tons (+49%). I used mathematical programming to investigate how different scenarios of productivity and land will affect the market. My results showed that around 946,000 hectares (+124%) of additional timberland will be necessary in the upcoming decades. The …

Logistics Planning: Putting Math To Work In A Business Setting, Michael C. Hannan

Senior Projects Spring 2023

The optimization of business procedures benefits all aspects of the product. Maximizing efficiency can lead to more profits for the business, cheaper products for the consumer, and less fuel consumption for the environment. Tracing the history of optimization, we can see that people have always strived for the most efficient way to allocate scarce resources. However, the field of optimization did not blossom until innovations in mathematics allowed us to solve a majority of real world problems. The discovery of linear and nonlinear programming in the 1940s allowed us to optimize problems that were unsolvable before. This paper introduces how …

Park Equity Modeling: A Case Study Of Asheville, North Carolina, Anisa Young

All Theses

Parks and greenspaces are publicly available entities that serve the vital purpose of promoting multiple aspects of human welfare. Unfortunately, the existence of park disparities is commonplace within the park setting. Specifically, marginalized individuals encounter limited park access, insufficient amenity provision, and poor maintenance. To remedy these disparities, we propose a process in which we select candidate park facilities and utilize facility location models to determine the optimal primary parks from both existing and candidate sites.

We note that platforms currently exist to identify the geographical areas where residents lack sufficient access to parks. However, these platforms do not yet …

Corn Co-Product Logistics – An Application Of Linear Programming, Dmitry Kalashnikov Adams

Department of Agricultural Economics: Dissertations, Theses, and Student Research

The purpose of this thesis is not to explore new ways to apply or to study the general field of linear programming. Rather the emphasis is on applying a particular type of linear programming to a specific problem. In this thesis the classic case of Linear Programing - the transportation problem – is used to optimize corn co-product logistics between six ethanol producing facilities. At the core, the problem of corn germ logistics lies in transporting products from areas of excess supply to areas with excess demand. The challenge of optimizing corn germ logistics lies in managing transportation between producing …

A Computational And Experimental Examination Of The Fcc Incentive Auction, Logan Gantner

Computational and Data Sciences (PhD) Dissertations

In 2016, the Federal Communications Commission debuted a new auction mechanism, the Incentive Auction, with the intention of obtaining high frequency television broadcasting spectrum, repurposing it for cellular use, and reselling these licenses at profitable prices. In designing this process, the traditional mechanism used for spectrum auctions, the Simulta- neous Multiple Round Auction (SMR), was modified in order to speed the process. This new mechanism, the Incentive Forward Auction (IFA), intended to reduce the number of rounds per auction by lumping similar spectrum licenses together. However, the IFA discourages straightforward bidding strategies and can result in bidders committing more in …

Revisiting The Foundations Of Dominant-Strategy Mechanisms, Yi-Chun Chen, Jiangtao Li

Research Collection School Of Economics

An important question in mechanism design is whether there is any theoretical foundation for the use of dominant-strategy mechanisms. This paper studies the maxmin and Bayesian foundations of dominant-strategy mechanisms in general social choice environments with quasi-linear preferences and private values. We propose a condition called the uniform shortest-path tree that, under regularity, ensures the foundations of dominant-strategy mechanisms. This exposes the underlying logic of the existence of such foundations in the single-unit auction setting, and extends the argument to cases where it was hitherto unknown. To prove this result, we adopt the linear programming approach to mechanism design. In …

A Modified Balcik Last Mile Distribution Model For Relief Operations Using Open Road Networks, Lance L. Putong, Marlene M. De Leon

Department of Information Systems & Computer Science Faculty Publications

The last mile in disaster relief distribution chain is the delivery of goods from a central warehouse to the evacuation centers assigned for a given area. Its effectiveness relies on the proper allocation of each kind of relief good amongst the demand areas on a given frequency. Because these operations involve a limited supply of relief goods, vehicles, and time, it is important to optimize these operations to satisfy as much demand as possible. The study aims to create a linear programming model which provides a set of recommendations on how the current disaster relief supply chain may be carried …

Minimizing Commute Distance For Small Groups: A Linear Programming Approach, Kevin Payne, Kritika Kumari, Levi Huddleston, Rabi Hassan

Engineering and Technology Management Student Projects

This paper aims to minimize total drive time between members and their respective group leader. Given a limit on group size and days available, how can a formulation of a group occur such that the sum of the total drive time is minimized. To accomplish this task a Linear Program (LP) is implemented that includes three sets of binary decisions variables summing to 4100 variables and a variety of constraints summing between 4200 and 4341 depending on the constraints enforced. For 200 members and 15 leaders the minimized average commuting time was found to be between 4.99 and 5.36 minutes …

Estimating The Economic Value Of Water For Agriculture And Other Industries In Tennessee, Stephanie Michaela Owen

Masters Theses

Tennessee’s currently abundant water resources could eventually become stressed as population continues to rise, climate change impacts water resources, and as agricultural producers continue to increase irrigation. These stresses could impact the productivity of the agricultural sectors and other economic sectors as competition for limited water resources increases. Farmers, policymakers, and researchers alike could benefit from quantifying the economic value of water to help formulate cost-effective and sustainable water use practices. This analysis establishes the water withdrawals (also referred to as “water use”) per dollar of output for competing economic sectors and uses those values in an Input-Output Linear Programming …

Nutritional And Economic Analysis Of Small-Scale Agriculture In Imbabura, Ecuador, Jake Erickson

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Intervention projects in the developing world normally aim to satisfy either the nutritional needs of a group, or advancing the economic stability, but not both. One of the many issues that may arise by narrowly focusing and creating an aid program is that although a group may be fed, they are not equipped to mitigate risks that will arise after project completion and thus continue or revert back to a malnourished state. A bridge is required to join the economic and nutritional programs to create aid interventions that are sustainable past the point of donor separation.

This paper proposes the …

A Declarative Modeling Framework That Integrates Solution Methods, John N. Hooker, Hak-Jin Kim, G. Ottosson

John Hooker

Constraint programming offers modeling features and solution methods that are unavailable in mathematical programming but are often flexible and efficient for scheduling and other combinatorial problems. Yet mathematical programming is well suited to declarative modeling languages and is more efficient for some important problem classes. This raises this issue as to whether the two approaches can be combined in a declarative modeling framework. This paper proposes a general declarative modeling system in which the conditional structure of the constraints shows how to integrate any "checker" and any special-purpose "solver". In particular this integrates constraint programming and optimization methods, because the …

270: How To Win The Presidency With Just 17.56% Of The Popular Vote, Charles D. Wessell

Math Faculty Publications

With the U.S. presidential election fast approaching we will often be reminded that the candidate who receives the most votes is not necessarily elected president. Instead, the winning candidate must receive a majority of the 538 electoral votes awarded by the 50 states and the District of Columbia. Someone with a curious mathematical mind might then wonder: What is the small fraction of the popular vote a candidate can receive and still be elected president? [excerpt]

Using Social Networking Game To Teach Operations Research And Management Science Fundamental Concepts, Ivan G. Guardiola, Susan L. Murray, Elizabeth A. Cudney

Engineering Management and Systems Engineering Faculty Research & Creative Works

This paper presents our experience using the popular game FarmVille by Zynga® to teach the fundamentals of linear programming and integer programming concepts to undergraduate students in an introductory operations research course. FarmVille is a popular game within the social networking website Facebook®. A month-long contest was introduced amongst the students with the goal to be the best individual farmer by striving to reach high levels of revenue, experience, and aesthetic appeal of their own unique farm. The contest is to demonstrate the concepts of problem formulation, solution methods, multiple and competing objectives, implementation of policy, and reformulation. The students …

Using Facility-Location Models To Optimally Locate Hierarchical Community-Based Health Facilities In Davao City, Myra Silva, Michael Johnson

Michael P. Johnson

Alternative hierarchical location-allocation models are used to locate two types of community-based health facilities in Davao City relative to population locations. Accounting for factors such as politics and resource availability, different optimization approaches were implemented to locate a mix of health centers and nutrition posts across the rural and urban areas of the city. The results were evaluated based on operating costs, average travel distance and population coverage. Computational results revealed that, by optimally locating barangay health centers and health posts, the current level of public investment in the health delivery infrastructure can be sufficient to cover a significant proportion …

An Implementation Of The Generalized Basis Reduction Algorithm For Integer Programming, William Cook, Thomas Rutherford, Herbert E. Scarf, David F. Shallcross

Cowles Foundation Discussion Papers

In recent years many advances have been made in solution techniques for specially structured 0–1 integer programming problems. In contrast, very little progress has been made on solving general (mixed integer) problems. This, of course, is not true when viewed from the theoretical side: Lenstra (1981) made a major breakthrough, obtaining a polynomial-time algorithm when the number of integer variables is fixed. We discuss a practical implementation of a Lenstra-like algorithm, based on the generalized basis reduction method of Lovasz and Scarf (1988). This method allows us to avoid the ellipsoidal approximations required in Lenstra’s algorithm. We report on the …

A Centered Projective Algorithm For Linear Programming, Michael J. Todd, Yinyu Ye

Cowles Foundation Discussion Papers

We describe a projective algorithm for linear programming that shares features with Karmarkar’s projective algorithm and its variants and with the path-following methods of Gonzaga, Kojima-Mizuno-Yoshise, Monteiro-Adler, Renegar, Vaidya and Ye. It operates in a primal-dual setting, stays close to the central trajectories, and converges in O ( /n x L ) iterations like the latter methods. (Here n is the number of variables and L the input size of the problem). However, it is motivated by seeking reductions in a suitable potential function as in projective algorithms, and the approximate centering is an automatic byproduct of our choice of …