Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Robust optimization approach for long-term project pricing
Download
index.pdf
Date
2010
Author
Balkan, Kaan
Metadata
Show full item record
Item Usage Stats
204
views
60
downloads
Cite This
In this study, we address the long-term project pricing problem for a company that operates in the defense industry. The pricing problem is a bid project pricing problem which includes various technical and financial uncertainties, such as estimations of workhour content of the project and exchange & inflation rates. We propose a Robust Optimization (RO) approach that can deal with the uncertainties during the project lifecycle through the identification of several discrete scenarios. The bid project’s performance measures, other than the monetary measures, for R&D projects are identified and the problem is formulated as a multi-attribute utility project pricing problem. In our RO approach, the bid pricing problem is decomposed into two parts which are v solved sequentially: the Penalty-Model, and the RO model. In the Penalty-Model, penalty costs for the possible violations in the company’s workforce level due to the bid project’s workhour requirements are determined. Then the RO model searches for the optimum bid price by considering the penalty cost from the Penalty-Model, the bid project’s performance measures, the probability of winning the bid for a given bid price and the deviations in the bid project’s cost. Especially for the R&D type projects, the model tends to place lower bid prices in the expected value solutions in order to win the bid. Thus, due to the possible deviations in the project cost, R&D projects have a high probability of suffering from a financial loss in the expected value solutions. However, the robust solutions provide results which are more aware of the deviations in the bid project’s cost and thus eliminate the financial risks by making a tradeoff between the bid project’s benefits, probability of winning the bid and the financial loss risk. Results for the probability of winning in the robust solutions are observed to be lower than the expected value solutions, whereas expected value solutions have higher probabilities of suffering from a financial loss.
Subject Keywords
General works.
URI
http://etd.lib.metu.edu.tr/upload/3/12612104/index.pdf
https://hdl.handle.net/11511/19798
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Discrete tomographic reconstruction methods from the theories of optimization and inverse problems : application in VLSI microchip production
Özgür, Osman; Weber, Gerhard Wilhelm; Department of Scientific Computing (2006)
Optimization theory is a key technology for inverse problems of reconstruction in science, engineering and economy. Discrete tomography is a modern research field dealing with the reconstruction of finite objects in, e.g., VLSI chip design, where this thesis will focus on. In this work, a framework with its supplementary algorithms and a new problem reformulation are introduced to approximately resolve this NP-hard problem. The framework is modular, so that other reconstruction methods, optimization techniq...
Beam search algorithm for capacity allocation problem in flexible manufacturing systems
Ozpeynirci, Selin Bilgin; Azizoğlu, Meral (Elsevier BV, 2009-05-01)
This study considers the operation assignment and tool allocation problem in flexible manufacturing systems. A set of operations together with their required tools are selected so as to maximize the total weight. The machines have limited time and tool magazine capacities and the tools are available in limited quantities. We develop a beam search algorithm and obtain near optimal solutions for large size problems very quickly.
Value-based risk management in defense projects pricing with a robust optimization approach
Aker, Kerime Özge; Meral, Fatma Sedef; Department of Industrial Engineering (2015)
In this study, we address the bid pricing problem of a defense company facing with supply chain and financial risks due to long-term project planning. Creating shareholder value has become a quite popular topic in business as value-adding companies are the only ones to survive in the market. We formulate the problem as a value-based performance and risk management model through robust optimization approach in order to cope with various ambiguities over project lifecycle with possible discrete scenario set. ...
Approximation of sell-out probability to estimate expected marginal value of capacity
Selçuk, Ahmet Melih; Avşar, Zeynep Müge (Elsevier BV, 2020-01-01)
© 2020 Elsevier LtdIn this study, the dynamic pricing problem is considered for single-leg airline revenue management. The dynamic programming formulation given for this problem is expressed in terms of the expected marginal revenue of capacity. In order to make the formulation applicable in practice, approximations are proposed in this study for estimating the expected marginal revenue term. Numerical tests based on simulating the sales process show that the proposed approximations work well as compared to...
Exact and heuristic approaches for joint maintenance and spare parts planning
Bulbul, Pinar; Bayındır, Zeynep Pelin; Bakal, İsmail Serdar (Elsevier BV, 2019-03-01)
In this study, we consider the joint problem of preventive replacement and spare parts inventory planning. We present an exact dynamic programming formulation to minimize the total expected cost over a finite planning horizon. As it is not possible to represent the optimal solution by a well-defined and practical policy, and the dynamic programming recursion is time-consuming to apply, we propose three heuristic approaches that are easy to understand and to implement in practice: (i) Steady-State Approximat...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
K. Balkan, “Robust optimization approach for long-term project pricing,” M.S. - Master of Science, Middle East Technical University, 2010.