0000000000139008

AUTHOR

Christian Michelot

showing 6 related works from this author

Applications and numerical convergence of the partial inverse method

2006

In 1983, J.E. Spingarn introduced what he called the Partial Inverse Method in the framework of Mathematical Programming. Since his initial articles, numerous applications have been given in various fields including Lagrangian multipliers methods, location theory, convex feasibility problems, analysis of data, economic equilibrium problems. In a first part of this paper we give a survey of these applications. Then by means of optimization problems relevant to location theory such as single and multifacility minimisum or minimax location problems, we examine the main advantages of the algorithm and we point out its drawbacks mainly concerning the rate of convergence. We study how different p…

Reduction (complexity)symbols.namesakeMathematical optimizationOptimization problemRate of convergenceComputer scienceLagrange multiplierConvergence (routing)symbolsOrder of accuracyMinimaxNumerical stability
researchProduct

Sufficient conditions for coincidence in minisum multifacility location problems with a general metric

1991

It is a well observed fact that in minisum multifacility location problems the optimal locations of several facilities often tend to coincide. Some sufficient conditions for this phenomenon, involving only the weights and applicable to any metric, have been published previously. The objective of this paper is to show how these conditions may be extended further and to obtain a more complete description of their implications, in particular, in the case of certain locational constraints.

Mathematical optimizationShortest path problemMetric (mathematics)Graph (abstract data type)Management Science and Operations ResearchCoincidenceComputer Science ApplicationsMathematics
researchProduct

A contribution to the linear programming approach to joint cost allocation: Methodology and application

2009

Abstract The linear programming (LP) approach has been commonly proposed for joint cost allocation purposes. Within a LP framework, the allocation rules are based on a marginal analysis. Unfortunately, the additivity property which is required to completely allocate joint costs fails in presence of capacity, institutional or environmental constraints. In this paper, we first illustrate that the non allocated part can be interpreted as a type of producer’s surplus. Then, by using the information contained in the Simplex tableau we propose an original two-stage methodology based on the marginal costs and the production elasticity of input factors to achieve an additive cost allocation pattern…

Marginal costMathematical optimizationCost allocationInformation Systems and ManagementSimplexGeneral Computer ScienceLinear programmingIterative methodManagement Science and Operations Researchcomputer.software_genreIndustrial and Manufacturing EngineeringExpert systemJoint costSimplex algorithmModeling and SimulationcomputerMathematicsEuropean Journal of Operational Research
researchProduct

Duality for constrained multifacility location problems with mixed norms and applications

1989

A dual problem is developed for the constrained multifacility minisum location problems involving mixed norms. General optimality conditions are also obtained providing new algorithms based on the concept of partial inverse of a multifunction. These algorithms which are decomposition methods, generate sequences globally converging to a primal and a dual solution respectively. Numerical results are reported.

Mathematical optimizationTheory of computationGeneral Decision SciencesInverseDuality (optimization)Management Science and Operations ResearchMathematicsAnnals of Operations Research
researchProduct

Efficiency in constrained continuous location

1998

Abstract We present a geometrical characterization of the efficient, weakly efficient and strictly efficient points for multi-objective location problems in presence of convex constraints and when distances are measured by an arbitrary norm. These results, established for a compact set of demand points, generalize similar characterizations previously obtained for uncontrained problems. They are used to show that, in planar problems, the set of constrained weakly efficient points always coincides with the closest projection of the set of unconstrained weakly efficient points onto the feasible set. This projection property which are known previously only for strictly convex norms, allows to e…

Information Systems and ManagementGeneral Computer ScienceFeasible regionRegular polygonProjection propertyManagement Science and Operations ResearchTopologyIndustrial and Manufacturing EngineeringPlanarCompact spaceModeling and SimulationNorm (mathematics)Convex functionMathematicsEuropean Journal of Operational Research
researchProduct

Enquête longitudinale 2, la première année d'études, la réussite, l'abandon, l'échec

1976

International audience

Enquête longitudinaleRéussite universitaireEchec universitaire[SHS.EDU]Humanities and Social Sciences/Education[SHS.EDU] Humanities and Social Sciences/EducationÉtudes universitairesAbandon des étudesComputingMilieux_MISCELLANEOUSEnseignement supérieur
researchProduct