A paradox in linear fractional transportation problems with mixed constraints

The present paper studies a paradox in Linear Fractional Transportation Problems with 'mixed constraints'. A sufficient condition for the existence of a paradox is established. Paradoxical range of flow is obtained for any flow in which the corresponding objective function value is less than that of the original Linear Fractional Transportation Problem with 'mixed constraints'     

Locally unique solutions of quadratic programs,linear and nonlinear complementarity problems

It is shown that McCormick's second order sufficient optimality conditions are also necessary for a solution to a quadratic program to be locally unique and hence these conditions completely characterize a locally unique solution of any quadratic program. This result is then used to give characterizations of a locally unique solution to the linear complementarity problem. Sufficient conditions are also given for local uniqueness of solutions of the nonlinear complementarity problem.Research supported by National Science Foundation Grant MCS74-20584 A02.     

The fractional knowledge and algebraic reasoning of students with the first multiplicative concept

To understand relationships between students’ quantitative reasoning with fractions and their algebraic reasoning, a clinical interview study was conducted with 18 middle and high school students. Six students with each of three different multiplicative concepts participated. This paper reports on the fractional knowledge and algebraic reasoning of six students with the most basic multiplicative concept. The fractional knowledge of these students was found to be consistent with prior research, in that the students had constructed partitioning and iteration operations but not disembedding operations, and that the students conceived of fractions as parts within wholes. The students’ iterating operations facilitated their work on algebra problems, but the lack of disembedding operations was a significant constraint in writing algebraic equations and expressions, as well as in generalizing relationships. Implications for teaching these students are discussed.     

Extensions of Dinkelbach's algorithm for solving non-linear fractional programming problems

Dinkelbach's algorithm was developed to solve convex fractinal programming. This method achieves the optimal solution of the optimisation problem by means of solving a sequence of non-linear convex programming subproblems defined by a parameter. In this paper it is shown that Dinkelbach's algorithm can be used to solve general fractional programming. The applicability of the algorithm will depend on the possibility of solving the subproblems. Dinkelbach's extended algorithm is a framework to describe several algorithms which have been proposed to solve linear fractional programming, integer linear fractional programming, convex fractional programming and to generate new algorithms. The applicability of new cases as nondifferentiable fractional programming and quadratic fractional programming has been studied. We have proposed two modifications to improve the speed-up of Dinkelbachs algorithm. One is to use interpolation formulae to update the parameter which defined the subproblem and another truncates the solution of the suproblem. We give sufficient conditions for the convergence of these modifications. Computational experiments in linear fractional programming, integer linear fractional programming and non-linear fractional programming to evaluate the efficiency of these methods have been carried out.     

Some exact solutions to Stefan problems with fractional differential equations

Some exact solutions to the first, second and extended Stefan problems with fractional time derivative described in the Caputo sense are given by means of fractional Green's function and Wright function in this paper. By the aid of simple calculations, many results of differential equations of integer order can be obtained as special cases of the results given by this paper.     

Existence, attractiveness and stability of solutions for quadratic Urysohn fractional integral equations

In this paper, existence and attractiveness of solutions for quadratic Urysohn fractional integral equations on an unbounded interval are obtained by virtue of Tichonov fixed point theorem and suitable conjunction of the well known measure ω₀(X) and the spaces C(R⁺). Further, three certain solutions sets X_L,γ, X_1,α and X_{1,(1−(α+v))}, which tending to zero at an appropriate rate t^−ν (ν > 0), ν = γ (or α or 1 − (α + v)) as t → ∞, are introduced and stability of solutions for quadratic Urysohn fractional integral equations are obtained based on these solutions sets respectively by applying Schauder fixed point theorem via some easy checked conditions. An example is given to illustrate the results.     

A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints

In this paper a barrier function method is proposed for approximating a solution of the nonconvex quadratic programming problem with box constraints. The method attempts to produce a solution of good quality by following a path as the barrier parameter decreases from a sufficiently large positive number. For a given value of the barrier parameter, the method searches for a minimum point of the barrier function in a descent direction, which has a desired property that the box constraints are always satisfied automatically if the step length is a number between zero and one. When all the diagonal entries of the objective function are negative, the method converges to at least a local minimum point of the problem if it yields a local minimum point of the barrier function for a sequence of decreasing values of the barrier parameter with zero limit. Numerical results show that the method always generates a global or near global minimum point as the barrier parameter decreases at a sufficiently slow pace.     

Proper efficiency and duality for a class of multiobjective fractional variational problems containing arbitrary norms

Necessary and sufficient conditions are established for properly efficient solutions of a class of nonsmooth nonconvex variational problems with multiple fractional objective functions and nonlinear inequality constraints. Based on these proper efficiency criteria. two multiobjective dual problems are constructed and appropriate duality theorems are proved. These proper efficiency and duality results also contain as special cases similar rcsults fer constrained variational problems with multiplei fractional. and conventional objective functions, which are particular cases of the main variational problem considered in this paper     

Simple bounds for solutions of monotone complementarity problems and convex programs

For a solvable monotone complementarity problem we show that each feasible point which is not a solution of the problem provides simple numerical bounds for some or all components of all solution vectors. Consequently for a solvable differentiable convex program each primal-dual feasible point which is not optimal provides simple bounds for some or all components of all primal-dual solution vectors. We also give an existence result and simple bounds for solutions of monotone compementarity problems satisfying a new, distributed constraint qualification. This result carries over to a simple existence and boundedness result for differentiable convex programs satisfying a similar constraint qualification.Sponsored by the United States Army under Contract No. DAAG29-80-C-0041. This material is based on work sponsored by National Science Foundation Grants MCS-8200632 and MCS-8102684.     

SEQUENTIAL QUADRATIC PROGRAMMING METHODS FOR OPTIMAL CONTROL PROBLEMS WITH STATE CONSTRAINTS

A Kind of direct methods is presented for the solution of optimal control problems with state constraints.These methods are sequential quadratic programming methods.At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and Linear approximations to constraints is solved to get a search direction for a merit function.The merit function is formulated by augmenting the Lagrangian funetion with a penalty term.A line search is carried out along the search direction to determine a step length such that the merit function is decreased.The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadrade programming methods.     

Asymptotic behavior of solutions for nonlinear elliptic problems with the fractional Laplacian

In this paper we study the asymptotic behavior of least energy solutions and the existence of multiple bubbling solutions of nonlinear elliptic equations involving the fractional Laplacians and the critical exponents. This work can be seen as a nonlocal analog of the results of Han (1991) [24] and Rey (1990) [35].     

Existence and uniqueness of solutions for a fractional differential equation with multi-point boundary value problems

In this paper, we study the existence and uniqueness solutions of a fractional differential equation with multi-point boundary value problems. By using the fixed point theorems, some new results are established and two examples are given to demonstrate the application of main results.     

Uniqueness and parameter dependence of positive solutions to higher order boundary value problems with fractional $q$-derivatives

The authors study a class of nonlinear higher order boundary value problem with fractional $q$-erivativesand dependence on a positive parameter $\lm$.The existence, uniqueness, and dependence of positive solutions on $\lm$ are discussed.Two sequences are constructed so that they converge uniformly to the unique solution of the problems.Two examples are included in the paper. Numerical computations of the examples confirm their theoretical results.     

Numerical solutions to initial and boundary value problems for linear fractional partial differential equations

In this article, Haar wavelets have been employed to obtain solutions of boundary value problems for linear fractional partial differential equations. The differential equations are reduced to Sylvester matrix equations. The algorithm is novel in the sense that it effectively incorporates the aperiodic boundary conditions. Several examples with numerical simulations are provided to illustrate the simplicity and effectiveness of the method.     

Existence and multiplicity of weak solutions for a class of fractional Sturm-Liouville boundary value problems with impulsive conditions

In this paper, we consider the existence and multiplicity of weak solutions for a class of fractional differential equations with non-homogeneous Sturm-Liouville conditions and impulsive conditions by using the critical point theory. In addition, at the end of this paper, we also give the existence results of infinite weak solutions of fractional differential equations under homogeneous Sturm-Liouville boundary value conditions. Finally, several examples are given to illustrate our main results.     

On the concept and existence of solutions for fractional impulsive systems with Hadamard derivatives

In this paper, a class of nonlinear fractional order differential impulsive systems with Hadamard derivative is discussed. First, a reasonable concept on the solutions of fractional impulsive Cauchy problems with Hadamard derivative and the corresponding fractional integral equations are established. Second, two fundamental existence results are presented by using standard fixed point methods. Finally, two examples are given to illustrate our theoretical results.     

Theory and algorithms for linear multiple objective programs with zero–one variables

A new algorithm and theoretical results are presented for linear multiple objective programs with zero–one variables. A procedure to identify strong and weak efficient points as well as an extension of the main problem are analyzed. Extensive computational results are given and several topics for further research are discussed.     

Existence and uniqueness of solutions of initial value problems for nonlinear langevin equation involving two fractional orders

The solvability of initial value problems for nonlinear Langevin equation involving two fractional orders are discussed in this paper. An existence result for the solution is obtained using the Leray–Schauder nonlinear alternative. In addition, sufficient conditions for unique solution are established under the Banach contraction principle. The existence results for the initial value problems of nonlinear classical Langevin equation follow as a special case of our results.