Journal Article10.1016/J.IJPE.2011.02.002
The maximum capture per unit cost location problem
12
TL;DR: In this article, the problem of siting p new facilities of an entering firm to a competitive market so as to maximize the market share captured from competitors per unit cost was formulated as a mixed 0-1 fractional programming model, in which the fixed cost and transportation cost were incorporated.
read more
About: This article is published in International Journal of Production Economics. The article was published on 01 Jun 2011. The article focuses on the topics: Linear programming & Unit cost.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Globally convergent exact and inexact parametric algorithms for solving large-scale mixed-integer fractional programs and applications in process systems engineering
Zhixia Zhong,Fengqi You +1 more
TL;DR: In this article, a parametric formulation of the general mixed-integer fractional program (MIFP) is proposed, and four exact parametric algorithms based on the root-finding methods, including bisection method, Newton's method, secant method and false position method, respectively, are presented.
63
Designing a retail store network with strategic pricing in a competitive environment
TL;DR: This paper presents a location and pricing model for a retailer that sells a homogeneous product to maximize profit in a competitive environment and develops a solution framework composed of two phases (location and pricing) to solve the problem.
32
Evolutionary Location and Pricing Strategies in Competitive Hierarchical Distribution Systems: A Spatial Agent-Based Model
Zhou He,T.C.E. Cheng,Jichang Dong,Shouyang Wang +3 more
- 01 Jul 2014
TL;DR: This paper proposes a spatial agent-based model (SAM), grounded in complex adaptive systems, which comprises four types of agents, namely the world, the manufacturer, firms, and consumers, and derives the firms' optimal behaviors in response to competition by evaluating the evolutionary location and pricing strategies using a genetic algorithm.
31
Bi-objective design of household E-waste collection with public advertising and competition from informal sectors.
TL;DR: This paper proposes to design a household e-waste collection network and launch a corresponding public service advertising campaign to counteract the informal recycling markets, and offers a policy design decision support tool to help regulators determine most workable policies that will balance the trade-offs between the two objectives.
24
Shopping center design using a facility layout assignment approach
Sherif A. Fahmy,Bader A. Alablani,Tamer F. Abdelmaguid +2 more
- 01 Dec 2014
TL;DR: This study proposes a facility layout assignment model for shopping centers with the objective of maximizing flow capturing in each location and balancing it across all shopping center areas.
10
References
Stability in Competition
TL;DR: In this paper, it was shown that if the purveyor of an article gradually increases his price while his rivals keep theirs fixed, the diminution in volume of his sales will in general take place continuously rather than in the abrupt way which has tacitly been assumed.
8.4K
•Book
Integer and Combinatorial Optimization
George L. Nemhauser,Laurence A. Wolsey +1 more
- 01 Jan 1988
TL;DR: This chapter discusses the Scope of Integer and Combinatorial Optimization, as well as applications of Special-Purpose Algorithms and Matching.
Integer and Combinatorial Optimization: Nemhauser/Integer and Combinatorial Optimization
George L. Nemhauser,Laurence A. Wolsey +1 more
- 16 Jun 1988
Abstract: FOUNDATIONS. The Scope of Integer and Combinatorial Optimization. Linear Programming. Graphs and Networks. Polyhedral Theory. Computational Complexity. Polynomial-Time Algorithms for Linear Programming. Integer Lattices. GENERAL INTEGER PROGRAMMING. The Theory of Valid Inequalities. Strong Valid Inequalities and Facets for Structured Integer Programs. Duality and Relaxation. General Algorithms. Special-Purpose Algorithms. Applications of Special- Purpose Algorithms. COMBINATORIAL OPTIMIZATION. Integral Polyhedra. Matching. Matroid and Submodular Function Optimization. References. Indexes.
4.4K