Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems

A Dinkelbach-type algorithm is proposed in this paper to solve a class of continuous-time linear fractional programming problems. We shall transform this original problem into a continuous-time non-fractional programming problem, which unfortunately happens to be a continuous-time nonlinear programming problem. In order to tackle this nonlinear problem, we propose the auxiliary problem that will be formulated as parametric continuous-time linear programming problem. We also introduce a dual problem of this parametric continuous-time linear programming problem in which the weak duality theorem also holds true. We introduce the discrete approximation method to solve the primal and dual pair of parametric continuous-time linear programming problems by using the recurrence method. Finally, we provide two numerical examples to demonstrate the usefulness of this practical algorithm.

[1]  M. Pullan.  Forms of Optimal Solutions for Separated Continuous Linear Programs , 1995 .

[2]  G. J. Zalmai.  Optimality conditions and duality for a class of continuous-time generalized fractional programming problems , 1990 .

[3]  G. J. Zalmai.  Optimality Conditions and Duality Models for a Class of Nonsmooth Constrained Fractional Optimal Control Problems , 1997 .

[4]  M. R. Pouryayevali,et al.  Optimality Criteria for Nonsmooth Continuous-Time Problems of Multiobjective Optimization , 2008 .

[5]  W. Tyndall,et al.  An Extended Duality Theorem for Continuous Linear Programming Problems , 1967 .

[6]  J. Marsden,et al.  Elementary classical analysis , 1974 .

[7]  MAX-MIN CASE,et al.  RECENT DEVELOPMENTS IN FRACTIONAL PROGRAMMING : SINGLE RATIO AND , 2004 .

[8]  T. Reiland.  Optimality conditions and duality in continuous programming I. Convex programs and a theorem of the alternative , 1980 .

[9]  S. Schaible.  Fractional programming: Applications and algorithms , 1981 .

[10]  Nonsmooth Continuous-Time Optimization Problems: Sufficient Conditions , 1998 .

[11]  W. Tyndall.  A DUALITY THEOREM FOR A CLASS OF CONTINUOUS LINEAR PROGRAMMING PROBLEMS , 1965 .

[12]  M. Pullan.  A Duality Theory for Separated Continuous Linear Programs , 1996 .

[13]  A class of infinite dimensional linear programming problems , 1982 .

[14]  Murray Schechter,et al.  Duality in continuous linear programming , 1972 .

[15]  Ioan M. Stancu-Minasian,et al.  Continuous time linear-fractional programming. The minimum-risk approach , 2000, RAIRO Oper. Res..

[16]  Gideon Weiss,et al.  A simplex based algorithm to solve separated continuous linear programs , 2008, Math. Program..

[17]  Malcolm Craig Pullan,et al.  An extended algorithm for separated continuous linear programs , 2002, Math. Program..

[18]  M. A. Hanson,et al.  Continuous time programming with nonlinear time-delayed constraints☆ , 1974 .

[19]  J. Dieudonne.  Foundations of Modern Analysis , 1969 .

[20]  E. Anderson,et al.  Some Properties of a Class of Continuous Linear Programs , 1983 .

[21]  M. R. Pouryayevali,et al.  Duality for Nonsmooth Continuous-Time Problems of Vector Optimization , 2008 .

[22]  André F. Perold,et al.  Optimality conditions and strong duality in abstract and continuous-time linear programming , 1983 .

[23]  A. Friedman.  Foundations of modern analysis , 1970 .

[24]  M. Pullan.  An algorithm for a class of continuous linear programs , 1993 .

[25]  C Tofallis,et al.  Fractional Programming: Theory, Methods and Applications , 1997, J. Oper. Res. Soc..

[26]  M. A. Hanson,et al.  Continuous time programming with nonlinear constraints , 1974 .

[27]  M. A. Hanson,et al.  Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems , 1980 .

[28]  Edward J. Anderson,et al.  Purification for separated continuous linear programs , 1996, Math. Methods Oper. Res..

[29]  Andy Philpott,et al.  On the Solutions of a Class of Continuous Linear Programs , 1994 .

[30]  G. Jailan Zalmai.  Duality for a class of continuous-time homogeneous fractional programming problems , 1986, Z. Oper. Research.

[31]  Panos M. Pardalos,et al.  Global optimization of fractional programs , 1991, J. Glob. Optim..

[32]  R. Grinold.  Continuous programming part two: Nonlinear objectives , 1969 .

[33]  N. Levinson,et al.  A class of continuous linear programming problems , 1966 .

[34]  M. A. Hanson,et al.  A class of continuous convex programming problems , 1968 .

[35]  Malcolm Craig Pullan.  Convergence of a General Class of Algorithms for Separated Continuous Linear Programs , 2000, SIAM J. Optim..

[36]  Saddle-point optimality criteria of continuous time programming without differentiability , 1977 .

[37]  C. Singh.  A sufficient optimality criterion in continuous time programming for generalized convex functions , 1978 .

[38]  Panos M. Pardalos,et al.  Optimality Conditions and Duality for a Class of Nonlinear Fractional Programming Problems , 2001 .

[39]  Yan-Kuen Wu,et al.  A recurrence method for a special class of continuous time linear programming problems , 2010, J. Glob. Optim..

[40]  T. Reiland,et al.  Optimality conditions and duality in continuous programming II. The linear problem revisited , 1980 .

[41]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[42]  Lisa Fleischer,et al.  Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions , 2005, Math. Oper. Res..

[43]  Siegfried Schaible,et al.  Fractional Programming , 2009, Encyclopedia of Optimization.