2007
DOI: 10.1142/s0219622007002745
|View full text |Cite
|
Sign up to set email alerts
|

Linear Programming Models With Changeable Parameters — Theoretical Analysis on "Taking Loss at the Ordering Time and Making Profit at the Delivery Time"

Abstract: Corporate competence sets can be expanded through capital investment and be dynamically changed overtime, which can explain the phenomenon of "taking loss at the ordering time and making profit at the time of delivery". Such phenomenon has existed in practice for a long time, but there are no mathematical model that can explain it adequately. This paper utilizes multiple criteria and multiple constraint levels linear programming (MC2LP) model and its extended techniques to explore the linear programming models… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2010
2010
2014
2014

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…However, the question arises, what if the ideal point still cannot satisfy the decision makers? Although ChiangLin et al (2007) proposed another model to resolve the above problem, their model still cannot ensure that the desired level, which is wanted by the decision maker, can be achieved. This might be true if adding the effects of y and z still cannot achieve the desired point.…”
Section: De Novo Programmingmentioning
confidence: 99%
See 1 more Smart Citation
“…However, the question arises, what if the ideal point still cannot satisfy the decision makers? Although ChiangLin et al (2007) proposed another model to resolve the above problem, their model still cannot ensure that the desired level, which is wanted by the decision maker, can be achieved. This might be true if adding the effects of y and z still cannot achieve the desired point.…”
Section: De Novo Programmingmentioning
confidence: 99%
“…It has been over 60 years since the simplex algorithm was proposed by Dantzig (1947) as a discipline for handling optimization problems. In the same year, von Neumann (1947) developed the theory of duality as a linear optimization solution and applied it in the field of In addition, the concept of the "changeable space" of mathematical programming was also proposed by (Yu, ChiangLin 2006;ChiangLin et al 2007;Yu, Chen 2010 to illustrate that the parameters of a system may in practice be changed via investment, outsourcing or production improvement. However, they did not develop a complete model to resolve the mathematical programming problems of changeable parameters, also called "changeable space".…”
Section: Introductionmentioning
confidence: 99%
“…The theory of HD was first introduced by Yu in 1977, was formulated in 1980 (P. L. Yu, 1980), and became a system of thought by 1985 (P. L. Yu, 1995). Since then, researchers in this field have disclosed a wealth of applications in mathematical (Chan & Yu, 1985;Chianglin, Lai, & Yu, 2007;Datta & Yu, 1991;P. L. Yu & Zhang, 1989a,1989b and qualitative (Chen, Huang, & Yu, 2012;P.…”
Section: Introductionmentioning
confidence: 99%